./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-collitem-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 631177edb7ca950f3594c5b6eaac98148a00ee69e6a0cd62c1c95947fa56259c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:47:43,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:47:43,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:47:43,143 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:47:43,143 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:47:43,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:47:43,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:47:43,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:47:43,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:47:43,163 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:47:43,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:47:43,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:47:43,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:47:43,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:47:43,163 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:47:43,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:47:43,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:47:43,164 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:47:43,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:47:43,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:47:43,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:47:43,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:47:43,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:47:43,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:47:43,165 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:47:43,165 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:47:43,165 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:47:43,165 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:47:43,165 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:47:43,165 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:47:43,166 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:47:43,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:47:43,166 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:47:43,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:47:43,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:47:43,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:47:43,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:47:43,166 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:47:43,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:47:43,166 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:47:43,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:47:43,166 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:47:43,166 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:47:43,166 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:47:43,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:47:43,167 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 631177edb7ca950f3594c5b6eaac98148a00ee69e6a0cd62c1c95947fa56259c [2025-02-06 18:47:43,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:47:43,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:47:43,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:47:43,381 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:47:43,382 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:47:43,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-collitem-symm.wvr.c [2025-02-06 18:47:44,554 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d014707d5/8e4105023d2e4114bdda055645a09b3b/FLAGea1071206 [2025-02-06 18:47:44,783 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:47:44,783 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-symm.wvr.c [2025-02-06 18:47:44,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d014707d5/8e4105023d2e4114bdda055645a09b3b/FLAGea1071206 [2025-02-06 18:47:44,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d014707d5/8e4105023d2e4114bdda055645a09b3b [2025-02-06 18:47:44,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:47:44,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:47:44,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:47:44,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:47:44,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:47:44,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:47:44" (1/1) ... [2025-02-06 18:47:44,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46904ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:44, skipping insertion in model container [2025-02-06 18:47:44,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:47:44" (1/1) ... [2025-02-06 18:47:44,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:47:44,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:47:44,973 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:47:44,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:47:45,000 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:47:45,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:45 WrapperNode [2025-02-06 18:47:45,001 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:47:45,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:47:45,002 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:47:45,002 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:47:45,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:45" (1/1) ... [2025-02-06 18:47:45,013 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:45" (1/1) ... [2025-02-06 18:47:45,042 INFO L138 Inliner]: procedures = 21, calls = 26, calls flagged for inlining = 16, calls inlined = 30, statements flattened = 365 [2025-02-06 18:47:45,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:47:45,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:47:45,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:47:45,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:47:45,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:45" (1/1) ... [2025-02-06 18:47:45,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:45" (1/1) ... [2025-02-06 18:47:45,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:45" (1/1) ... [2025-02-06 18:47:45,067 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-02-06 18:47:45,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:45" (1/1) ... [2025-02-06 18:47:45,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:45" (1/1) ... [2025-02-06 18:47:45,072 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:45" (1/1) ... [2025-02-06 18:47:45,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:45" (1/1) ... [2025-02-06 18:47:45,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:45" (1/1) ... [2025-02-06 18:47:45,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:45" (1/1) ... [2025-02-06 18:47:45,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:47:45,078 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:47:45,078 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:47:45,079 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:47:45,079 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:45" (1/1) ... [2025-02-06 18:47:45,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:47:45,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:47:45,102 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:47:45,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:47:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:47:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 18:47:45,122 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 18:47:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 18:47:45,122 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 18:47:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:47:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 18:47:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 18:47:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:47:45,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:47:45,123 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 18:47:45,181 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:47:45,182 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:47:45,674 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:47:45,675 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:47:46,567 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:47:46,567 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:47:46,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:47:46 BoogieIcfgContainer [2025-02-06 18:47:46,568 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:47:46,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:47:46,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:47:46,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:47:46,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:47:44" (1/3) ... [2025-02-06 18:47:46,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a9d502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:47:46, skipping insertion in model container [2025-02-06 18:47:46,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:45" (2/3) ... [2025-02-06 18:47:46,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a9d502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:47:46, skipping insertion in model container [2025-02-06 18:47:46,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:47:46" (3/3) ... [2025-02-06 18:47:46,575 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-collitem-symm.wvr.c [2025-02-06 18:47:46,587 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:47:46,589 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-02-06 18:47:46,589 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:47:47,106 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 18:47:47,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 64 transitions, 142 flow [2025-02-06 18:47:47,214 INFO L124 PetriNetUnfolderBase]: 0/62 cut-off events. [2025-02-06 18:47:47,215 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 18:47:47,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 62 events. 0/62 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 346 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-02-06 18:47:47,217 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 64 transitions, 142 flow [2025-02-06 18:47:47,223 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 60 transitions, 129 flow [2025-02-06 18:47:47,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:47:47,247 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;@6055428a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:47:47,249 INFO L334 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2025-02-06 18:47:47,256 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:47:47,257 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 18:47:47,258 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:47:47,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:47:47,258 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:47:47,259 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 18:47:47,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:47:47,263 INFO L85 PathProgramCache]: Analyzing trace with hash 40291453, now seen corresponding path program 1 times [2025-02-06 18:47:47,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:47:47,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533291834] [2025-02-06 18:47:47,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:47:47,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:47:47,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:47:47,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:47:47,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:47:47,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:47:47,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:47:47,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:47:47,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533291834] [2025-02-06 18:47:47,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533291834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:47:47,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:47:47,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:47:47,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078355133] [2025-02-06 18:47:47,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:47:47,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 18:47:47,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:47:47,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 18:47:47,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 18:47:47,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 64 [2025-02-06 18:47:47,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 129 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-02-06 18:47:47,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:47:47,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 64 [2025-02-06 18:47:47,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:47:48,396 INFO L124 PetriNetUnfolderBase]: 1062/1861 cut-off events. [2025-02-06 18:47:48,397 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-06 18:47:48,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3766 conditions, 1861 events. 1062/1861 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 14766 event pairs, 1062 based on Foata normal form. 0/596 useless extension candidates. Maximal degree in co-relation 3663. Up to 1843 conditions per place. [2025-02-06 18:47:48,409 INFO L140 encePairwiseOnDemand]: 48/64 looper letters, 42 selfloop transitions, 0 changer transitions 0/44 dead transitions. [2025-02-06 18:47:48,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 44 transitions, 181 flow [2025-02-06 18:47:48,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 18:47:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 18:47:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2025-02-06 18:47:48,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.515625 [2025-02-06 18:47:48,420 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 129 flow. Second operand 2 states and 66 transitions. [2025-02-06 18:47:48,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 44 transitions, 181 flow [2025-02-06 18:47:48,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:47:48,428 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 92 flow [2025-02-06 18:47:48,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=92, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2025-02-06 18:47:48,433 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -18 predicate places. [2025-02-06 18:47:48,434 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 92 flow [2025-02-06 18:47:48,434 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-02-06 18:47:48,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:47:48,434 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:47:48,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:47:48,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 18:47:48,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:47:48,436 INFO L85 PathProgramCache]: Analyzing trace with hash 40291454, now seen corresponding path program 1 times [2025-02-06 18:47:48,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:47:48,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098621941] [2025-02-06 18:47:48,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:47:48,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:47:48,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:47:48,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:47:48,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:47:48,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:47:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:47:48,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:47:48,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098621941] [2025-02-06 18:47:48,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098621941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:47:48,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:47:48,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:47:48,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089638667] [2025-02-06 18:47:48,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:47:48,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:47:48,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:47:48,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:47:48,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:47:48,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 64 [2025-02-06 18:47:48,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 92 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-02-06 18:47:48,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:47:48,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 64 [2025-02-06 18:47:48,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:47:49,139 INFO L124 PetriNetUnfolderBase]: 952/1673 cut-off events. [2025-02-06 18:47:49,140 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:47:49,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3368 conditions, 1673 events. 952/1673 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 13035 event pairs, 952 based on Foata normal form. 0/547 useless extension candidates. Maximal degree in co-relation 3365. Up to 1655 conditions per place. [2025-02-06 18:47:49,148 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 39 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2025-02-06 18:47:49,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 168 flow [2025-02-06 18:47:49,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:47:49,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:47:49,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-02-06 18:47:49,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28125 [2025-02-06 18:47:49,150 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 92 flow. Second operand 3 states and 54 transitions. [2025-02-06 18:47:49,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 168 flow [2025-02-06 18:47:49,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:47:49,152 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 90 flow [2025-02-06 18:47:49,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2025-02-06 18:47:49,153 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -18 predicate places. [2025-02-06 18:47:49,153 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 90 flow [2025-02-06 18:47:49,153 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-02-06 18:47:49,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:47:49,153 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:47:49,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 18:47:49,154 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 18:47:49,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:47:49,156 INFO L85 PathProgramCache]: Analyzing trace with hash 40291455, now seen corresponding path program 1 times [2025-02-06 18:47:49,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:47:49,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202515635] [2025-02-06 18:47:49,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:47:49,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:47:49,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:47:49,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:47:49,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:47:49,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:47:49,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:47:49,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:47:49,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202515635] [2025-02-06 18:47:49,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202515635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:47:49,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:47:49,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:47:49,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029298537] [2025-02-06 18:47:49,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:47:49,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:47:49,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:47:49,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:47:49,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:47:49,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 64 [2025-02-06 18:47:49,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 90 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-02-06 18:47:49,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:47:49,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 64 [2025-02-06 18:47:49,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:47:49,763 INFO L124 PetriNetUnfolderBase]: 848/1495 cut-off events. [2025-02-06 18:47:49,764 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:47:49,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3013 conditions, 1495 events. 848/1495 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 11434 event pairs, 848 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 3009. Up to 1478 conditions per place. [2025-02-06 18:47:49,770 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 37 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2025-02-06 18:47:49,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 40 transitions, 162 flow [2025-02-06 18:47:49,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:47:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:47:49,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-02-06 18:47:49,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2708333333333333 [2025-02-06 18:47:49,773 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 90 flow. Second operand 3 states and 52 transitions. [2025-02-06 18:47:49,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 40 transitions, 162 flow [2025-02-06 18:47:49,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:47:49,774 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 87 flow [2025-02-06 18:47:49,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2025-02-06 18:47:49,775 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -19 predicate places. [2025-02-06 18:47:49,775 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 87 flow [2025-02-06 18:47:49,775 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-02-06 18:47:49,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:47:49,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:47:49,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:47:49,776 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 18:47:49,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:47:49,776 INFO L85 PathProgramCache]: Analyzing trace with hash 40291457, now seen corresponding path program 1 times [2025-02-06 18:47:49,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:47:49,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992834232] [2025-02-06 18:47:49,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:47:49,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:47:49,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:47:49,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:47:49,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:47:49,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:47:49,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:47:49,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:47:49,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992834232] [2025-02-06 18:47:49,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992834232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:47:49,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:47:49,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:47:49,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388809339] [2025-02-06 18:47:49,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:47:49,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:47:49,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:47:49,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:47:49,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:47:49,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 64 [2025-02-06 18:47:49,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 87 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-02-06 18:47:49,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:47:49,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 64 [2025-02-06 18:47:49,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:47:50,502 INFO L124 PetriNetUnfolderBase]: 750/1327 cut-off events. [2025-02-06 18:47:50,502 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:47:50,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2677 conditions, 1327 events. 750/1327 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 9949 event pairs, 750 based on Foata normal form. 0/455 useless extension candidates. Maximal degree in co-relation 2673. Up to 1311 conditions per place. [2025-02-06 18:47:50,506 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 35 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2025-02-06 18:47:50,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 38 transitions, 155 flow [2025-02-06 18:47:50,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:47:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:47:50,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-02-06 18:47:50,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2604166666666667 [2025-02-06 18:47:50,507 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 87 flow. Second operand 3 states and 50 transitions. [2025-02-06 18:47:50,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 38 transitions, 155 flow [2025-02-06 18:47:50,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:47:50,508 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 84 flow [2025-02-06 18:47:50,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2025-02-06 18:47:50,509 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -20 predicate places. [2025-02-06 18:47:50,509 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 84 flow [2025-02-06 18:47:50,509 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-02-06 18:47:50,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:47:50,509 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:47:50,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:47:50,510 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 18:47:50,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:47:50,510 INFO L85 PathProgramCache]: Analyzing trace with hash 40291458, now seen corresponding path program 1 times [2025-02-06 18:47:50,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:47:50,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656411538] [2025-02-06 18:47:50,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:47:50,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:47:50,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:47:50,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:47:50,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:47:50,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:47:50,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:47:50,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:47:50,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656411538] [2025-02-06 18:47:50,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656411538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:47:50,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:47:50,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:47:50,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529285414] [2025-02-06 18:47:50,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:47:50,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:47:50,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:47:50,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:47:50,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:47:50,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 64 [2025-02-06 18:47:50,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 84 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-02-06 18:47:50,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:47:50,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 64 [2025-02-06 18:47:50,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:47:51,017 INFO L124 PetriNetUnfolderBase]: 658/1169 cut-off events. [2025-02-06 18:47:51,018 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:47:51,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2361 conditions, 1169 events. 658/1169 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 8564 event pairs, 658 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 2357. Up to 1154 conditions per place. [2025-02-06 18:47:51,021 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 33 selfloop transitions, 1 changer transitions 0/36 dead transitions. [2025-02-06 18:47:51,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 148 flow [2025-02-06 18:47:51,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:47:51,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:47:51,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-02-06 18:47:51,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25 [2025-02-06 18:47:51,022 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 84 flow. Second operand 3 states and 48 transitions. [2025-02-06 18:47:51,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 148 flow [2025-02-06 18:47:51,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 36 transitions, 147 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:47:51,027 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 81 flow [2025-02-06 18:47:51,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-02-06 18:47:51,027 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2025-02-06 18:47:51,027 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 81 flow [2025-02-06 18:47:51,027 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-02-06 18:47:51,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:47:51,028 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:47:51,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:47:51,028 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 18:47:51,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:47:51,028 INFO L85 PathProgramCache]: Analyzing trace with hash 40291460, now seen corresponding path program 1 times [2025-02-06 18:47:51,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:47:51,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196848440] [2025-02-06 18:47:51,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:47:51,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:47:51,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:47:51,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:47:51,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:47:51,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:47:51,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:47:51,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:47:51,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196848440] [2025-02-06 18:47:51,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196848440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:47:51,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:47:51,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:47:51,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357700786] [2025-02-06 18:47:51,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:47:51,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:47:51,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:47:51,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:47:51,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:47:51,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 64 [2025-02-06 18:47:51,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 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-02-06 18:47:51,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:47:51,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 64 [2025-02-06 18:47:51,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:47:51,419 INFO L124 PetriNetUnfolderBase]: 572/1021 cut-off events. [2025-02-06 18:47:51,420 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:47:51,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 1021 events. 572/1021 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 7335 event pairs, 572 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 2061. Up to 1007 conditions per place. [2025-02-06 18:47:51,423 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 31 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2025-02-06 18:47:51,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 34 transitions, 141 flow [2025-02-06 18:47:51,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:47:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:47:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-02-06 18:47:51,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23958333333333334 [2025-02-06 18:47:51,424 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 81 flow. Second operand 3 states and 46 transitions. [2025-02-06 18:47:51,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 34 transitions, 141 flow [2025-02-06 18:47:51,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 140 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:47:51,425 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 78 flow [2025-02-06 18:47:51,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2025-02-06 18:47:51,426 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -22 predicate places. [2025-02-06 18:47:51,426 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 78 flow [2025-02-06 18:47:51,426 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-02-06 18:47:51,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:47:51,426 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:47:51,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:47:51,426 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 18:47:51,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:47:51,427 INFO L85 PathProgramCache]: Analyzing trace with hash 40291461, now seen corresponding path program 1 times [2025-02-06 18:47:51,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:47:51,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006311136] [2025-02-06 18:47:51,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:47:51,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:47:51,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:47:51,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:47:51,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:47:51,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:47:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:47:51,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:47:51,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006311136] [2025-02-06 18:47:51,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006311136] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:47:51,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:47:51,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:47:51,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544720889] [2025-02-06 18:47:51,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:47:51,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:47:51,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:47:51,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:47:51,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:47:51,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 64 [2025-02-06 18:47:51,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 78 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-02-06 18:47:51,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:47:51,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 64 [2025-02-06 18:47:51,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:47:51,798 INFO L124 PetriNetUnfolderBase]: 492/883 cut-off events. [2025-02-06 18:47:51,799 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:47:51,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1789 conditions, 883 events. 492/883 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 6184 event pairs, 492 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 1785. Up to 870 conditions per place. [2025-02-06 18:47:51,802 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 29 selfloop transitions, 1 changer transitions 0/32 dead transitions. [2025-02-06 18:47:51,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 32 transitions, 134 flow [2025-02-06 18:47:51,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:47:51,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:47:51,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-02-06 18:47:51,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22916666666666666 [2025-02-06 18:47:51,803 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 78 flow. Second operand 3 states and 44 transitions. [2025-02-06 18:47:51,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 32 transitions, 134 flow [2025-02-06 18:47:51,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 32 transitions, 133 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:47:51,804 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 75 flow [2025-02-06 18:47:51,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2025-02-06 18:47:51,804 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -23 predicate places. [2025-02-06 18:47:51,804 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 75 flow [2025-02-06 18:47:51,804 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-02-06 18:47:51,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:47:51,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:47:51,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:47:51,805 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 18:47:51,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:47:51,805 INFO L85 PathProgramCache]: Analyzing trace with hash 40291463, now seen corresponding path program 1 times [2025-02-06 18:47:51,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:47:51,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623904320] [2025-02-06 18:47:51,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:47:51,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:47:51,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:47:51,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:47:51,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:47:51,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:47:51,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:47:51,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:47:51,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623904320] [2025-02-06 18:47:51,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623904320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:47:51,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:47:51,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:47:51,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039783495] [2025-02-06 18:47:51,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:47:51,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:47:51,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:47:51,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:47:51,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:47:51,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 64 [2025-02-06 18:47:51,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 75 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-02-06 18:47:51,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:47:51,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 64 [2025-02-06 18:47:51,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:47:52,308 INFO L124 PetriNetUnfolderBase]: 418/755 cut-off events. [2025-02-06 18:47:52,308 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:47:52,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1533 conditions, 755 events. 418/755 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 5072 event pairs, 418 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 1529. Up to 743 conditions per place. [2025-02-06 18:47:52,311 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 27 selfloop transitions, 1 changer transitions 0/30 dead transitions. [2025-02-06 18:47:52,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 127 flow [2025-02-06 18:47:52,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:47:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:47:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-02-06 18:47:52,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.21875 [2025-02-06 18:47:52,314 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 75 flow. Second operand 3 states and 42 transitions. [2025-02-06 18:47:52,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 127 flow [2025-02-06 18:47:52,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 30 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:47:52,316 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2025-02-06 18:47:52,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2025-02-06 18:47:52,316 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -24 predicate places. [2025-02-06 18:47:52,316 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2025-02-06 18:47:52,316 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-02-06 18:47:52,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:47:52,317 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:47:52,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:47:52,317 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 18:47:52,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:47:52,317 INFO L85 PathProgramCache]: Analyzing trace with hash 40291464, now seen corresponding path program 1 times [2025-02-06 18:47:52,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:47:52,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921131318] [2025-02-06 18:47:52,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:47:52,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:47:52,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:47:52,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:47:52,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:47:52,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:47:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:47:52,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:47:52,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921131318] [2025-02-06 18:47:52,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921131318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:47:52,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:47:52,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:47:52,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996361170] [2025-02-06 18:47:52,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:47:52,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:47:52,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:47:52,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:47:52,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:47:52,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 64 [2025-02-06 18:47:52,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 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-02-06 18:47:52,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:47:52,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 64 [2025-02-06 18:47:52,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:47:52,639 INFO L124 PetriNetUnfolderBase]: 350/637 cut-off events. [2025-02-06 18:47:52,639 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:47:52,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1297 conditions, 637 events. 350/637 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 4187 event pairs, 350 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 1293. Up to 626 conditions per place. [2025-02-06 18:47:52,641 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 25 selfloop transitions, 1 changer transitions 0/28 dead transitions. [2025-02-06 18:47:52,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 28 transitions, 120 flow [2025-02-06 18:47:52,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:47:52,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:47:52,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2025-02-06 18:47:52,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.20833333333333334 [2025-02-06 18:47:52,643 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states and 40 transitions. [2025-02-06 18:47:52,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 28 transitions, 120 flow [2025-02-06 18:47:52,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 28 transitions, 119 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:47:52,643 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 69 flow [2025-02-06 18:47:52,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2025-02-06 18:47:52,644 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -25 predicate places. [2025-02-06 18:47:52,644 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 69 flow [2025-02-06 18:47:52,644 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-02-06 18:47:52,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:47:52,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:47:52,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:47:52,644 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 18:47:52,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:47:52,645 INFO L85 PathProgramCache]: Analyzing trace with hash 40291466, now seen corresponding path program 1 times [2025-02-06 18:47:52,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:47:52,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624623654] [2025-02-06 18:47:52,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:47:52,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:47:52,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:47:52,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:47:52,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:47:52,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:47:52,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:47:52,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:47:52,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624623654] [2025-02-06 18:47:52,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624623654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:47:52,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:47:52,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:47:52,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317764563] [2025-02-06 18:47:52,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:47:52,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:47:52,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:47:52,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:47:52,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:47:52,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 64 [2025-02-06 18:47:52,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 69 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-02-06 18:47:52,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:47:52,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 64 [2025-02-06 18:47:52,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:47:52,917 INFO L124 PetriNetUnfolderBase]: 288/529 cut-off events. [2025-02-06 18:47:52,918 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:47:52,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 529 events. 288/529 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 3377 event pairs, 288 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 1077. Up to 519 conditions per place. [2025-02-06 18:47:52,920 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 23 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2025-02-06 18:47:52,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 26 transitions, 113 flow [2025-02-06 18:47:52,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:47:52,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:47:52,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-02-06 18:47:52,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.19791666666666666 [2025-02-06 18:47:52,921 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 69 flow. Second operand 3 states and 38 transitions. [2025-02-06 18:47:52,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 26 transitions, 113 flow [2025-02-06 18:47:52,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 26 transitions, 112 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:47:52,921 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 66 flow [2025-02-06 18:47:52,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2025-02-06 18:47:52,922 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -26 predicate places. [2025-02-06 18:47:52,922 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 66 flow [2025-02-06 18:47:52,922 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-02-06 18:47:52,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:47:52,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:47:52,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:47:52,922 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 18:47:52,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:47:52,922 INFO L85 PathProgramCache]: Analyzing trace with hash 40291467, now seen corresponding path program 1 times [2025-02-06 18:47:52,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:47:52,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657377056] [2025-02-06 18:47:52,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:47:52,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:47:52,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:47:52,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:47:52,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:47:52,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:47:52,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:47:52,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:47:52,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657377056] [2025-02-06 18:47:52,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657377056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:47:52,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:47:52,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:47:52,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460464182] [2025-02-06 18:47:52,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:47:52,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:47:52,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:47:52,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:47:52,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:47:52,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 64 [2025-02-06 18:47:52,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 66 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-02-06 18:47:52,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:47:52,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 64 [2025-02-06 18:47:52,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:47:53,240 INFO L124 PetriNetUnfolderBase]: 232/431 cut-off events. [2025-02-06 18:47:53,240 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:47:53,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 431 events. 232/431 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 2599 event pairs, 232 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 881. Up to 422 conditions per place. [2025-02-06 18:47:53,242 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 21 selfloop transitions, 1 changer transitions 0/24 dead transitions. [2025-02-06 18:47:53,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 24 transitions, 106 flow [2025-02-06 18:47:53,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:47:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:47:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-02-06 18:47:53,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.1875 [2025-02-06 18:47:53,243 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 66 flow. Second operand 3 states and 36 transitions. [2025-02-06 18:47:53,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 24 transitions, 106 flow [2025-02-06 18:47:53,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 24 transitions, 105 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:47:53,243 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 63 flow [2025-02-06 18:47:53,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2025-02-06 18:47:53,244 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -27 predicate places. [2025-02-06 18:47:53,244 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 63 flow [2025-02-06 18:47:53,244 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-02-06 18:47:53,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:47:53,244 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:47:53,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:47:53,245 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 18:47:53,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:47:53,245 INFO L85 PathProgramCache]: Analyzing trace with hash 40291469, now seen corresponding path program 1 times [2025-02-06 18:47:53,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:47:53,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837013341] [2025-02-06 18:47:53,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:47:53,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:47:53,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:47:53,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:47:53,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:47:53,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:47:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:47:53,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:47:53,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837013341] [2025-02-06 18:47:53,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837013341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:47:53,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:47:53,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:47:53,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808199765] [2025-02-06 18:47:53,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:47:53,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:47:53,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:47:53,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:47:53,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:47:53,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 64 [2025-02-06 18:47:53,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 63 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-02-06 18:47:53,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:47:53,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 64 [2025-02-06 18:47:53,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:47:53,483 INFO L124 PetriNetUnfolderBase]: 182/343 cut-off events. [2025-02-06 18:47:53,483 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:47:53,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 343 events. 182/343 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 1936 event pairs, 182 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 705. Up to 335 conditions per place. [2025-02-06 18:47:53,484 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 19 selfloop transitions, 1 changer transitions 0/22 dead transitions. [2025-02-06 18:47:53,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 22 transitions, 99 flow [2025-02-06 18:47:53,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:47:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:47:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2025-02-06 18:47:53,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.17708333333333334 [2025-02-06 18:47:53,487 INFO L175 Difference]: Start difference. First operand has 40 places, 24 transitions, 63 flow. Second operand 3 states and 34 transitions. [2025-02-06 18:47:53,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 22 transitions, 99 flow [2025-02-06 18:47:53,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 22 transitions, 98 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:47:53,488 INFO L231 Difference]: Finished difference. Result has 39 places, 22 transitions, 60 flow [2025-02-06 18:47:53,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=39, PETRI_TRANSITIONS=22} [2025-02-06 18:47:53,488 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -28 predicate places. [2025-02-06 18:47:53,488 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 60 flow [2025-02-06 18:47:53,488 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-02-06 18:47:53,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:47:53,488 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:47:53,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 18:47:53,488 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 18:47:53,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:47:53,489 INFO L85 PathProgramCache]: Analyzing trace with hash 40291470, now seen corresponding path program 1 times [2025-02-06 18:47:53,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:47:53,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888399238] [2025-02-06 18:47:53,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:47:53,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:47:53,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:47:53,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:47:53,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:47:53,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:47:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:47:53,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:47:53,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888399238] [2025-02-06 18:47:53,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888399238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:47:53,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:47:53,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:47:53,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730403650] [2025-02-06 18:47:53,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:47:53,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:47:53,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:47:53,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:47:53,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:47:53,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 64 [2025-02-06 18:47:53,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 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-02-06 18:47:53,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:47:53,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 64 [2025-02-06 18:47:53,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:47:53,684 INFO L124 PetriNetUnfolderBase]: 138/265 cut-off events. [2025-02-06 18:47:53,684 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:47:53,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 265 events. 138/265 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 1405 event pairs, 138 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 549. Up to 258 conditions per place. [2025-02-06 18:47:53,685 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 17 selfloop transitions, 1 changer transitions 0/20 dead transitions. [2025-02-06 18:47:53,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 20 transitions, 92 flow [2025-02-06 18:47:53,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:47:53,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:47:53,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2025-02-06 18:47:53,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.16666666666666666 [2025-02-06 18:47:53,686 INFO L175 Difference]: Start difference. First operand has 39 places, 22 transitions, 60 flow. Second operand 3 states and 32 transitions. [2025-02-06 18:47:53,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 20 transitions, 92 flow [2025-02-06 18:47:53,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 20 transitions, 91 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:47:53,687 INFO L231 Difference]: Finished difference. Result has 38 places, 20 transitions, 57 flow [2025-02-06 18:47:53,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=38, PETRI_TRANSITIONS=20} [2025-02-06 18:47:53,688 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -29 predicate places. [2025-02-06 18:47:53,688 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 20 transitions, 57 flow [2025-02-06 18:47:53,688 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-02-06 18:47:53,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:47:53,689 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:47:53,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 18:47:53,689 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 18:47:53,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:47:53,689 INFO L85 PathProgramCache]: Analyzing trace with hash 40291472, now seen corresponding path program 1 times [2025-02-06 18:47:53,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:47:53,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080348095] [2025-02-06 18:47:53,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:47:53,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:47:53,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:47:53,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:47:53,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:47:53,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:47:53,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:47:53,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:47:53,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080348095] [2025-02-06 18:47:53,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080348095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:47:53,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:47:53,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:47:53,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074009969] [2025-02-06 18:47:53,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:47:53,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:47:53,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:47:53,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:47:53,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:47:53,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 64 [2025-02-06 18:47:53,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 20 transitions, 57 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-02-06 18:47:53,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:47:53,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 64 [2025-02-06 18:47:53,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:47:53,828 INFO L124 PetriNetUnfolderBase]: 100/197 cut-off events. [2025-02-06 18:47:53,828 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:47:53,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 197 events. 100/197 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 964 event pairs, 100 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 413. Up to 191 conditions per place. [2025-02-06 18:47:53,829 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 15 selfloop transitions, 1 changer transitions 0/18 dead transitions. [2025-02-06 18:47:53,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 18 transitions, 85 flow [2025-02-06 18:47:53,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:47:53,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:47:53,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2025-02-06 18:47:53,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.15625 [2025-02-06 18:47:53,830 INFO L175 Difference]: Start difference. First operand has 38 places, 20 transitions, 57 flow. Second operand 3 states and 30 transitions. [2025-02-06 18:47:53,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 18 transitions, 85 flow [2025-02-06 18:47:53,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 18 transitions, 84 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:47:53,831 INFO L231 Difference]: Finished difference. Result has 37 places, 18 transitions, 54 flow [2025-02-06 18:47:53,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=35, 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=54, PETRI_PLACES=37, PETRI_TRANSITIONS=18} [2025-02-06 18:47:53,832 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -30 predicate places. [2025-02-06 18:47:53,832 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 18 transitions, 54 flow [2025-02-06 18:47:53,832 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-02-06 18:47:53,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:47:53,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:47:53,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 18:47:53,832 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 18:47:53,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:47:53,833 INFO L85 PathProgramCache]: Analyzing trace with hash 40291473, now seen corresponding path program 1 times [2025-02-06 18:47:53,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:47:53,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485211375] [2025-02-06 18:47:53,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:47:53,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:47:53,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:47:53,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:47:53,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:47:53,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:47:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:47:53,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:47:53,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485211375] [2025-02-06 18:47:53,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485211375] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:47:53,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:47:53,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:47:53,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022611476] [2025-02-06 18:47:53,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:47:53,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:47:53,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:47:53,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:47:53,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:47:53,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 64 [2025-02-06 18:47:53,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 18 transitions, 54 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-02-06 18:47:53,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:47:53,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 64 [2025-02-06 18:47:53,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:47:53,938 INFO L124 PetriNetUnfolderBase]: 68/139 cut-off events. [2025-02-06 18:47:53,938 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:47:53,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 139 events. 68/139 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 602 event pairs, 68 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 297. Up to 134 conditions per place. [2025-02-06 18:47:53,939 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 13 selfloop transitions, 1 changer transitions 0/16 dead transitions. [2025-02-06 18:47:53,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 16 transitions, 78 flow [2025-02-06 18:47:53,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:47:53,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:47:53,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2025-02-06 18:47:53,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.14583333333333334 [2025-02-06 18:47:53,940 INFO L175 Difference]: Start difference. First operand has 37 places, 18 transitions, 54 flow. Second operand 3 states and 28 transitions. [2025-02-06 18:47:53,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 16 transitions, 78 flow [2025-02-06 18:47:53,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 16 transitions, 77 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:47:53,940 INFO L231 Difference]: Finished difference. Result has 36 places, 16 transitions, 51 flow [2025-02-06 18:47:53,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=34, 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=51, PETRI_PLACES=36, PETRI_TRANSITIONS=16} [2025-02-06 18:47:53,940 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -31 predicate places. [2025-02-06 18:47:53,940 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 16 transitions, 51 flow [2025-02-06 18:47:53,941 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-02-06 18:47:53,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:47:53,941 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:47:53,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 18:47:53,941 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 18:47:53,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:47:53,941 INFO L85 PathProgramCache]: Analyzing trace with hash 40291475, now seen corresponding path program 1 times [2025-02-06 18:47:53,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:47:53,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262260733] [2025-02-06 18:47:53,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:47:53,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:47:53,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:47:53,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:47:53,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:47:53,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:47:53,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:47:53,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:47:53,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262260733] [2025-02-06 18:47:53,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262260733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:47:53,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:47:53,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:47:53,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073903367] [2025-02-06 18:47:53,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:47:53,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:47:53,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:47:53,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:47:53,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:47:53,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 64 [2025-02-06 18:47:53,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 16 transitions, 51 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-02-06 18:47:53,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:47:53,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 64 [2025-02-06 18:47:53,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:47:54,041 INFO L124 PetriNetUnfolderBase]: 42/91 cut-off events. [2025-02-06 18:47:54,041 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:47:54,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 91 events. 42/91 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 329 event pairs, 42 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 201. Up to 87 conditions per place. [2025-02-06 18:47:54,042 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 11 selfloop transitions, 1 changer transitions 0/14 dead transitions. [2025-02-06 18:47:54,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 14 transitions, 71 flow [2025-02-06 18:47:54,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:47:54,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:47:54,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2025-02-06 18:47:54,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.13541666666666666 [2025-02-06 18:47:54,043 INFO L175 Difference]: Start difference. First operand has 36 places, 16 transitions, 51 flow. Second operand 3 states and 26 transitions. [2025-02-06 18:47:54,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 14 transitions, 71 flow [2025-02-06 18:47:54,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 14 transitions, 70 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:47:54,043 INFO L231 Difference]: Finished difference. Result has 35 places, 14 transitions, 48 flow [2025-02-06 18:47:54,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=35, PETRI_TRANSITIONS=14} [2025-02-06 18:47:54,044 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -32 predicate places. [2025-02-06 18:47:54,044 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 14 transitions, 48 flow [2025-02-06 18:47:54,044 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-02-06 18:47:54,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:47:54,044 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:47:54,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 18:47:54,044 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 18:47:54,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:47:54,044 INFO L85 PathProgramCache]: Analyzing trace with hash 40291476, now seen corresponding path program 1 times [2025-02-06 18:47:54,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:47:54,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143383887] [2025-02-06 18:47:54,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:47:54,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:47:54,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:47:54,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:47:54,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:47:54,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:47:54,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:47:54,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:47:54,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143383887] [2025-02-06 18:47:54,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143383887] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:47:54,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:47:54,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:47:54,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783943801] [2025-02-06 18:47:54,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:47:54,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:47:54,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:47:54,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:47:54,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:47:54,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 64 [2025-02-06 18:47:54,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 14 transitions, 48 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-02-06 18:47:54,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:47:54,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 64 [2025-02-06 18:47:54,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:47:54,124 INFO L124 PetriNetUnfolderBase]: 22/53 cut-off events. [2025-02-06 18:47:54,125 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:47:54,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 53 events. 22/53 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 138 event pairs, 22 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 125. Up to 50 conditions per place. [2025-02-06 18:47:54,125 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 0 selfloop transitions, 0 changer transitions 12/12 dead transitions. [2025-02-06 18:47:54,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 12 transitions, 64 flow [2025-02-06 18:47:54,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:47:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:47:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2025-02-06 18:47:54,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.125 [2025-02-06 18:47:54,126 INFO L175 Difference]: Start difference. First operand has 35 places, 14 transitions, 48 flow. Second operand 3 states and 24 transitions. [2025-02-06 18:47:54,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 12 transitions, 64 flow [2025-02-06 18:47:54,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 12 transitions, 63 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:47:54,126 INFO L231 Difference]: Finished difference. Result has 34 places, 0 transitions, 0 flow [2025-02-06 18:47:54,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=43, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=34, PETRI_TRANSITIONS=0} [2025-02-06 18:47:54,126 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -33 predicate places. [2025-02-06 18:47:54,127 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 0 transitions, 0 flow [2025-02-06 18:47:54,127 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-02-06 18:47:54,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 98 remaining) [2025-02-06 18:47:54,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 98 remaining) [2025-02-06 18:47:54,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 98 remaining) [2025-02-06 18:47:54,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 98 remaining) [2025-02-06 18:47:54,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 98 remaining) [2025-02-06 18:47:54,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 98 remaining) [2025-02-06 18:47:54,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 98 remaining) [2025-02-06 18:47:54,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 98 remaining) [2025-02-06 18:47:54,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 98 remaining) [2025-02-06 18:47:54,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 98 remaining) [2025-02-06 18:47:54,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 98 remaining) [2025-02-06 18:47:54,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 98 remaining) [2025-02-06 18:47:54,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 98 remaining) [2025-02-06 18:47:54,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 98 remaining) [2025-02-06 18:47:54,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 98 remaining) [2025-02-06 18:47:54,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 98 remaining) [2025-02-06 18:47:54,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 98 remaining) [2025-02-06 18:47:54,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 98 remaining) [2025-02-06 18:47:54,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 98 remaining) [2025-02-06 18:47:54,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 98 remaining) [2025-02-06 18:47:54,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 98 remaining) [2025-02-06 18:47:54,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 98 remaining) [2025-02-06 18:47:54,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 98 remaining) [2025-02-06 18:47:54,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 98 remaining) [2025-02-06 18:47:54,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 98 remaining) [2025-02-06 18:47:54,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 98 remaining) [2025-02-06 18:47:54,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 98 remaining) [2025-02-06 18:47:54,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 98 remaining) [2025-02-06 18:47:54,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 98 remaining) [2025-02-06 18:47:54,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 98 remaining) [2025-02-06 18:47:54,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 98 remaining) [2025-02-06 18:47:54,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 98 remaining) [2025-02-06 18:47:54,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 98 remaining) [2025-02-06 18:47:54,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 98 remaining) [2025-02-06 18:47:54,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 98 remaining) [2025-02-06 18:47:54,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 98 remaining) [2025-02-06 18:47:54,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 98 remaining) [2025-02-06 18:47:54,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 98 remaining) [2025-02-06 18:47:54,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 98 remaining) [2025-02-06 18:47:54,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 98 remaining) [2025-02-06 18:47:54,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 98 remaining) [2025-02-06 18:47:54,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 98 remaining) [2025-02-06 18:47:54,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 98 remaining) [2025-02-06 18:47:54,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 98 remaining) [2025-02-06 18:47:54,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 98 remaining) [2025-02-06 18:47:54,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 98 remaining) [2025-02-06 18:47:54,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 98 remaining) [2025-02-06 18:47:54,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 98 remaining) [2025-02-06 18:47:54,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 98 remaining) [2025-02-06 18:47:54,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 98 remaining) [2025-02-06 18:47:54,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 98 remaining) [2025-02-06 18:47:54,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 98 remaining) [2025-02-06 18:47:54,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 98 remaining) [2025-02-06 18:47:54,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 98 remaining) [2025-02-06 18:47:54,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 98 remaining) [2025-02-06 18:47:54,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 98 remaining) [2025-02-06 18:47:54,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 98 remaining) [2025-02-06 18:47:54,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 98 remaining) [2025-02-06 18:47:54,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 98 remaining) [2025-02-06 18:47:54,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 98 remaining) [2025-02-06 18:47:54,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 18:47:54,134 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:47:54,137 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 18:47:54,137 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 18:47:54,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 06:47:54 BasicIcfg [2025-02-06 18:47:54,140 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 18:47:54,141 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 18:47:54,141 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 18:47:54,141 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 18:47:54,141 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:47:46" (3/4) ... [2025-02-06 18:47:54,142 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 18:47:54,144 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 18:47:54,144 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 18:47:54,146 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 65 nodes and edges [2025-02-06 18:47:54,147 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2025-02-06 18:47:54,147 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-02-06 18:47:54,147 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 18:47:54,193 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 18:47:54,193 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 18:47:54,193 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 18:47:54,194 INFO L158 Benchmark]: Toolchain (without parser) took 9387.20ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 110.0MB in the beginning and 627.2MB in the end (delta: -517.3MB). Peak memory consumption was 738.5MB. Max. memory is 16.1GB. [2025-02-06 18:47:54,194 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 18:47:54,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.30ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 98.3MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 18:47:54,194 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.11ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 95.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 18:47:54,195 INFO L158 Benchmark]: Boogie Preprocessor took 34.53ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 93.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 18:47:54,195 INFO L158 Benchmark]: IcfgBuilder took 1489.92ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 70.7MB in the end (delta: 22.7MB). Peak memory consumption was 72.7MB. Max. memory is 16.1GB. [2025-02-06 18:47:54,195 INFO L158 Benchmark]: TraceAbstraction took 7571.01ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 69.7MB in the beginning and 635.6MB in the end (delta: -565.9MB). Peak memory consumption was 691.0MB. Max. memory is 16.1GB. [2025-02-06 18:47:54,195 INFO L158 Benchmark]: Witness Printer took 52.68ms. Allocated memory is still 1.4GB. Free memory was 635.6MB in the beginning and 627.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 18:47:54,196 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.18ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.30ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 98.3MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.11ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 95.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.53ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 93.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1489.92ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 70.7MB in the end (delta: 22.7MB). Peak memory consumption was 72.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7571.01ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 69.7MB in the beginning and 635.6MB in the end (delta: -565.9MB). Peak memory consumption was 691.0MB. Max. memory is 16.1GB. * Witness Printer took 52.68ms. Allocated memory is still 1.4GB. Free memory was 635.6MB in the beginning and 627.2MB 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, 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: 7.0s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 368 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 368 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 442 IncrementalHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 0 mSDtfsCounter, 442 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=129occurred 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.7s 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-02-06 18:47:54,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE