./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/test-easy6.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/test-easy6.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce46a456eb9ebd463906f73dade5d1c1c222b26a063863b37340a2842c9ee284 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:31:12,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:31:12,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:31:12,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:31:12,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:31:12,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:31:12,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:31:12,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:31:12,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:31:12,649 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:31:12,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:31:12,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:31:12,650 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:31:12,650 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:31:12,650 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:31:12,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:31:12,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:31:12,650 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:31:12,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:31:12,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:31:12,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:31:12,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:31:12,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:31:12,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:31:12,650 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:31:12,650 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:31:12,651 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:31:12,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:31:12,651 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:31:12,651 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:31:12,651 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:31:12,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:31:12,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:31:12,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:31:12,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:31:12,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:31:12,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:31:12,651 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:31:12,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:31:12,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:31:12,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:31:12,651 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:31:12,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:31:12,651 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:31:12,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:31:12,652 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce46a456eb9ebd463906f73dade5d1c1c222b26a063863b37340a2842c9ee284 [2025-03-04 15:31:12,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:31:12,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:31:12,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:31:12,888 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:31:12,888 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:31:12,889 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-easy6.wvr.c [2025-03-04 15:31:13,986 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e304aef2f/f362e44457ef45da8b372b4e50581d90/FLAG2a4662d4f [2025-03-04 15:31:14,172 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:31:14,172 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-easy6.wvr.c [2025-03-04 15:31:14,178 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e304aef2f/f362e44457ef45da8b372b4e50581d90/FLAG2a4662d4f [2025-03-04 15:31:14,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e304aef2f/f362e44457ef45da8b372b4e50581d90 [2025-03-04 15:31:14,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:31:14,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:31:14,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:31:14,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:31:14,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:31:14,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:31:14" (1/1) ... [2025-03-04 15:31:14,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10c06ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:14, skipping insertion in model container [2025-03-04 15:31:14,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:31:14" (1/1) ... [2025-03-04 15:31:14,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:31:14,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:31:14,686 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:31:14,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:31:14,710 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:31:14,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:14 WrapperNode [2025-03-04 15:31:14,711 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:31:14,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:31:14,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:31:14,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:31:14,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:14" (1/1) ... [2025-03-04 15:31:14,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:14" (1/1) ... [2025-03-04 15:31:14,732 INFO L138 Inliner]: procedures = 18, calls = 14, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2025-03-04 15:31:14,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:31:14,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:31:14,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:31:14,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:31:14,738 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:14" (1/1) ... [2025-03-04 15:31:14,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:14" (1/1) ... [2025-03-04 15:31:14,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:14" (1/1) ... [2025-03-04 15:31:14,746 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 15:31:14,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:14" (1/1) ... [2025-03-04 15:31:14,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:14" (1/1) ... [2025-03-04 15:31:14,749 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:14" (1/1) ... [2025-03-04 15:31:14,750 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:14" (1/1) ... [2025-03-04 15:31:14,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:14" (1/1) ... [2025-03-04 15:31:14,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:14" (1/1) ... [2025-03-04 15:31:14,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:31:14,753 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:31:14,753 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:31:14,753 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:31:14,753 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:14" (1/1) ... [2025-03-04 15:31:14,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:31:14,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:14,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:31:14,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:31:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:31:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:31:14,795 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:31:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:31:14,795 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:31:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:31:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:31:14,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:31:14,796 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:31:14,857 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:31:14,859 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:31:14,970 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:31:14,971 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:31:15,057 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:31:15,057 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:31:15,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:31:15 BoogieIcfgContainer [2025-03-04 15:31:15,058 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:31:15,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:31:15,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:31:15,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:31:15,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:31:14" (1/3) ... [2025-03-04 15:31:15,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354b4035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:31:15, skipping insertion in model container [2025-03-04 15:31:15,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:14" (2/3) ... [2025-03-04 15:31:15,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354b4035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:31:15, skipping insertion in model container [2025-03-04 15:31:15,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:31:15" (3/3) ... [2025-03-04 15:31:15,066 INFO L128 eAbstractionObserver]: Analyzing ICFG test-easy6.wvr.c [2025-03-04 15:31:15,078 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:31:15,079 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-easy6.wvr.c that has 3 procedures, 47 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-04 15:31:15,079 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:31:15,123 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:31:15,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 46 transitions, 106 flow [2025-03-04 15:31:15,173 INFO L124 PetriNetUnfolderBase]: 0/44 cut-off events. [2025-03-04 15:31:15,175 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:31:15,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 44 events. 0/44 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-04 15:31:15,177 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 46 transitions, 106 flow [2025-03-04 15:31:15,179 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 42 transitions, 93 flow [2025-03-04 15:31:15,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:31:15,193 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;@55537c54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:31:15,194 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 15:31:15,202 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:31:15,202 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-03-04 15:31:15,202 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:31:15,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:15,203 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:31:15,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:15,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:15,208 INFO L85 PathProgramCache]: Analyzing trace with hash -368841984, now seen corresponding path program 1 times [2025-03-04 15:31:15,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:15,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675020118] [2025-03-04 15:31:15,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:15,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:15,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:31:15,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:31:15,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:15,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:15,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:15,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:15,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675020118] [2025-03-04 15:31:15,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675020118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:15,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:15,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:31:15,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709579530] [2025-03-04 15:31:15,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:15,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:31:15,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:15,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:31:15,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:31:15,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2025-03-04 15:31:15,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:15,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:15,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2025-03-04 15:31:15,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:15,652 INFO L124 PetriNetUnfolderBase]: 470/1075 cut-off events. [2025-03-04 15:31:15,653 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-04 15:31:15,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1966 conditions, 1075 events. 470/1075 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6164 event pairs, 143 based on Foata normal form. 42/1006 useless extension candidates. Maximal degree in co-relation 1871. Up to 269 conditions per place. [2025-03-04 15:31:15,664 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 54 selfloop transitions, 5 changer transitions 4/79 dead transitions. [2025-03-04 15:31:15,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 302 flow [2025-03-04 15:31:15,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:31:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:31:15,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2025-03-04 15:31:15,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6826086956521739 [2025-03-04 15:31:15,675 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 93 flow. Second operand 5 states and 157 transitions. [2025-03-04 15:31:15,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 302 flow [2025-03-04 15:31:15,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 79 transitions, 291 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:31:15,681 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 118 flow [2025-03-04 15:31:15,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2025-03-04 15:31:15,687 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2025-03-04 15:31:15,688 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 118 flow [2025-03-04 15:31:15,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:15,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:15,688 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:15,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:31:15,689 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:15,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:15,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1972998504, now seen corresponding path program 1 times [2025-03-04 15:31:15,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:15,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627008704] [2025-03-04 15:31:15,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:15,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:15,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:31:15,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:31:15,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:15,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:15,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:15,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627008704] [2025-03-04 15:31:15,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627008704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:15,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:15,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:31:15,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374135326] [2025-03-04 15:31:15,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:15,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:31:15,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:15,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:31:15,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:31:15,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2025-03-04 15:31:15,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:15,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:15,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2025-03-04 15:31:15,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:15,958 INFO L124 PetriNetUnfolderBase]: 617/1420 cut-off events. [2025-03-04 15:31:15,958 INFO L125 PetriNetUnfolderBase]: For 220/220 co-relation queries the response was YES. [2025-03-04 15:31:15,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 1420 events. 617/1420 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8985 event pairs, 187 based on Foata normal form. 42/1331 useless extension candidates. Maximal degree in co-relation 2542. Up to 415 conditions per place. [2025-03-04 15:31:15,964 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 58 selfloop transitions, 5 changer transitions 3/82 dead transitions. [2025-03-04 15:31:15,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 82 transitions, 355 flow [2025-03-04 15:31:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:31:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:31:15,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2025-03-04 15:31:15,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6826086956521739 [2025-03-04 15:31:15,967 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 118 flow. Second operand 5 states and 157 transitions. [2025-03-04 15:31:15,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 82 transitions, 355 flow [2025-03-04 15:31:15,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 82 transitions, 346 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:31:15,971 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 145 flow [2025-03-04 15:31:15,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2025-03-04 15:31:15,971 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2025-03-04 15:31:15,971 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 145 flow [2025-03-04 15:31:15,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:15,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:15,972 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:15,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:31:15,972 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:15,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:15,972 INFO L85 PathProgramCache]: Analyzing trace with hash 519958916, now seen corresponding path program 1 times [2025-03-04 15:31:15,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:15,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232268747] [2025-03-04 15:31:15,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:15,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:15,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:31:16,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:31:16,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:16,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:16,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:16,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:16,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232268747] [2025-03-04 15:31:16,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232268747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:16,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:16,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:31:16,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404734014] [2025-03-04 15:31:16,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:16,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:31:16,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:16,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:31:16,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:31:16,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2025-03-04 15:31:16,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:16,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:16,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2025-03-04 15:31:16,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:16,216 INFO L124 PetriNetUnfolderBase]: 691/1553 cut-off events. [2025-03-04 15:31:16,216 INFO L125 PetriNetUnfolderBase]: For 421/429 co-relation queries the response was YES. [2025-03-04 15:31:16,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3334 conditions, 1553 events. 691/1553 cut-off events. For 421/429 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 9516 event pairs, 261 based on Foata normal form. 102/1574 useless extension candidates. Maximal degree in co-relation 3088. Up to 620 conditions per place. [2025-03-04 15:31:16,222 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 47 selfloop transitions, 4 changer transitions 7/74 dead transitions. [2025-03-04 15:31:16,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 348 flow [2025-03-04 15:31:16,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:31:16,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:31:16,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2025-03-04 15:31:16,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6847826086956522 [2025-03-04 15:31:16,224 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 145 flow. Second operand 4 states and 126 transitions. [2025-03-04 15:31:16,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 348 flow [2025-03-04 15:31:16,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 74 transitions, 343 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:31:16,226 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 168 flow [2025-03-04 15:31:16,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2025-03-04 15:31:16,227 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2025-03-04 15:31:16,227 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 168 flow [2025-03-04 15:31:16,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:16,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:16,227 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:16,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:31:16,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:16,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:16,227 INFO L85 PathProgramCache]: Analyzing trace with hash -107650580, now seen corresponding path program 1 times [2025-03-04 15:31:16,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:16,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458953063] [2025-03-04 15:31:16,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:16,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:16,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:31:16,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:31:16,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:16,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:16,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:16,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458953063] [2025-03-04 15:31:16,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458953063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:16,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:16,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:16,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362069844] [2025-03-04 15:31:16,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:16,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:16,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:16,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:16,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:16,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2025-03-04 15:31:16,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 168 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:16,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:16,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2025-03-04 15:31:16,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:16,578 INFO L124 PetriNetUnfolderBase]: 548/1279 cut-off events. [2025-03-04 15:31:16,578 INFO L125 PetriNetUnfolderBase]: For 569/577 co-relation queries the response was YES. [2025-03-04 15:31:16,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2955 conditions, 1279 events. 548/1279 cut-off events. For 569/577 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8074 event pairs, 54 based on Foata normal form. 15/1221 useless extension candidates. Maximal degree in co-relation 2698. Up to 224 conditions per place. [2025-03-04 15:31:16,583 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 91 selfloop transitions, 17 changer transitions 0/122 dead transitions. [2025-03-04 15:31:16,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 122 transitions, 631 flow [2025-03-04 15:31:16,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:31:16,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:31:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 281 transitions. [2025-03-04 15:31:16,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5553359683794467 [2025-03-04 15:31:16,585 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 168 flow. Second operand 11 states and 281 transitions. [2025-03-04 15:31:16,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 122 transitions, 631 flow [2025-03-04 15:31:16,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 122 transitions, 624 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:31:16,588 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 259 flow [2025-03-04 15:31:16,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=259, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2025-03-04 15:31:16,588 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 22 predicate places. [2025-03-04 15:31:16,589 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 259 flow [2025-03-04 15:31:16,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:16,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:16,589 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:16,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:31:16,589 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:16,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:16,590 INFO L85 PathProgramCache]: Analyzing trace with hash 424850476, now seen corresponding path program 1 times [2025-03-04 15:31:16,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:16,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466896369] [2025-03-04 15:31:16,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:16,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:16,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:31:16,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:31:16,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:16,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:16,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:16,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:16,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466896369] [2025-03-04 15:31:16,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466896369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:16,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:16,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:16,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70280212] [2025-03-04 15:31:16,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:16,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:16,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:16,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:16,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:16,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2025-03-04 15:31:16,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 259 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:16,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:16,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2025-03-04 15:31:16,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:16,902 INFO L124 PetriNetUnfolderBase]: 529/1262 cut-off events. [2025-03-04 15:31:16,902 INFO L125 PetriNetUnfolderBase]: For 1009/1021 co-relation queries the response was YES. [2025-03-04 15:31:16,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3103 conditions, 1262 events. 529/1262 cut-off events. For 1009/1021 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 8005 event pairs, 58 based on Foata normal form. 18/1209 useless extension candidates. Maximal degree in co-relation 2829. Up to 208 conditions per place. [2025-03-04 15:31:16,907 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 87 selfloop transitions, 18 changer transitions 0/119 dead transitions. [2025-03-04 15:31:16,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 119 transitions, 657 flow [2025-03-04 15:31:16,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:31:16,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:31:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 278 transitions. [2025-03-04 15:31:16,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.549407114624506 [2025-03-04 15:31:16,909 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 259 flow. Second operand 11 states and 278 transitions. [2025-03-04 15:31:16,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 119 transitions, 657 flow [2025-03-04 15:31:16,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 119 transitions, 641 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:31:16,913 INFO L231 Difference]: Finished difference. Result has 77 places, 57 transitions, 288 flow [2025-03-04 15:31:16,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=288, PETRI_PLACES=77, PETRI_TRANSITIONS=57} [2025-03-04 15:31:16,914 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 28 predicate places. [2025-03-04 15:31:16,914 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 57 transitions, 288 flow [2025-03-04 15:31:16,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:16,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:16,914 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:16,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:31:16,914 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:16,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:16,915 INFO L85 PathProgramCache]: Analyzing trace with hash -830177108, now seen corresponding path program 1 times [2025-03-04 15:31:16,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:16,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627828314] [2025-03-04 15:31:16,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:16,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:16,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:31:16,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:31:16,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:16,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:16,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:16,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627828314] [2025-03-04 15:31:16,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627828314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:16,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:16,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:31:16,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919059814] [2025-03-04 15:31:16,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:16,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:31:16,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:16,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:31:16,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:31:16,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2025-03-04 15:31:16,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 57 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:16,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:16,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2025-03-04 15:31:16,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:17,090 INFO L124 PetriNetUnfolderBase]: 541/1302 cut-off events. [2025-03-04 15:31:17,091 INFO L125 PetriNetUnfolderBase]: For 1283/1291 co-relation queries the response was YES. [2025-03-04 15:31:17,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3294 conditions, 1302 events. 541/1302 cut-off events. For 1283/1291 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 8158 event pairs, 220 based on Foata normal form. 106/1393 useless extension candidates. Maximal degree in co-relation 3018. Up to 485 conditions per place. [2025-03-04 15:31:17,097 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 65 selfloop transitions, 4 changer transitions 0/83 dead transitions. [2025-03-04 15:31:17,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 83 transitions, 560 flow [2025-03-04 15:31:17,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:31:17,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:31:17,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2025-03-04 15:31:17,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.657608695652174 [2025-03-04 15:31:17,099 INFO L175 Difference]: Start difference. First operand has 77 places, 57 transitions, 288 flow. Second operand 4 states and 121 transitions. [2025-03-04 15:31:17,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 83 transitions, 560 flow [2025-03-04 15:31:17,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 472 flow, removed 8 selfloop flow, removed 9 redundant places. [2025-03-04 15:31:17,103 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 259 flow [2025-03-04 15:31:17,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=259, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2025-03-04 15:31:17,106 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 24 predicate places. [2025-03-04 15:31:17,106 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 259 flow [2025-03-04 15:31:17,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:17,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:17,107 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:17,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:31:17,107 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:17,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:17,107 INFO L85 PathProgramCache]: Analyzing trace with hash 957799576, now seen corresponding path program 1 times [2025-03-04 15:31:17,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:17,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012047291] [2025-03-04 15:31:17,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:17,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:17,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:31:17,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:31:17,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:17,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:17,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:17,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:17,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012047291] [2025-03-04 15:31:17,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012047291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:17,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:17,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:17,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608213007] [2025-03-04 15:31:17,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:17,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:17,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:17,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:17,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:17,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2025-03-04 15:31:17,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 259 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:17,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:17,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2025-03-04 15:31:17,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:17,348 INFO L124 PetriNetUnfolderBase]: 512/1215 cut-off events. [2025-03-04 15:31:17,348 INFO L125 PetriNetUnfolderBase]: For 1158/1174 co-relation queries the response was YES. [2025-03-04 15:31:17,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3143 conditions, 1215 events. 512/1215 cut-off events. For 1158/1174 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7568 event pairs, 155 based on Foata normal form. 19/1223 useless extension candidates. Maximal degree in co-relation 2874. Up to 399 conditions per place. [2025-03-04 15:31:17,352 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 65 selfloop transitions, 14 changer transitions 0/93 dead transitions. [2025-03-04 15:31:17,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 93 transitions, 541 flow [2025-03-04 15:31:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:31:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:31:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2025-03-04 15:31:17,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5271739130434783 [2025-03-04 15:31:17,354 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 259 flow. Second operand 8 states and 194 transitions. [2025-03-04 15:31:17,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 93 transitions, 541 flow [2025-03-04 15:31:17,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 93 transitions, 522 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:31:17,356 INFO L231 Difference]: Finished difference. Result has 76 places, 57 transitions, 268 flow [2025-03-04 15:31:17,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=268, PETRI_PLACES=76, PETRI_TRANSITIONS=57} [2025-03-04 15:31:17,357 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 27 predicate places. [2025-03-04 15:31:17,357 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 57 transitions, 268 flow [2025-03-04 15:31:17,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:17,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:17,357 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:17,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:31:17,357 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:17,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:17,358 INFO L85 PathProgramCache]: Analyzing trace with hash 285463110, now seen corresponding path program 1 times [2025-03-04 15:31:17,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:17,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839508601] [2025-03-04 15:31:17,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:17,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:17,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:31:17,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:31:17,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:17,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:17,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:17,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:17,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839508601] [2025-03-04 15:31:17,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839508601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:17,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:17,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:17,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327985909] [2025-03-04 15:31:17,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:17,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:17,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:17,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:17,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:17,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2025-03-04 15:31:17,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 57 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:17,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:17,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2025-03-04 15:31:17,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:17,591 INFO L124 PetriNetUnfolderBase]: 493/1180 cut-off events. [2025-03-04 15:31:17,592 INFO L125 PetriNetUnfolderBase]: For 1027/1039 co-relation queries the response was YES. [2025-03-04 15:31:17,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3081 conditions, 1180 events. 493/1180 cut-off events. For 1027/1039 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7344 event pairs, 182 based on Foata normal form. 18/1186 useless extension candidates. Maximal degree in co-relation 2811. Up to 401 conditions per place. [2025-03-04 15:31:17,597 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 65 selfloop transitions, 14 changer transitions 0/93 dead transitions. [2025-03-04 15:31:17,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 93 transitions, 544 flow [2025-03-04 15:31:17,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:31:17,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:31:17,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2025-03-04 15:31:17,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5271739130434783 [2025-03-04 15:31:17,598 INFO L175 Difference]: Start difference. First operand has 76 places, 57 transitions, 268 flow. Second operand 8 states and 194 transitions. [2025-03-04 15:31:17,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 93 transitions, 544 flow [2025-03-04 15:31:17,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 93 transitions, 510 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 15:31:17,603 INFO L231 Difference]: Finished difference. Result has 75 places, 56 transitions, 256 flow [2025-03-04 15:31:17,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=256, PETRI_PLACES=75, PETRI_TRANSITIONS=56} [2025-03-04 15:31:17,604 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places. [2025-03-04 15:31:17,605 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 56 transitions, 256 flow [2025-03-04 15:31:17,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:17,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:17,605 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:17,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:31:17,605 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:17,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:17,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1624599962, now seen corresponding path program 1 times [2025-03-04 15:31:17,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:17,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68459717] [2025-03-04 15:31:17,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:17,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:17,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:31:17,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:31:17,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:17,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:17,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:17,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:17,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68459717] [2025-03-04 15:31:17,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68459717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:17,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:17,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:17,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145775966] [2025-03-04 15:31:17,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:17,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:17,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:17,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:17,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:17,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2025-03-04 15:31:17,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 56 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:17,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:17,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2025-03-04 15:31:17,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:17,857 INFO L124 PetriNetUnfolderBase]: 559/1285 cut-off events. [2025-03-04 15:31:17,857 INFO L125 PetriNetUnfolderBase]: For 1055/1067 co-relation queries the response was YES. [2025-03-04 15:31:17,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3359 conditions, 1285 events. 559/1285 cut-off events. For 1055/1067 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7733 event pairs, 208 based on Foata normal form. 21/1291 useless extension candidates. Maximal degree in co-relation 3092. Up to 409 conditions per place. [2025-03-04 15:31:17,863 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 71 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2025-03-04 15:31:17,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 86 transitions, 534 flow [2025-03-04 15:31:17,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:31:17,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:31:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2025-03-04 15:31:17,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.532608695652174 [2025-03-04 15:31:17,864 INFO L175 Difference]: Start difference. First operand has 75 places, 56 transitions, 256 flow. Second operand 6 states and 147 transitions. [2025-03-04 15:31:17,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 86 transitions, 534 flow [2025-03-04 15:31:17,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 86 transitions, 491 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 15:31:17,868 INFO L231 Difference]: Finished difference. Result has 73 places, 55 transitions, 234 flow [2025-03-04 15:31:17,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=73, PETRI_TRANSITIONS=55} [2025-03-04 15:31:17,869 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 24 predicate places. [2025-03-04 15:31:17,869 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 55 transitions, 234 flow [2025-03-04 15:31:17,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:17,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:17,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:17,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:31:17,869 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:17,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:17,869 INFO L85 PathProgramCache]: Analyzing trace with hash 427813712, now seen corresponding path program 1 times [2025-03-04 15:31:17,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:17,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43598942] [2025-03-04 15:31:17,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:17,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:17,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:31:17,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:31:17,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:17,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:17,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:17,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43598942] [2025-03-04 15:31:17,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43598942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:17,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:17,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:17,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138463934] [2025-03-04 15:31:17,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:17,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:17,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:17,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:17,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:17,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2025-03-04 15:31:17,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 55 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:17,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:17,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2025-03-04 15:31:17,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:18,096 INFO L124 PetriNetUnfolderBase]: 538/1246 cut-off events. [2025-03-04 15:31:18,096 INFO L125 PetriNetUnfolderBase]: For 1126/1138 co-relation queries the response was YES. [2025-03-04 15:31:18,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3230 conditions, 1246 events. 538/1246 cut-off events. For 1126/1138 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 7477 event pairs, 208 based on Foata normal form. 18/1249 useless extension candidates. Maximal degree in co-relation 2963. Up to 409 conditions per place. [2025-03-04 15:31:18,101 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 70 selfloop transitions, 5 changer transitions 0/85 dead transitions. [2025-03-04 15:31:18,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 85 transitions, 493 flow [2025-03-04 15:31:18,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:31:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:31:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2025-03-04 15:31:18,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5289855072463768 [2025-03-04 15:31:18,103 INFO L175 Difference]: Start difference. First operand has 73 places, 55 transitions, 234 flow. Second operand 6 states and 146 transitions. [2025-03-04 15:31:18,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 85 transitions, 493 flow [2025-03-04 15:31:18,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 85 transitions, 482 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:31:18,105 INFO L231 Difference]: Finished difference. Result has 73 places, 54 transitions, 227 flow [2025-03-04 15:31:18,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=227, PETRI_PLACES=73, PETRI_TRANSITIONS=54} [2025-03-04 15:31:18,107 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 24 predicate places. [2025-03-04 15:31:18,107 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 54 transitions, 227 flow [2025-03-04 15:31:18,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:18,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:18,107 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:18,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:31:18,108 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:18,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:18,108 INFO L85 PathProgramCache]: Analyzing trace with hash 788514524, now seen corresponding path program 1 times [2025-03-04 15:31:18,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:18,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639352855] [2025-03-04 15:31:18,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:18,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:18,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:31:18,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:31:18,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:18,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:18,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:18,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639352855] [2025-03-04 15:31:18,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639352855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:18,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:18,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:18,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004754146] [2025-03-04 15:31:18,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:18,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:18,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:18,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:18,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:18,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2025-03-04 15:31:18,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 54 transitions, 227 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:18,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:18,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2025-03-04 15:31:18,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:18,293 INFO L124 PetriNetUnfolderBase]: 514/1201 cut-off events. [2025-03-04 15:31:18,293 INFO L125 PetriNetUnfolderBase]: For 1117/1129 co-relation queries the response was YES. [2025-03-04 15:31:18,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3037 conditions, 1201 events. 514/1201 cut-off events. For 1117/1129 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 7222 event pairs, 223 based on Foata normal form. 21/1207 useless extension candidates. Maximal degree in co-relation 2774. Up to 409 conditions per place. [2025-03-04 15:31:18,296 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 43 selfloop transitions, 3 changer transitions 22/78 dead transitions. [2025-03-04 15:31:18,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 78 transitions, 448 flow [2025-03-04 15:31:18,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:31:18,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:31:18,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2025-03-04 15:31:18,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914 [2025-03-04 15:31:18,297 INFO L175 Difference]: Start difference. First operand has 73 places, 54 transitions, 227 flow. Second operand 6 states and 141 transitions. [2025-03-04 15:31:18,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 78 transitions, 448 flow [2025-03-04 15:31:18,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 78 transitions, 436 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:31:18,313 INFO L231 Difference]: Finished difference. Result has 72 places, 42 transitions, 160 flow [2025-03-04 15:31:18,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=72, PETRI_TRANSITIONS=42} [2025-03-04 15:31:18,314 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 23 predicate places. [2025-03-04 15:31:18,314 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 42 transitions, 160 flow [2025-03-04 15:31:18,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:18,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:18,314 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:18,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:31:18,314 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:18,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:18,314 INFO L85 PathProgramCache]: Analyzing trace with hash -423179282, now seen corresponding path program 1 times [2025-03-04 15:31:18,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:18,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856289388] [2025-03-04 15:31:18,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:18,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:18,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:31:18,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:31:18,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:18,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:18,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:18,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856289388] [2025-03-04 15:31:18,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856289388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:18,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:18,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:18,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301892972] [2025-03-04 15:31:18,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:18,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:18,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:18,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:18,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:18,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2025-03-04 15:31:18,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 42 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:18,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:18,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2025-03-04 15:31:18,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:18,439 INFO L124 PetriNetUnfolderBase]: 292/682 cut-off events. [2025-03-04 15:31:18,439 INFO L125 PetriNetUnfolderBase]: For 536/544 co-relation queries the response was YES. [2025-03-04 15:31:18,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1601 conditions, 682 events. 292/682 cut-off events. For 536/544 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3399 event pairs, 176 based on Foata normal form. 18/691 useless extension candidates. Maximal degree in co-relation 1399. Up to 331 conditions per place. [2025-03-04 15:31:18,441 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 0 selfloop transitions, 0 changer transitions 50/50 dead transitions. [2025-03-04 15:31:18,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 50 transitions, 266 flow [2025-03-04 15:31:18,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:31:18,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:31:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-03-04 15:31:18,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4945652173913043 [2025-03-04 15:31:18,442 INFO L175 Difference]: Start difference. First operand has 72 places, 42 transitions, 160 flow. Second operand 4 states and 91 transitions. [2025-03-04 15:31:18,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 50 transitions, 266 flow [2025-03-04 15:31:18,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 50 transitions, 252 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-04 15:31:18,443 INFO L231 Difference]: Finished difference. Result has 55 places, 0 transitions, 0 flow [2025-03-04 15:31:18,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=55, PETRI_TRANSITIONS=0} [2025-03-04 15:31:18,444 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2025-03-04 15:31:18,444 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 0 transitions, 0 flow [2025-03-04 15:31:18,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:18,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-03-04 15:31:18,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2025-03-04 15:31:18,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-04 15:31:18,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-04 15:31:18,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-04 15:31:18,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-04 15:31:18,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-04 15:31:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-04 15:31:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2025-03-04 15:31:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2025-03-04 15:31:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-04 15:31:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-04 15:31:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-04 15:31:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-04 15:31:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-04 15:31:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-04 15:31:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-04 15:31:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-04 15:31:18,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:31:18,448 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:18,451 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:31:18,452 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:31:18,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:31:18 BasicIcfg [2025-03-04 15:31:18,457 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:31:18,457 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:31:18,457 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:31:18,457 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:31:18,458 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:31:15" (3/4) ... [2025-03-04 15:31:18,459 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:31:18,461 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 15:31:18,461 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 15:31:18,463 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2025-03-04 15:31:18,464 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-04 15:31:18,464 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-04 15:31:18,464 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 15:31:18,465 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 15:31:18,518 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:31:18,518 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:31:18,518 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:31:18,519 INFO L158 Benchmark]: Toolchain (without parser) took 3966.09ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 111.5MB in the beginning and 100.2MB in the end (delta: 11.3MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2025-03-04 15:31:18,519 INFO L158 Benchmark]: CDTParser took 0.89ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:31:18,519 INFO L158 Benchmark]: CACSL2BoogieTranslator took 158.19ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 99.9MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:31:18,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.81ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 98.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:31:18,520 INFO L158 Benchmark]: Boogie Preprocessor took 18.95ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 97.5MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:31:18,521 INFO L158 Benchmark]: IcfgBuilder took 305.03ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 72.9MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 15:31:18,521 INFO L158 Benchmark]: TraceAbstraction took 3397.08ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 72.4MB in the beginning and 105.1MB in the end (delta: -32.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:31:18,521 INFO L158 Benchmark]: Witness Printer took 60.88ms. Allocated memory is still 176.2MB. Free memory was 105.1MB in the beginning and 100.2MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:31:18,522 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.89ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 158.19ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 99.9MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.81ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 98.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.95ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 97.5MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 305.03ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 72.9MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3397.08ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 72.4MB in the beginning and 105.1MB in the end (delta: -32.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 60.88ms. Allocated memory is still 176.2MB. Free memory was 105.1MB in the beginning and 100.2MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: 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, 87 locations, 18 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: 3.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1272 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1165 mSDsluCounter, 379 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 329 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1352 IncrementalHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 50 mSDtfsCounter, 1352 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288occurred in iteration=5, InterpolantAutomatonStates: 78, 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, 204 NumberOfCodeBlocks, 204 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:31:18,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE