./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-ext/09_fmaxsym-zero.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/09_fmaxsym-zero.i -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 41cf9d90b654ba629ed26494b45977a61fd5035aced9f092d4e43a94133522bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:22:26,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:22:27,062 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:22:27,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:22:27,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:22:27,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:22:27,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:22:27,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:22:27,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:22:27,096 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:22:27,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:22:27,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:22:27,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:22:27,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:22:27,096 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:22:27,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:22:27,096 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:22:27,096 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:22:27,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:22:27,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:22:27,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:22:27,097 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:22:27,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:22:27,097 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:22:27,097 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:22:27,097 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:22:27,097 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:22:27,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:22:27,097 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:22:27,097 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:22:27,097 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:22:27,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:22:27,098 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:22:27,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:22:27,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:22:27,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:22:27,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:22:27,099 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:22:27,099 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:22:27,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:22:27,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:22:27,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:22:27,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:22:27,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:22:27,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:22:27,099 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 -> 41cf9d90b654ba629ed26494b45977a61fd5035aced9f092d4e43a94133522bd [2025-03-09 06:22:27,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:22:27,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:22:27,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:22:27,352 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:22:27,352 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:22:27,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym-zero.i [2025-03-09 06:22:28,607 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d778b2e16/5bdd6cf71f5845c1a9496e18f9a9869a/FLAGb7f3d7948 [2025-03-09 06:22:28,949 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:22:28,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym-zero.i [2025-03-09 06:22:28,966 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d778b2e16/5bdd6cf71f5845c1a9496e18f9a9869a/FLAGb7f3d7948 [2025-03-09 06:22:28,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d778b2e16/5bdd6cf71f5845c1a9496e18f9a9869a [2025-03-09 06:22:28,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:22:28,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:22:28,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:22:28,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:22:28,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:22:28,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:22:28" (1/1) ... [2025-03-09 06:22:28,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f68d2cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:28, skipping insertion in model container [2025-03-09 06:22:28,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:22:28" (1/1) ... [2025-03-09 06:22:29,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:22:29,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:22:29,249 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:22:29,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:22:29,306 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:22:29,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29 WrapperNode [2025-03-09 06:22:29,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:22:29,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:22:29,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:22:29,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:22:29,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,337 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2025-03-09 06:22:29,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:22:29,338 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:22:29,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:22:29,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:22:29,344 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,346 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,356 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-03-09 06:22:29,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,361 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,363 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:22:29,366 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:22:29,366 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:22:29,366 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:22:29,367 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:22:29,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:22:29,399 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 06:22:29,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 06:22:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:22:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:22:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:22:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-09 06:22:29,427 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-09 06:22:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 06:22:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:22:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:22:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:22:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 06:22:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 06:22:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:22:29,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:22:29,428 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 06:22:29,518 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:22:29,520 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:22:29,661 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:22:29,662 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:22:29,793 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:22:29,794 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:22:29,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:22:29 BoogieIcfgContainer [2025-03-09 06:22:29,794 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:22:29,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:22:29,797 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:22:29,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:22:29,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:22:28" (1/3) ... [2025-03-09 06:22:29,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c9ddb4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:22:29, skipping insertion in model container [2025-03-09 06:22:29,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (2/3) ... [2025-03-09 06:22:29,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c9ddb4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:22:29, skipping insertion in model container [2025-03-09 06:22:29,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:22:29" (3/3) ... [2025-03-09 06:22:29,802 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym-zero.i [2025-03-09 06:22:29,821 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:22:29,822 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym-zero.i that has 2 procedures, 21 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-09 06:22:29,823 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:22:29,863 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 06:22:29,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 23 transitions, 50 flow [2025-03-09 06:22:29,914 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2025-03-09 06:22:29,917 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:22:29,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 25 events. 2/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2025-03-09 06:22:29,922 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 23 transitions, 50 flow [2025-03-09 06:22:29,924 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 23 transitions, 50 flow [2025-03-09 06:22:29,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:22:29,947 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;@71e23515, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:22:29,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-09 06:22:29,954 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:22:29,954 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-03-09 06:22:29,954 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:22:29,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:29,956 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:22:29,957 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-09 06:22:29,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:29,962 INFO L85 PathProgramCache]: Analyzing trace with hash 189108715, now seen corresponding path program 1 times [2025-03-09 06:22:29,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:29,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714489728] [2025-03-09 06:22:29,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:29,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:30,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:22:30,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:22:30,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:30,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:30,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:30,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714489728] [2025-03-09 06:22:30,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714489728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:30,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:30,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:30,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763741491] [2025-03-09 06:22:30,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:30,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:30,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:30,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:30,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:30,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 23 [2025-03-09 06:22:30,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 23 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:30,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:30,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 23 [2025-03-09 06:22:30,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:30,296 INFO L124 PetriNetUnfolderBase]: 19/68 cut-off events. [2025-03-09 06:22:30,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:22:30,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 68 events. 19/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 169 event pairs, 2 based on Foata normal form. 3/68 useless extension candidates. Maximal degree in co-relation 108. Up to 38 conditions per place. [2025-03-09 06:22:30,299 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 13 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2025-03-09 06:22:30,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 22 transitions, 78 flow [2025-03-09 06:22:30,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:30,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2025-03-09 06:22:30,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5797101449275363 [2025-03-09 06:22:30,309 INFO L175 Difference]: Start difference. First operand has 24 places, 23 transitions, 50 flow. Second operand 3 states and 40 transitions. [2025-03-09 06:22:30,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 22 transitions, 78 flow [2025-03-09 06:22:30,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 22 transitions, 78 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:22:30,314 INFO L231 Difference]: Finished difference. Result has 24 places, 20 transitions, 48 flow [2025-03-09 06:22:30,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=24, PETRI_TRANSITIONS=20} [2025-03-09 06:22:30,320 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 0 predicate places. [2025-03-09 06:22:30,320 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 48 flow [2025-03-09 06:22:30,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:30,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:30,320 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 06:22:30,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:22:30,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-09 06:22:30,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:30,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1567401555, now seen corresponding path program 1 times [2025-03-09 06:22:30,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:30,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338931779] [2025-03-09 06:22:30,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:30,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:30,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:22:30,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:22:30,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:30,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:22:30,348 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:22:30,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:22:30,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:22:30,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:30,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:22:30,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:22:30,373 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:22:30,375 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-09 06:22:30,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 9 remaining) [2025-03-09 06:22:30,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 9 remaining) [2025-03-09 06:22:30,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 9 remaining) [2025-03-09 06:22:30,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 9 remaining) [2025-03-09 06:22:30,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 9 remaining) [2025-03-09 06:22:30,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 9 remaining) [2025-03-09 06:22:30,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 9 remaining) [2025-03-09 06:22:30,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 9 remaining) [2025-03-09 06:22:30,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 06:22:30,378 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-09 06:22:30,380 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:22:30,380 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 06:22:30,406 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 06:22:30,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 41 transitions, 92 flow [2025-03-09 06:22:30,421 INFO L124 PetriNetUnfolderBase]: 4/46 cut-off events. [2025-03-09 06:22:30,421 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 06:22:30,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 46 events. 4/46 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 103 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 37. Up to 3 conditions per place. [2025-03-09 06:22:30,422 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 41 transitions, 92 flow [2025-03-09 06:22:30,423 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 41 transitions, 92 flow [2025-03-09 06:22:30,424 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:22:30,425 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;@71e23515, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:22:30,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-09 06:22:30,428 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:22:30,428 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-03-09 06:22:30,428 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:22:30,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:30,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:22:30,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:22:30,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:30,429 INFO L85 PathProgramCache]: Analyzing trace with hash 228252101, now seen corresponding path program 1 times [2025-03-09 06:22:30,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:30,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953710399] [2025-03-09 06:22:30,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:30,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:30,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:22:30,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:22:30,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:30,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:30,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:30,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:30,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953710399] [2025-03-09 06:22:30,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953710399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:30,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:30,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:30,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780869693] [2025-03-09 06:22:30,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:30,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:30,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:30,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:30,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:30,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-09 06:22:30,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:30,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:30,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-09 06:22:30,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:30,800 INFO L124 PetriNetUnfolderBase]: 388/818 cut-off events. [2025-03-09 06:22:30,800 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-09 06:22:30,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 818 events. 388/818 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4454 event pairs, 144 based on Foata normal form. 54/812 useless extension candidates. Maximal degree in co-relation 1276. Up to 517 conditions per place. [2025-03-09 06:22:30,811 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 31 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2025-03-09 06:22:30,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 177 flow [2025-03-09 06:22:30,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-03-09 06:22:30,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6829268292682927 [2025-03-09 06:22:30,813 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 92 flow. Second operand 3 states and 84 transitions. [2025-03-09 06:22:30,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 177 flow [2025-03-09 06:22:30,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 177 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:22:30,815 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 88 flow [2025-03-09 06:22:30,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-03-09 06:22:30,817 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2025-03-09 06:22:30,817 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 88 flow [2025-03-09 06:22:30,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:30,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:30,817 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:22:30,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:22:30,818 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:22:30,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:30,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1514119241, now seen corresponding path program 1 times [2025-03-09 06:22:30,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:30,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89210453] [2025-03-09 06:22:30,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:30,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:30,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:22:30,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:22:30,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:30,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:30,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:30,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:30,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89210453] [2025-03-09 06:22:30,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89210453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:30,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:30,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:30,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670623759] [2025-03-09 06:22:30,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:30,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:30,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:30,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:30,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:30,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-09 06:22:30,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:30,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:30,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-09 06:22:30,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:31,012 INFO L124 PetriNetUnfolderBase]: 345/739 cut-off events. [2025-03-09 06:22:31,013 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-09 06:22:31,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 739 events. 345/739 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3877 event pairs, 126 based on Foata normal form. 27/712 useless extension candidates. Maximal degree in co-relation 1187. Up to 447 conditions per place. [2025-03-09 06:22:31,017 INFO L140 encePairwiseOnDemand]: 38/41 looper letters, 30 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2025-03-09 06:22:31,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 177 flow [2025-03-09 06:22:31,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:31,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2025-03-09 06:22:31,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-03-09 06:22:31,018 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 88 flow. Second operand 3 states and 78 transitions. [2025-03-09 06:22:31,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 177 flow [2025-03-09 06:22:31,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 173 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:31,020 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 86 flow [2025-03-09 06:22:31,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2025-03-09 06:22:31,021 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2025-03-09 06:22:31,021 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 86 flow [2025-03-09 06:22:31,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:31,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:31,021 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:31,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:22:31,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:22:31,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:31,022 INFO L85 PathProgramCache]: Analyzing trace with hash 907707255, now seen corresponding path program 1 times [2025-03-09 06:22:31,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:31,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360424457] [2025-03-09 06:22:31,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:31,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:31,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:22:31,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:22:31,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:31,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:31,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:31,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:31,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360424457] [2025-03-09 06:22:31,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360424457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:31,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:31,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:31,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205959970] [2025-03-09 06:22:31,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:31,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:31,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:31,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:31,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:31,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-09 06:22:31,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:31,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:31,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-09 06:22:31,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:31,233 INFO L124 PetriNetUnfolderBase]: 385/805 cut-off events. [2025-03-09 06:22:31,233 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2025-03-09 06:22:31,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1523 conditions, 805 events. 385/805 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4407 event pairs, 72 based on Foata normal form. 24/791 useless extension candidates. Maximal degree in co-relation 1094. Up to 472 conditions per place. [2025-03-09 06:22:31,237 INFO L140 encePairwiseOnDemand]: 38/41 looper letters, 30 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2025-03-09 06:22:31,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 172 flow [2025-03-09 06:22:31,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:31,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:31,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2025-03-09 06:22:31,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-03-09 06:22:31,238 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 86 flow. Second operand 3 states and 78 transitions. [2025-03-09 06:22:31,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 172 flow [2025-03-09 06:22:31,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:31,239 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 84 flow [2025-03-09 06:22:31,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2025-03-09 06:22:31,239 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2025-03-09 06:22:31,239 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 84 flow [2025-03-09 06:22:31,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:31,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:31,240 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-09 06:22:31,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:22:31,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:22:31,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:31,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1925847423, now seen corresponding path program 1 times [2025-03-09 06:22:31,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:31,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509384048] [2025-03-09 06:22:31,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:31,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:31,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:22:31,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:22:31,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:31,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:22:31,254 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:22:31,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:22:31,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:22:31,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:31,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:22:31,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:22:31,263 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:22:31,264 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-09 06:22:31,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-03-09 06:22:31,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-03-09 06:22:31,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-03-09 06:22:31,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-03-09 06:22:31,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-03-09 06:22:31,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-03-09 06:22:31,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-03-09 06:22:31,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-03-09 06:22:31,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-03-09 06:22:31,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-03-09 06:22:31,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-03-09 06:22:31,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-03-09 06:22:31,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:22:31,269 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-09 06:22:31,270 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:22:31,270 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-09 06:22:31,291 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 06:22:31,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 59 transitions, 136 flow [2025-03-09 06:22:31,296 INFO L124 PetriNetUnfolderBase]: 6/67 cut-off events. [2025-03-09 06:22:31,297 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 06:22:31,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 67 events. 6/67 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 183 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 54. Up to 4 conditions per place. [2025-03-09 06:22:31,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 59 transitions, 136 flow [2025-03-09 06:22:31,297 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 59 transitions, 136 flow [2025-03-09 06:22:31,298 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:22:31,298 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;@71e23515, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:22:31,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-09 06:22:31,300 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:22:31,300 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-09 06:22:31,300 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 06:22:31,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:31,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:22:31,300 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:22:31,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:31,300 INFO L85 PathProgramCache]: Analyzing trace with hash 284572433, now seen corresponding path program 1 times [2025-03-09 06:22:31,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:31,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288968704] [2025-03-09 06:22:31,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:31,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:31,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:22:31,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:22:31,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:31,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:31,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:31,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:31,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288968704] [2025-03-09 06:22:31,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288968704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:31,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:31,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:31,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487363406] [2025-03-09 06:22:31,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:31,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:31,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:31,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:31,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:31,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2025-03-09 06:22:31,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:31,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:31,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2025-03-09 06:22:31,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:32,027 INFO L124 PetriNetUnfolderBase]: 5068/8513 cut-off events. [2025-03-09 06:22:32,028 INFO L125 PetriNetUnfolderBase]: For 475/475 co-relation queries the response was YES. [2025-03-09 06:22:32,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15876 conditions, 8513 events. 5068/8513 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 59658 event pairs, 2492 based on Foata normal form. 678/8654 useless extension candidates. Maximal degree in co-relation 10761. Up to 5693 conditions per place. [2025-03-09 06:22:32,086 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 49 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2025-03-09 06:22:32,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 280 flow [2025-03-09 06:22:32,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:32,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-03-09 06:22:32,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7231638418079096 [2025-03-09 06:22:32,091 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 136 flow. Second operand 3 states and 128 transitions. [2025-03-09 06:22:32,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 280 flow [2025-03-09 06:22:32,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 74 transitions, 276 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-09 06:22:32,095 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 128 flow [2025-03-09 06:22:32,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2025-03-09 06:22:32,096 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2025-03-09 06:22:32,096 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 128 flow [2025-03-09 06:22:32,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:32,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:32,097 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:22:32,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:22:32,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:22:32,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:32,098 INFO L85 PathProgramCache]: Analyzing trace with hash 231811110, now seen corresponding path program 1 times [2025-03-09 06:22:32,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:32,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060637101] [2025-03-09 06:22:32,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:32,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:32,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:22:32,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:22:32,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:32,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:32,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:32,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:32,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060637101] [2025-03-09 06:22:32,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060637101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:32,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:32,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:32,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590956256] [2025-03-09 06:22:32,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:32,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:32,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:32,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:32,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:32,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2025-03-09 06:22:32,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:32,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:32,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2025-03-09 06:22:32,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:32,733 INFO L124 PetriNetUnfolderBase]: 4505/7983 cut-off events. [2025-03-09 06:22:32,733 INFO L125 PetriNetUnfolderBase]: For 669/669 co-relation queries the response was YES. [2025-03-09 06:22:32,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14904 conditions, 7983 events. 4505/7983 cut-off events. For 669/669 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 59989 event pairs, 806 based on Foata normal form. 219/7788 useless extension candidates. Maximal degree in co-relation 13393. Up to 4911 conditions per place. [2025-03-09 06:22:32,784 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 48 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2025-03-09 06:22:32,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 276 flow [2025-03-09 06:22:32,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:32,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-03-09 06:22:32,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6779661016949152 [2025-03-09 06:22:32,787 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 128 flow. Second operand 3 states and 120 transitions. [2025-03-09 06:22:32,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 276 flow [2025-03-09 06:22:32,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:32,792 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 126 flow [2025-03-09 06:22:32,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2025-03-09 06:22:32,793 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2025-03-09 06:22:32,794 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 126 flow [2025-03-09 06:22:32,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:32,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:32,794 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:32,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 06:22:32,795 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:22:32,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:32,796 INFO L85 PathProgramCache]: Analyzing trace with hash -585418857, now seen corresponding path program 1 times [2025-03-09 06:22:32,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:32,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562038079] [2025-03-09 06:22:32,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:32,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:32,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:22:32,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:22:32,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:32,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:32,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:32,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562038079] [2025-03-09 06:22:32,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562038079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:32,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:32,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:32,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519376912] [2025-03-09 06:22:32,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:32,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:32,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:32,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:32,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:32,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2025-03-09 06:22:32,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:32,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:32,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2025-03-09 06:22:32,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:33,317 INFO L124 PetriNetUnfolderBase]: 5065/8773 cut-off events. [2025-03-09 06:22:33,318 INFO L125 PetriNetUnfolderBase]: For 751/751 co-relation queries the response was YES. [2025-03-09 06:22:33,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16548 conditions, 8773 events. 5065/8773 cut-off events. For 751/751 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 64835 event pairs, 824 based on Foata normal form. 216/8563 useless extension candidates. Maximal degree in co-relation 11982. Up to 5648 conditions per place. [2025-03-09 06:22:33,366 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 48 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2025-03-09 06:22:33,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 71 transitions, 271 flow [2025-03-09 06:22:33,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:33,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:33,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-03-09 06:22:33,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6779661016949152 [2025-03-09 06:22:33,368 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 126 flow. Second operand 3 states and 120 transitions. [2025-03-09 06:22:33,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 71 transitions, 271 flow [2025-03-09 06:22:33,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 71 transitions, 263 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:33,371 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 124 flow [2025-03-09 06:22:33,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2025-03-09 06:22:33,372 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places. [2025-03-09 06:22:33,372 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 124 flow [2025-03-09 06:22:33,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:33,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:33,372 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:33,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 06:22:33,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:22:33,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:33,372 INFO L85 PathProgramCache]: Analyzing trace with hash -968115087, now seen corresponding path program 1 times [2025-03-09 06:22:33,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:33,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381191422] [2025-03-09 06:22:33,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:33,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:33,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:22:33,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:22:33,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:33,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:33,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:33,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381191422] [2025-03-09 06:22:33,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381191422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:33,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:33,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:33,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074405013] [2025-03-09 06:22:33,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:33,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:33,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:33,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:33,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:33,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2025-03-09 06:22:33,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:33,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:33,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2025-03-09 06:22:33,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:33,803 INFO L124 PetriNetUnfolderBase]: 4505/7997 cut-off events. [2025-03-09 06:22:33,803 INFO L125 PetriNetUnfolderBase]: For 664/664 co-relation queries the response was YES. [2025-03-09 06:22:33,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14912 conditions, 7997 events. 4505/7997 cut-off events. For 664/664 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 59715 event pairs, 824 based on Foata normal form. 216/7805 useless extension candidates. Maximal degree in co-relation 9230. Up to 4872 conditions per place. [2025-03-09 06:22:33,862 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 47 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2025-03-09 06:22:33,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 70 transitions, 263 flow [2025-03-09 06:22:33,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:33,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:33,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-03-09 06:22:33,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.672316384180791 [2025-03-09 06:22:33,864 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 124 flow. Second operand 3 states and 119 transitions. [2025-03-09 06:22:33,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 70 transitions, 263 flow [2025-03-09 06:22:33,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:33,869 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 122 flow [2025-03-09 06:22:33,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2025-03-09 06:22:33,872 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2025-03-09 06:22:33,872 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 122 flow [2025-03-09 06:22:33,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:33,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:33,873 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:33,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 06:22:33,873 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:22:33,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:33,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1615485682, now seen corresponding path program 1 times [2025-03-09 06:22:33,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:33,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890785590] [2025-03-09 06:22:33,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:33,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:33,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:22:33,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:22:33,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:33,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:33,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:33,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890785590] [2025-03-09 06:22:33,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890785590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:33,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:33,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:33,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516990658] [2025-03-09 06:22:33,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:33,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:33,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:33,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:33,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:33,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2025-03-09 06:22:33,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-09 06:22:33,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:33,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2025-03-09 06:22:33,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:34,514 INFO L124 PetriNetUnfolderBase]: 5017/8540 cut-off events. [2025-03-09 06:22:34,514 INFO L125 PetriNetUnfolderBase]: For 742/742 co-relation queries the response was YES. [2025-03-09 06:22:34,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16207 conditions, 8540 events. 5017/8540 cut-off events. For 742/742 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 61513 event pairs, 1094 based on Foata normal form. 192/8369 useless extension candidates. Maximal degree in co-relation 10059. Up to 5120 conditions per place. [2025-03-09 06:22:34,560 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 47 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-03-09 06:22:34,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 258 flow [2025-03-09 06:22:34,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:34,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-03-09 06:22:34,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.672316384180791 [2025-03-09 06:22:34,561 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 122 flow. Second operand 3 states and 119 transitions. [2025-03-09 06:22:34,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 258 flow [2025-03-09 06:22:34,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 68 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:34,563 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 120 flow [2025-03-09 06:22:34,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2025-03-09 06:22:34,568 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2025-03-09 06:22:34,568 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 120 flow [2025-03-09 06:22:34,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-09 06:22:34,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:34,568 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-09 06:22:34,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 06:22:34,568 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:22:34,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:34,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1459552590, now seen corresponding path program 1 times [2025-03-09 06:22:34,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:34,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658162173] [2025-03-09 06:22:34,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:34,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:34,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:22:34,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:22:34,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:34,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:22:34,585 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:22:34,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:22:34,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:22:34,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:34,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:22:34,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:22:34,594 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:22:34,594 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-03-09 06:22:34,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-03-09 06:22:34,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-03-09 06:22:34,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-03-09 06:22:34,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-03-09 06:22:34,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-03-09 06:22:34,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-03-09 06:22:34,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-03-09 06:22:34,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-03-09 06:22:34,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-03-09 06:22:34,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-03-09 06:22:34,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-03-09 06:22:34,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-03-09 06:22:34,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-03-09 06:22:34,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-03-09 06:22:34,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-03-09 06:22:34,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-03-09 06:22:34,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 06:22:34,596 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-09 06:22:34,596 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:22:34,596 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-09 06:22:34,624 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 06:22:34,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 77 transitions, 182 flow [2025-03-09 06:22:34,636 INFO L124 PetriNetUnfolderBase]: 8/88 cut-off events. [2025-03-09 06:22:34,636 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-09 06:22:34,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 88 events. 8/88 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 272 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 79. Up to 5 conditions per place. [2025-03-09 06:22:34,636 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 77 transitions, 182 flow [2025-03-09 06:22:34,637 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 77 transitions, 182 flow [2025-03-09 06:22:34,638 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:22:34,638 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;@71e23515, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:22:34,638 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-09 06:22:34,644 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:22:34,644 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-03-09 06:22:34,644 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:22:34,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:34,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:22:34,644 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:22:34,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:34,644 INFO L85 PathProgramCache]: Analyzing trace with hash 358070799, now seen corresponding path program 1 times [2025-03-09 06:22:34,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:34,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840192786] [2025-03-09 06:22:34,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:34,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:34,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:22:34,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:22:34,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:34,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:34,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:34,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840192786] [2025-03-09 06:22:34,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840192786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:34,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:34,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:34,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643264053] [2025-03-09 06:22:34,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:34,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:34,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:34,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:34,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:34,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 77 [2025-03-09 06:22:34,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:34,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:34,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 77 [2025-03-09 06:22:34,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:38,898 INFO L124 PetriNetUnfolderBase]: 56332/84118 cut-off events. [2025-03-09 06:22:38,898 INFO L125 PetriNetUnfolderBase]: For 6417/6417 co-relation queries the response was YES. [2025-03-09 06:22:39,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159450 conditions, 84118 events. 56332/84118 cut-off events. For 6417/6417 co-relation queries the response was YES. Maximal size of possible extension queue 3721. Compared 672093 event pairs, 31380 based on Foata normal form. 7398/87068 useless extension candidates. Maximal degree in co-relation 92390. Up to 57853 conditions per place. [2025-03-09 06:22:39,395 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 67 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2025-03-09 06:22:39,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 100 transitions, 387 flow [2025-03-09 06:22:39,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:39,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2025-03-09 06:22:39,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7445887445887446 [2025-03-09 06:22:39,396 INFO L175 Difference]: Start difference. First operand has 78 places, 77 transitions, 182 flow. Second operand 3 states and 172 transitions. [2025-03-09 06:22:39,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 100 transitions, 387 flow [2025-03-09 06:22:39,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 100 transitions, 375 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-09 06:22:39,399 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 168 flow [2025-03-09 06:22:39,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2025-03-09 06:22:39,400 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 0 predicate places. [2025-03-09 06:22:39,400 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 168 flow [2025-03-09 06:22:39,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:39,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:39,400 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:22:39,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 06:22:39,401 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:22:39,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:39,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1784706746, now seen corresponding path program 1 times [2025-03-09 06:22:39,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:39,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625769971] [2025-03-09 06:22:39,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:39,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:39,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:22:39,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:22:39,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:39,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:39,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:39,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625769971] [2025-03-09 06:22:39,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625769971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:39,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:39,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:39,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389235275] [2025-03-09 06:22:39,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:39,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:39,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:39,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:39,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:39,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 77 [2025-03-09 06:22:39,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:39,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:39,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 77 [2025-03-09 06:22:39,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:43,292 INFO L124 PetriNetUnfolderBase]: 50073/74907 cut-off events. [2025-03-09 06:22:43,293 INFO L125 PetriNetUnfolderBase]: For 5477/5477 co-relation queries the response was YES. [2025-03-09 06:22:43,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144293 conditions, 74907 events. 50073/74907 cut-off events. For 5477/5477 co-relation queries the response was YES. Maximal size of possible extension queue 3292. Compared 589560 event pairs, 27618 based on Foata normal form. 1755/72634 useless extension candidates. Maximal degree in co-relation 143597. Up to 49839 conditions per place. [2025-03-09 06:22:43,724 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 66 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2025-03-09 06:22:43,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 99 transitions, 375 flow [2025-03-09 06:22:43,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:43,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:43,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2025-03-09 06:22:43,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7012987012987013 [2025-03-09 06:22:43,725 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 168 flow. Second operand 3 states and 162 transitions. [2025-03-09 06:22:43,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 99 transitions, 375 flow [2025-03-09 06:22:43,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 99 transitions, 371 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:43,732 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 166 flow [2025-03-09 06:22:43,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2025-03-09 06:22:43,733 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2025-03-09 06:22:43,733 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 166 flow [2025-03-09 06:22:43,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:43,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:43,733 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:43,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 06:22:43,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:22:43,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:43,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1445031273, now seen corresponding path program 1 times [2025-03-09 06:22:43,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:43,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244687400] [2025-03-09 06:22:43,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:43,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:43,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:22:43,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:22:43,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:43,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:43,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:43,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:43,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244687400] [2025-03-09 06:22:43,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244687400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:43,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:43,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:43,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707912885] [2025-03-09 06:22:43,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:43,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:43,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:43,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:43,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:43,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 77 [2025-03-09 06:22:43,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:43,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:43,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 77 [2025-03-09 06:22:43,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:48,328 INFO L124 PetriNetUnfolderBase]: 56329/85957 cut-off events. [2025-03-09 06:22:48,328 INFO L125 PetriNetUnfolderBase]: For 6263/6263 co-relation queries the response was YES. [2025-03-09 06:22:48,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164005 conditions, 85957 events. 56329/85957 cut-off events. For 6263/6263 co-relation queries the response was YES. Maximal size of possible extension queue 3509. Compared 727883 event pairs, 9528 based on Foata normal form. 1752/84253 useless extension candidates. Maximal degree in co-relation 120042. Up to 57808 conditions per place. [2025-03-09 06:22:48,862 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 66 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2025-03-09 06:22:48,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 97 transitions, 370 flow [2025-03-09 06:22:48,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:48,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:48,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2025-03-09 06:22:48,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7012987012987013 [2025-03-09 06:22:48,863 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 166 flow. Second operand 3 states and 162 transitions. [2025-03-09 06:22:48,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 97 transitions, 370 flow [2025-03-09 06:22:48,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 97 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:48,869 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 164 flow [2025-03-09 06:22:48,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2025-03-09 06:22:48,870 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -2 predicate places. [2025-03-09 06:22:48,870 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 164 flow [2025-03-09 06:22:48,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:48,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:48,870 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:48,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 06:22:48,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:22:48,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:48,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1846296113, now seen corresponding path program 1 times [2025-03-09 06:22:48,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:48,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472525639] [2025-03-09 06:22:48,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:48,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:48,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:22:48,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:22:48,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:48,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:48,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:48,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472525639] [2025-03-09 06:22:48,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472525639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:48,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:48,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:48,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581546446] [2025-03-09 06:22:48,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:48,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:48,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:48,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:48,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:48,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 77 [2025-03-09 06:22:48,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:48,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:48,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 77 [2025-03-09 06:22:48,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:53,104 INFO L124 PetriNetUnfolderBase]: 50073/77949 cut-off events. [2025-03-09 06:22:53,105 INFO L125 PetriNetUnfolderBase]: For 5600/5600 co-relation queries the response was YES. [2025-03-09 06:22:53,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147329 conditions, 77949 events. 50073/77949 cut-off events. For 5600/5600 co-relation queries the response was YES. Maximal size of possible extension queue 3188. Compared 670407 event pairs, 9528 based on Foata normal form. 1752/76359 useless extension candidates. Maximal degree in co-relation 91960. Up to 49800 conditions per place. [2025-03-09 06:22:53,673 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 65 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2025-03-09 06:22:53,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 96 transitions, 362 flow [2025-03-09 06:22:53,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:53,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:53,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2025-03-09 06:22:53,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2025-03-09 06:22:53,674 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 164 flow. Second operand 3 states and 161 transitions. [2025-03-09 06:22:53,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 96 transitions, 362 flow [2025-03-09 06:22:53,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 96 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:53,685 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 162 flow [2025-03-09 06:22:53,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2025-03-09 06:22:53,687 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -3 predicate places. [2025-03-09 06:22:53,687 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 162 flow [2025-03-09 06:22:53,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:53,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:53,687 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:53,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 06:22:53,688 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:22:53,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:53,688 INFO L85 PathProgramCache]: Analyzing trace with hash -519094128, now seen corresponding path program 1 times [2025-03-09 06:22:53,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:53,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550319165] [2025-03-09 06:22:53,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:53,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:53,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:22:53,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:22:53,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:53,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:53,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:53,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:53,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550319165] [2025-03-09 06:22:53,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550319165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:53,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:53,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:53,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958999981] [2025-03-09 06:22:53,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:53,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:53,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:53,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:53,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:53,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 77 [2025-03-09 06:22:53,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:53,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:53,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 77 [2025-03-09 06:22:53,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:58,326 INFO L124 PetriNetUnfolderBase]: 56281/86066 cut-off events. [2025-03-09 06:22:58,326 INFO L125 PetriNetUnfolderBase]: For 6300/6300 co-relation queries the response was YES. [2025-03-09 06:22:58,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164006 conditions, 86066 events. 56281/86066 cut-off events. For 6300/6300 co-relation queries the response was YES. Maximal size of possible extension queue 3498. Compared 726182 event pairs, 9798 based on Foata normal form. 1728/84327 useless extension candidates. Maximal degree in co-relation 102399. Up to 57280 conditions per place. [2025-03-09 06:22:58,800 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 65 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2025-03-09 06:22:58,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 94 transitions, 357 flow [2025-03-09 06:22:58,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2025-03-09 06:22:58,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2025-03-09 06:22:58,801 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 162 flow. Second operand 3 states and 161 transitions. [2025-03-09 06:22:58,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 94 transitions, 357 flow [2025-03-09 06:22:58,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 94 transitions, 349 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:58,810 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 160 flow [2025-03-09 06:22:58,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2025-03-09 06:22:58,810 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -4 predicate places. [2025-03-09 06:22:58,810 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 160 flow [2025-03-09 06:22:58,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:58,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:58,811 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:58,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 06:22:58,811 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:22:58,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:58,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1087951555, now seen corresponding path program 1 times [2025-03-09 06:22:58,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:58,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425311211] [2025-03-09 06:22:58,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:58,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:58,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:22:58,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:22:58,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:58,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:58,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:58,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:58,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425311211] [2025-03-09 06:22:58,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425311211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:58,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:58,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:58,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331367917] [2025-03-09 06:22:58,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:58,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:58,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:58,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:58,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:58,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 77 [2025-03-09 06:22:58,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:58,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:58,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 77 [2025-03-09 06:22:58,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand