./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:27:10,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:27:10,076 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:27:10,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:27:10,082 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:27:10,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:27:10,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:27:10,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:27:10,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:27:10,105 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:27:10,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:27:10,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:27:10,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:27:10,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:27:10,106 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:27:10,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:27:10,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:27:10,106 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:27:10,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:27:10,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:27:10,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:27:10,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:27:10,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:27:10,107 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:27:10,107 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:27:10,107 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:27:10,107 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:27:10,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:27:10,107 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:27:10,107 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:27:10,108 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:27:10,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:27:10,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:27:10,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:27:10,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:27:10,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:27:10,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:27:10,108 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:27:10,108 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:27:10,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:27:10,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:27:10,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:27:10,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:27:10,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:27:10,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:27:10,109 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 -> ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 [2025-03-04 15:27:10,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:27:10,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:27:10,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:27:10,504 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:27:10,504 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:27:10,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2025-03-04 15:27:11,637 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/823abaded/5f55525d06394b50a958adbc3b2be21f/FLAGfa07417a3 [2025-03-04 15:27:11,863 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:27:11,863 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2025-03-04 15:27:11,876 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/823abaded/5f55525d06394b50a958adbc3b2be21f/FLAGfa07417a3 [2025-03-04 15:27:12,214 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/823abaded/5f55525d06394b50a958adbc3b2be21f [2025-03-04 15:27:12,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:27:12,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:27:12,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:27:12,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:27:12,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:27:12,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:27:12" (1/1) ... [2025-03-04 15:27:12,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c4a6df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:12, skipping insertion in model container [2025-03-04 15:27:12,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:27:12" (1/1) ... [2025-03-04 15:27:12,231 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:27:12,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:27:12,337 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:27:12,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:27:12,362 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:27:12,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:12 WrapperNode [2025-03-04 15:27:12,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:27:12,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:27:12,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:27:12,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:27:12,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:12" (1/1) ... [2025-03-04 15:27:12,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:12" (1/1) ... [2025-03-04 15:27:12,384 INFO L138 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 190 [2025-03-04 15:27:12,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:27:12,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:27:12,384 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:27:12,384 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:27:12,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:12" (1/1) ... [2025-03-04 15:27:12,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:12" (1/1) ... [2025-03-04 15:27:12,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:12" (1/1) ... [2025-03-04 15:27:12,405 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 15:27:12,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:12" (1/1) ... [2025-03-04 15:27:12,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:12" (1/1) ... [2025-03-04 15:27:12,409 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:12" (1/1) ... [2025-03-04 15:27:12,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:12" (1/1) ... [2025-03-04 15:27:12,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:12" (1/1) ... [2025-03-04 15:27:12,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:12" (1/1) ... [2025-03-04 15:27:12,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:27:12,413 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:27:12,413 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:27:12,413 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:27:12,413 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:12" (1/1) ... [2025-03-04 15:27:12,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:27:12,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:12,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:27:12,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:27:12,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:27:12,456 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:27:12,456 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:27:12,456 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:27:12,456 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:27:12,456 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:27:12,456 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:27:12,456 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 15:27:12,456 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 15:27:12,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:27:12,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:27:12,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:27:12,457 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:27:12,524 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:27:12,526 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:27:12,779 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:27:12,781 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:27:12,947 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:27:12,947 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:27:12,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:27:12 BoogieIcfgContainer [2025-03-04 15:27:12,948 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:27:12,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:27:12,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:27:12,952 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:27:12,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:27:12" (1/3) ... [2025-03-04 15:27:12,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75dc9897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:27:12, skipping insertion in model container [2025-03-04 15:27:12,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:12" (2/3) ... [2025-03-04 15:27:12,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75dc9897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:27:12, skipping insertion in model container [2025-03-04 15:27:12,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:27:12" (3/3) ... [2025-03-04 15:27:12,954 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2025-03-04 15:27:12,963 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:27:12,964 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-4.wvr.c that has 5 procedures, 71 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-03-04 15:27:12,964 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:27:13,011 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 15:27:13,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 73 transitions, 174 flow [2025-03-04 15:27:13,075 INFO L124 PetriNetUnfolderBase]: 3/69 cut-off events. [2025-03-04 15:27:13,078 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 15:27:13,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 69 events. 3/69 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 181 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2025-03-04 15:27:13,081 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 73 transitions, 174 flow [2025-03-04 15:27:13,083 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 67 transitions, 155 flow [2025-03-04 15:27:13,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:27:13,096 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;@36f1bf3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:27:13,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-03-04 15:27:13,100 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:27:13,101 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-03-04 15:27:13,101 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:27:13,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:13,101 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:13,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:13,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:13,106 INFO L85 PathProgramCache]: Analyzing trace with hash 682006572, now seen corresponding path program 1 times [2025-03-04 15:27:13,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:13,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764872441] [2025-03-04 15:27:13,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:13,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:13,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:27:13,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:27:13,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:13,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:13,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:13,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764872441] [2025-03-04 15:27:13,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764872441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:13,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:13,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:13,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322746286] [2025-03-04 15:27:13,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:13,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:13,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:13,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:13,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:13,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 73 [2025-03-04 15:27:13,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 67 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:13,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:13,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 73 [2025-03-04 15:27:13,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:17,107 INFO L124 PetriNetUnfolderBase]: 57657/76775 cut-off events. [2025-03-04 15:27:17,107 INFO L125 PetriNetUnfolderBase]: For 2457/2457 co-relation queries the response was YES. [2025-03-04 15:27:17,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152333 conditions, 76775 events. 57657/76775 cut-off events. For 2457/2457 co-relation queries the response was YES. Maximal size of possible extension queue 3090. Compared 491357 event pairs, 45449 based on Foata normal form. 0/47187 useless extension candidates. Maximal degree in co-relation 144300. Up to 73132 conditions per place. [2025-03-04 15:27:17,507 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 50 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2025-03-04 15:27:17,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 63 transitions, 253 flow [2025-03-04 15:27:17,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-03-04 15:27:17,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4520547945205479 [2025-03-04 15:27:17,517 INFO L175 Difference]: Start difference. First operand has 77 places, 67 transitions, 155 flow. Second operand 3 states and 99 transitions. [2025-03-04 15:27:17,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 63 transitions, 253 flow [2025-03-04 15:27:17,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 63 transitions, 240 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 15:27:17,716 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 140 flow [2025-03-04 15:27:17,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2025-03-04 15:27:17,720 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -9 predicate places. [2025-03-04 15:27:17,720 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 140 flow [2025-03-04 15:27:17,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:17,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:17,721 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:17,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:27:17,721 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:17,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:17,722 INFO L85 PathProgramCache]: Analyzing trace with hash 682006573, now seen corresponding path program 1 times [2025-03-04 15:27:17,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:17,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703915581] [2025-03-04 15:27:17,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:17,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:17,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:27:17,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:27:17,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:17,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:17,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:17,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703915581] [2025-03-04 15:27:17,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703915581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:17,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:17,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:17,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538044815] [2025-03-04 15:27:17,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:17,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:17,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:17,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:17,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:17,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 73 [2025-03-04 15:27:17,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:17,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:17,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 73 [2025-03-04 15:27:17,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:20,553 INFO L124 PetriNetUnfolderBase]: 57214/76146 cut-off events. [2025-03-04 15:27:20,554 INFO L125 PetriNetUnfolderBase]: For 609/609 co-relation queries the response was YES. [2025-03-04 15:27:20,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150337 conditions, 76146 events. 57214/76146 cut-off events. For 609/609 co-relation queries the response was YES. Maximal size of possible extension queue 3213. Compared 482893 event pairs, 35458 based on Foata normal form. 0/47638 useless extension candidates. Maximal degree in co-relation 150313. Up to 72627 conditions per place. [2025-03-04 15:27:21,078 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 57 selfloop transitions, 7 changer transitions 0/74 dead transitions. [2025-03-04 15:27:21,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 74 transitions, 294 flow [2025-03-04 15:27:21,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:21,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:21,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2025-03-04 15:27:21,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.502283105022831 [2025-03-04 15:27:21,079 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 140 flow. Second operand 3 states and 110 transitions. [2025-03-04 15:27:21,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 74 transitions, 294 flow [2025-03-04 15:27:21,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 74 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:21,082 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 179 flow [2025-03-04 15:27:21,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2025-03-04 15:27:21,083 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -8 predicate places. [2025-03-04 15:27:21,083 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 179 flow [2025-03-04 15:27:21,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:21,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:21,084 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:21,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:27:21,084 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:21,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:21,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1892069748, now seen corresponding path program 1 times [2025-03-04 15:27:21,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:21,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023963529] [2025-03-04 15:27:21,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:21,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:21,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:27:21,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:27:21,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:21,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:21,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:21,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:21,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023963529] [2025-03-04 15:27:21,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023963529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:21,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:21,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:21,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600997647] [2025-03-04 15:27:21,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:21,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:21,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:21,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:21,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:21,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 73 [2025-03-04 15:27:21,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:21,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:21,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 73 [2025-03-04 15:27:21,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:24,010 INFO L124 PetriNetUnfolderBase]: 54876/73305 cut-off events. [2025-03-04 15:27:24,010 INFO L125 PetriNetUnfolderBase]: For 5215/5215 co-relation queries the response was YES. [2025-03-04 15:27:24,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155476 conditions, 73305 events. 54876/73305 cut-off events. For 5215/5215 co-relation queries the response was YES. Maximal size of possible extension queue 3175. Compared 469564 event pairs, 20100 based on Foata normal form. 0/46638 useless extension candidates. Maximal degree in co-relation 141283. Up to 69383 conditions per place. [2025-03-04 15:27:24,321 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 88 selfloop transitions, 11 changer transitions 0/109 dead transitions. [2025-03-04 15:27:24,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 109 transitions, 477 flow [2025-03-04 15:27:24,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:24,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:24,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2025-03-04 15:27:24,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5445205479452054 [2025-03-04 15:27:24,323 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 179 flow. Second operand 4 states and 159 transitions. [2025-03-04 15:27:24,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 109 transitions, 477 flow [2025-03-04 15:27:24,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 109 transitions, 470 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:24,324 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 234 flow [2025-03-04 15:27:24,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2025-03-04 15:27:24,325 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -5 predicate places. [2025-03-04 15:27:24,325 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 234 flow [2025-03-04 15:27:24,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:24,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:24,325 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:24,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:27:24,326 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:24,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:24,327 INFO L85 PathProgramCache]: Analyzing trace with hash -955619215, now seen corresponding path program 1 times [2025-03-04 15:27:24,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:24,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507642483] [2025-03-04 15:27:24,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:24,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:24,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:27:24,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:27:24,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:24,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:24,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:24,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507642483] [2025-03-04 15:27:24,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507642483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:24,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:24,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:24,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089809788] [2025-03-04 15:27:24,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:24,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:24,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:24,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:24,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:24,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 73 [2025-03-04 15:27:24,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:24,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:24,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 73 [2025-03-04 15:27:24,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:27,409 INFO L124 PetriNetUnfolderBase]: 55465/73572 cut-off events. [2025-03-04 15:27:27,409 INFO L125 PetriNetUnfolderBase]: For 17683/17683 co-relation queries the response was YES. [2025-03-04 15:27:27,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170025 conditions, 73572 events. 55465/73572 cut-off events. For 17683/17683 co-relation queries the response was YES. Maximal size of possible extension queue 3206. Compared 455701 event pairs, 16940 based on Foata normal form. 0/49574 useless extension candidates. Maximal degree in co-relation 108337. Up to 45907 conditions per place. [2025-03-04 15:27:27,746 INFO L140 encePairwiseOnDemand]: 58/73 looper letters, 93 selfloop transitions, 11 changer transitions 0/114 dead transitions. [2025-03-04 15:27:27,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 114 transitions, 587 flow [2025-03-04 15:27:27,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-03-04 15:27:27,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6301369863013698 [2025-03-04 15:27:27,747 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 234 flow. Second operand 3 states and 138 transitions. [2025-03-04 15:27:27,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 114 transitions, 587 flow [2025-03-04 15:27:27,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 114 transitions, 553 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:27,752 INFO L231 Difference]: Finished difference. Result has 74 places, 79 transitions, 296 flow [2025-03-04 15:27:27,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=74, PETRI_TRANSITIONS=79} [2025-03-04 15:27:27,753 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -3 predicate places. [2025-03-04 15:27:27,753 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 79 transitions, 296 flow [2025-03-04 15:27:27,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:27,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:27,753 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:27,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:27:27,753 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:27,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:27,754 INFO L85 PathProgramCache]: Analyzing trace with hash -955619216, now seen corresponding path program 1 times [2025-03-04 15:27:27,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:27,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8840908] [2025-03-04 15:27:27,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:27,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:27,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:27:27,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:27:27,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:27,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:27,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:27,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:27,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8840908] [2025-03-04 15:27:27,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8840908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:27,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:27,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:27,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873016846] [2025-03-04 15:27:27,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:27,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:27,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:27,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:27,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:27,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 73 [2025-03-04 15:27:27,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 79 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:27,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:27,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 73 [2025-03-04 15:27:27,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:29,563 INFO L124 PetriNetUnfolderBase]: 27301/37000 cut-off events. [2025-03-04 15:27:29,563 INFO L125 PetriNetUnfolderBase]: For 27393/27393 co-relation queries the response was YES. [2025-03-04 15:27:29,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98704 conditions, 37000 events. 27301/37000 cut-off events. For 27393/27393 co-relation queries the response was YES. Maximal size of possible extension queue 1605. Compared 227389 event pairs, 19374 based on Foata normal form. 5938/33805 useless extension candidates. Maximal degree in co-relation 17965. Up to 35452 conditions per place. [2025-03-04 15:27:29,735 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 58 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2025-03-04 15:27:29,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 71 transitions, 378 flow [2025-03-04 15:27:29,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:29,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:29,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-03-04 15:27:29,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4337899543378995 [2025-03-04 15:27:29,738 INFO L175 Difference]: Start difference. First operand has 74 places, 79 transitions, 296 flow. Second operand 3 states and 95 transitions. [2025-03-04 15:27:29,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 71 transitions, 378 flow [2025-03-04 15:27:29,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 71 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:29,742 INFO L231 Difference]: Finished difference. Result has 70 places, 71 transitions, 248 flow [2025-03-04 15:27:29,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=70, PETRI_TRANSITIONS=71} [2025-03-04 15:27:29,742 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -7 predicate places. [2025-03-04 15:27:29,742 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 71 transitions, 248 flow [2025-03-04 15:27:29,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:29,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:29,742 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:29,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:27:29,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:29,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:29,743 INFO L85 PathProgramCache]: Analyzing trace with hash 618869412, now seen corresponding path program 1 times [2025-03-04 15:27:29,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:29,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133687657] [2025-03-04 15:27:29,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:29,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:29,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:27:29,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:27:29,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:29,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:29,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:29,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:29,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133687657] [2025-03-04 15:27:29,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133687657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:29,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:29,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:27:29,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653775300] [2025-03-04 15:27:29,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:29,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:27:29,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:29,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:27:29,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:27:29,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 73 [2025-03-04 15:27:29,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 71 transitions, 248 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:29,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:29,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 73 [2025-03-04 15:27:29,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:31,293 INFO L124 PetriNetUnfolderBase]: 22166/30561 cut-off events. [2025-03-04 15:27:31,293 INFO L125 PetriNetUnfolderBase]: For 10080/10080 co-relation queries the response was YES. [2025-03-04 15:27:31,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76945 conditions, 30561 events. 22166/30561 cut-off events. For 10080/10080 co-relation queries the response was YES. Maximal size of possible extension queue 1414. Compared 186173 event pairs, 4361 based on Foata normal form. 0/24196 useless extension candidates. Maximal degree in co-relation 76912. Up to 27029 conditions per place. [2025-03-04 15:27:31,447 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 110 selfloop transitions, 15 changer transitions 0/135 dead transitions. [2025-03-04 15:27:31,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 135 transitions, 686 flow [2025-03-04 15:27:31,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:27:31,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:27:31,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2025-03-04 15:27:31,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5232876712328767 [2025-03-04 15:27:31,449 INFO L175 Difference]: Start difference. First operand has 70 places, 71 transitions, 248 flow. Second operand 5 states and 191 transitions. [2025-03-04 15:27:31,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 135 transitions, 686 flow [2025-03-04 15:27:31,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 135 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:31,452 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 320 flow [2025-03-04 15:27:31,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=320, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2025-03-04 15:27:31,452 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -4 predicate places. [2025-03-04 15:27:31,452 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 320 flow [2025-03-04 15:27:31,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:31,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:31,453 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:31,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:27:31,453 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:31,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:31,453 INFO L85 PathProgramCache]: Analyzing trace with hash -853116118, now seen corresponding path program 1 times [2025-03-04 15:27:31,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:31,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307146701] [2025-03-04 15:27:31,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:31,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:31,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:27:31,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:27:31,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:31,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:31,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:31,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:31,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307146701] [2025-03-04 15:27:31,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307146701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:31,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:31,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:31,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778305789] [2025-03-04 15:27:31,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:31,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:31,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:31,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:31,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:31,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 73 [2025-03-04 15:27:31,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 320 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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-04 15:27:31,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:31,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 73 [2025-03-04 15:27:31,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:32,517 INFO L124 PetriNetUnfolderBase]: 18088/24234 cut-off events. [2025-03-04 15:27:32,517 INFO L125 PetriNetUnfolderBase]: For 16743/16848 co-relation queries the response was YES. [2025-03-04 15:27:32,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66242 conditions, 24234 events. 18088/24234 cut-off events. For 16743/16848 co-relation queries the response was YES. Maximal size of possible extension queue 988. Compared 132487 event pairs, 2607 based on Foata normal form. 94/21227 useless extension candidates. Maximal degree in co-relation 28529. Up to 12537 conditions per place. [2025-03-04 15:27:32,649 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 121 selfloop transitions, 11 changer transitions 0/142 dead transitions. [2025-03-04 15:27:32,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 142 transitions, 906 flow [2025-03-04 15:27:32,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:32,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2025-03-04 15:27:32,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5753424657534246 [2025-03-04 15:27:32,650 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 320 flow. Second operand 4 states and 168 transitions. [2025-03-04 15:27:32,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 142 transitions, 906 flow [2025-03-04 15:27:32,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 142 transitions, 824 flow, removed 24 selfloop flow, removed 3 redundant places. [2025-03-04 15:27:32,654 INFO L231 Difference]: Finished difference. Result has 74 places, 79 transitions, 344 flow [2025-03-04 15:27:32,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=344, PETRI_PLACES=74, PETRI_TRANSITIONS=79} [2025-03-04 15:27:32,655 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -3 predicate places. [2025-03-04 15:27:32,655 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 79 transitions, 344 flow [2025-03-04 15:27:32,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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-04 15:27:32,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:32,655 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:32,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:27:32,656 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:32,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:32,656 INFO L85 PathProgramCache]: Analyzing trace with hash -974283829, now seen corresponding path program 1 times [2025-03-04 15:27:32,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:32,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549385122] [2025-03-04 15:27:32,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:32,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:32,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:27:32,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:27:32,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:32,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:32,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:32,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549385122] [2025-03-04 15:27:32,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549385122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:32,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:32,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:27:32,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210777141] [2025-03-04 15:27:32,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:32,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:27:32,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:32,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:27:32,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:27:32,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 73 [2025-03-04 15:27:32,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 79 transitions, 344 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:32,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:32,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 73 [2025-03-04 15:27:32,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:33,664 INFO L124 PetriNetUnfolderBase]: 12122/17359 cut-off events. [2025-03-04 15:27:33,665 INFO L125 PetriNetUnfolderBase]: For 17142/17142 co-relation queries the response was YES. [2025-03-04 15:27:33,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47976 conditions, 17359 events. 12122/17359 cut-off events. For 17142/17142 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 101668 event pairs, 563 based on Foata normal form. 0/15650 useless extension candidates. Maximal degree in co-relation 42262. Up to 8953 conditions per place. [2025-03-04 15:27:33,765 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 135 selfloop transitions, 19 changer transitions 0/164 dead transitions. [2025-03-04 15:27:33,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 164 transitions, 945 flow [2025-03-04 15:27:33,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:27:33,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:27:33,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 222 transitions. [2025-03-04 15:27:33,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5068493150684932 [2025-03-04 15:27:33,766 INFO L175 Difference]: Start difference. First operand has 74 places, 79 transitions, 344 flow. Second operand 6 states and 222 transitions. [2025-03-04 15:27:33,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 164 transitions, 945 flow [2025-03-04 15:27:33,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 164 transitions, 887 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:33,774 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 328 flow [2025-03-04 15:27:33,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=328, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2025-03-04 15:27:33,775 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -4 predicate places. [2025-03-04 15:27:33,775 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 328 flow [2025-03-04 15:27:33,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:33,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:33,775 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:33,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:27:33,775 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:33,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:33,776 INFO L85 PathProgramCache]: Analyzing trace with hash -691683168, now seen corresponding path program 1 times [2025-03-04 15:27:33,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:33,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917365058] [2025-03-04 15:27:33,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:33,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:33,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:27:33,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:27:33,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:33,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:33,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:33,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:33,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917365058] [2025-03-04 15:27:33,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917365058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:33,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:33,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:33,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552533029] [2025-03-04 15:27:33,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:33,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:33,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:33,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:33,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:33,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 73 [2025-03-04 15:27:33,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 328 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-04 15:27:33,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:33,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 73 [2025-03-04 15:27:33,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:35,051 INFO L124 PetriNetUnfolderBase]: 18250/24821 cut-off events. [2025-03-04 15:27:35,051 INFO L125 PetriNetUnfolderBase]: For 27429/27429 co-relation queries the response was YES. [2025-03-04 15:27:35,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67217 conditions, 24821 events. 18250/24821 cut-off events. For 27429/27429 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 136631 event pairs, 10904 based on Foata normal form. 0/23630 useless extension candidates. Maximal degree in co-relation 20334. Up to 21770 conditions per place. [2025-03-04 15:27:35,355 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 104 selfloop transitions, 8 changer transitions 0/116 dead transitions. [2025-03-04 15:27:35,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 116 transitions, 734 flow [2025-03-04 15:27:35,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:35,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-03-04 15:27:35,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4885844748858447 [2025-03-04 15:27:35,356 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 328 flow. Second operand 3 states and 107 transitions. [2025-03-04 15:27:35,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 116 transitions, 734 flow [2025-03-04 15:27:35,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 116 transitions, 618 flow, removed 21 selfloop flow, removed 7 redundant places. [2025-03-04 15:27:35,371 INFO L231 Difference]: Finished difference. Result has 70 places, 79 transitions, 305 flow [2025-03-04 15:27:35,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=305, PETRI_PLACES=70, PETRI_TRANSITIONS=79} [2025-03-04 15:27:35,372 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -7 predicate places. [2025-03-04 15:27:35,372 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 79 transitions, 305 flow [2025-03-04 15:27:35,372 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-04 15:27:35,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:35,372 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:35,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:27:35,372 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:35,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:35,373 INFO L85 PathProgramCache]: Analyzing trace with hash -352776982, now seen corresponding path program 1 times [2025-03-04 15:27:35,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:35,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4277520] [2025-03-04 15:27:35,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:35,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:35,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:27:35,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:27:35,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:35,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:35,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:35,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:35,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4277520] [2025-03-04 15:27:35,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4277520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:35,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:35,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:27:35,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565576076] [2025-03-04 15:27:35,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:35,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:27:35,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:35,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:27:35,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:27:35,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 73 [2025-03-04 15:27:35,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 79 transitions, 305 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:35,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:35,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 73 [2025-03-04 15:27:35,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:36,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([495] L45-1-->L46-5: Formula: (= v_~x~0_14 0) InVars {} OutVars{~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x~0][68], [115#(<= ~s~0 1), 9#L100-1true, 42#L76true, Black: 100#(<= ~s~0 0), 70#L56-5true, 131#(<= ~s~0 1), 13#L66-5true, 64#L46-5true, 82#true, 125#(not (= ~x~0 1)), Black: 123#true]) [2025-03-04 15:27:36,059 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2025-03-04 15:27:36,059 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-04 15:27:36,059 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-04 15:27:36,059 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-03-04 15:27:36,102 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([495] L45-1-->L46-5: Formula: (= v_~x~0_14 0) InVars {} OutVars{~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x~0][68], [115#(<= ~s~0 1), 42#L76true, Black: 100#(<= ~s~0 0), 70#L56-5true, 131#(<= ~s~0 1), 64#L46-5true, 13#L66-5true, 62#L101true, 82#true, Black: 123#true, 125#(not (= ~x~0 1))]) [2025-03-04 15:27:36,102 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-03-04 15:27:36,102 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 15:27:36,102 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-04 15:27:36,102 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 15:27:36,103 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([495] L45-1-->L46-5: Formula: (= v_~x~0_14 0) InVars {} OutVars{~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x~0][68], [115#(<= ~s~0 1), 9#L100-1true, 44#thread4EXITtrue, Black: 100#(<= ~s~0 0), 70#L56-5true, 131#(<= ~s~0 1), 64#L46-5true, 13#L66-5true, 82#true, Black: 123#true, 125#(not (= ~x~0 1))]) [2025-03-04 15:27:36,103 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-03-04 15:27:36,103 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-04 15:27:36,103 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 15:27:36,103 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 15:27:36,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-5-->L66: Formula: (and (<= |v_thread3Thread1of1ForFork3_#t~post6#1_5| 2147483646) (= v_~s~0_127 |v_thread3Thread1of1ForFork3_#t~post6#1_5|) (= v_~s~0_126 (+ |v_thread3Thread1of1ForFork3_#t~post6#1_5| 1)) (<= 0 (+ 2147483649 |v_thread3Thread1of1ForFork3_#t~post6#1_5|))) InVars {~s~0=v_~s~0_127} OutVars{thread3Thread1of1ForFork3_#t~post6#1=|v_thread3Thread1of1ForFork3_#t~post6#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~post6#1, ~s~0][88], [17#L66true, 9#L100-1true, 132#(<= ~s~0 2), Black: 115#(<= ~s~0 1), Black: 100#(<= ~s~0 0), 70#L56-5true, 3#L76-5true, 82#true, 68#L46true, 125#(not (= ~x~0 1)), Black: 123#true]) [2025-03-04 15:27:36,296 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-03-04 15:27:36,296 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-04 15:27:36,296 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 15:27:36,296 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 15:27:36,303 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([495] L45-1-->L46-5: Formula: (= v_~x~0_14 0) InVars {} OutVars{~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x~0][68], [115#(<= ~s~0 1), Black: 100#(<= ~s~0 0), 44#thread4EXITtrue, 70#L56-5true, 131#(<= ~s~0 1), 62#L101true, 13#L66-5true, 64#L46-5true, 82#true, 125#(not (= ~x~0 1)), Black: 123#true]) [2025-03-04 15:27:36,303 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-03-04 15:27:36,303 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 15:27:36,303 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 15:27:36,303 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 15:27:36,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-5-->L66: Formula: (and (<= |v_thread3Thread1of1ForFork3_#t~post6#1_5| 2147483646) (= v_~s~0_127 |v_thread3Thread1of1ForFork3_#t~post6#1_5|) (= v_~s~0_126 (+ |v_thread3Thread1of1ForFork3_#t~post6#1_5| 1)) (<= 0 (+ 2147483649 |v_thread3Thread1of1ForFork3_#t~post6#1_5|))) InVars {~s~0=v_~s~0_127} OutVars{thread3Thread1of1ForFork3_#t~post6#1=|v_thread3Thread1of1ForFork3_#t~post6#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~post6#1, ~s~0][88], [17#L66true, 132#(<= ~s~0 2), Black: 115#(<= ~s~0 1), Black: 100#(<= ~s~0 0), 3#L76-5true, 70#L56-5true, 62#L101true, 82#true, 68#L46true, 125#(not (= ~x~0 1)), Black: 123#true]) [2025-03-04 15:27:36,318 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-03-04 15:27:36,318 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 15:27:36,318 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 15:27:36,318 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 15:27:36,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-5-->L66: Formula: (and (<= |v_thread3Thread1of1ForFork3_#t~post6#1_5| 2147483646) (= v_~s~0_127 |v_thread3Thread1of1ForFork3_#t~post6#1_5|) (= v_~s~0_126 (+ |v_thread3Thread1of1ForFork3_#t~post6#1_5| 1)) (<= 0 (+ 2147483649 |v_thread3Thread1of1ForFork3_#t~post6#1_5|))) InVars {~s~0=v_~s~0_127} OutVars{thread3Thread1of1ForFork3_#t~post6#1=|v_thread3Thread1of1ForFork3_#t~post6#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~post6#1, ~s~0][88], [17#L66true, 9#L100-1true, 132#(<= ~s~0 2), 18#thread1EXITtrue, Black: 115#(<= ~s~0 1), Black: 100#(<= ~s~0 0), 70#L56-5true, 3#L76-5true, 82#true, 125#(not (= ~x~0 1)), Black: 123#true]) [2025-03-04 15:27:36,319 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-03-04 15:27:36,319 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 15:27:36,319 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 15:27:36,319 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 15:27:36,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-5-->L66: Formula: (and (<= |v_thread3Thread1of1ForFork3_#t~post6#1_5| 2147483646) (= v_~s~0_127 |v_thread3Thread1of1ForFork3_#t~post6#1_5|) (= v_~s~0_126 (+ |v_thread3Thread1of1ForFork3_#t~post6#1_5| 1)) (<= 0 (+ 2147483649 |v_thread3Thread1of1ForFork3_#t~post6#1_5|))) InVars {~s~0=v_~s~0_127} OutVars{thread3Thread1of1ForFork3_#t~post6#1=|v_thread3Thread1of1ForFork3_#t~post6#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~post6#1, ~s~0][88], [17#L66true, 132#(<= ~s~0 2), 18#thread1EXITtrue, Black: 115#(<= ~s~0 1), Black: 100#(<= ~s~0 0), 3#L76-5true, 70#L56-5true, 62#L101true, 82#true, 125#(not (= ~x~0 1)), Black: 123#true]) [2025-03-04 15:27:36,330 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2025-03-04 15:27:36,330 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 15:27:36,330 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 15:27:36,330 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-04 15:27:36,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-5-->L66: Formula: (and (<= |v_thread3Thread1of1ForFork3_#t~post6#1_5| 2147483646) (= v_~s~0_127 |v_thread3Thread1of1ForFork3_#t~post6#1_5|) (= v_~s~0_126 (+ |v_thread3Thread1of1ForFork3_#t~post6#1_5| 1)) (<= 0 (+ 2147483649 |v_thread3Thread1of1ForFork3_#t~post6#1_5|))) InVars {~s~0=v_~s~0_127} OutVars{thread3Thread1of1ForFork3_#t~post6#1=|v_thread3Thread1of1ForFork3_#t~post6#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~post6#1, ~s~0][88], [17#L66true, 132#(<= ~s~0 2), Black: 115#(<= ~s~0 1), Black: 100#(<= ~s~0 0), 70#L56-5true, 3#L76-5true, 82#true, 52#L102true, 125#(not (= ~x~0 1)), Black: 123#true]) [2025-03-04 15:27:36,337 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-04 15:27:36,337 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 15:27:36,337 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-04 15:27:36,337 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2025-03-04 15:27:36,341 INFO L124 PetriNetUnfolderBase]: 13893/19335 cut-off events. [2025-03-04 15:27:36,341 INFO L125 PetriNetUnfolderBase]: For 12900/13422 co-relation queries the response was YES. [2025-03-04 15:27:36,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49618 conditions, 19335 events. 13893/19335 cut-off events. For 12900/13422 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 111452 event pairs, 1682 based on Foata normal form. 352/18889 useless extension candidates. Maximal degree in co-relation 9680. Up to 7613 conditions per place. [2025-03-04 15:27:36,418 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 131 selfloop transitions, 15 changer transitions 4/163 dead transitions. [2025-03-04 15:27:36,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 163 transitions, 867 flow [2025-03-04 15:27:36,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:27:36,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:27:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 196 transitions. [2025-03-04 15:27:36,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.536986301369863 [2025-03-04 15:27:36,420 INFO L175 Difference]: Start difference. First operand has 70 places, 79 transitions, 305 flow. Second operand 5 states and 196 transitions. [2025-03-04 15:27:36,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 163 transitions, 867 flow [2025-03-04 15:27:36,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 163 transitions, 839 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:36,426 INFO L231 Difference]: Finished difference. Result has 73 places, 79 transitions, 335 flow [2025-03-04 15:27:36,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=335, PETRI_PLACES=73, PETRI_TRANSITIONS=79} [2025-03-04 15:27:36,427 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -4 predicate places. [2025-03-04 15:27:36,427 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 79 transitions, 335 flow [2025-03-04 15:27:36,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:36,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:36,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:36,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:27:36,427 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:36,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:36,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1635038059, now seen corresponding path program 1 times [2025-03-04 15:27:36,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:36,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878808113] [2025-03-04 15:27:36,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:36,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:36,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 15:27:36,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:27:36,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:36,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:36,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:36,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:36,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878808113] [2025-03-04 15:27:36,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878808113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:36,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:36,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:27:36,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401043875] [2025-03-04 15:27:36,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:36,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:27:36,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:36,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:27:36,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:27:36,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 73 [2025-03-04 15:27:36,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 79 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:36,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:36,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 73 [2025-03-04 15:27:36,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:37,226 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([495] L45-1-->L46-5: Formula: (= v_~x~0_14 0) InVars {} OutVars{~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x~0][68], [115#(<= ~s~0 1), 9#L100-1true, 42#L76true, Black: 100#(<= ~s~0 0), Black: 132#(<= ~s~0 2), 70#L56-5true, 137#(<= ~s~0 1), 131#(<= ~s~0 1), 64#L46-5true, 13#L66-5true, 82#true, Black: 123#true]) [2025-03-04 15:27:37,226 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2025-03-04 15:27:37,227 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-04 15:27:37,227 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-04 15:27:37,227 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-03-04 15:27:37,270 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([495] L45-1-->L46-5: Formula: (= v_~x~0_14 0) InVars {} OutVars{~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x~0][68], [115#(<= ~s~0 1), 42#L76true, Black: 132#(<= ~s~0 2), Black: 100#(<= ~s~0 0), 137#(<= ~s~0 1), 70#L56-5true, 131#(<= ~s~0 1), 64#L46-5true, 62#L101true, 13#L66-5true, 82#true, Black: 123#true]) [2025-03-04 15:27:37,271 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-03-04 15:27:37,271 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 15:27:37,271 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-04 15:27:37,271 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 15:27:37,272 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([495] L45-1-->L46-5: Formula: (= v_~x~0_14 0) InVars {} OutVars{~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x~0][68], [115#(<= ~s~0 1), 9#L100-1true, Black: 100#(<= ~s~0 0), Black: 132#(<= ~s~0 2), 44#thread4EXITtrue, 137#(<= ~s~0 1), 70#L56-5true, 131#(<= ~s~0 1), 64#L46-5true, 13#L66-5true, 82#true, Black: 123#true]) [2025-03-04 15:27:37,272 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-03-04 15:27:37,272 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-04 15:27:37,272 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 15:27:37,272 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 15:27:37,292 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-5-->L66: Formula: (and (<= |v_thread3Thread1of1ForFork3_#t~post6#1_5| 2147483646) (= v_~s~0_127 |v_thread3Thread1of1ForFork3_#t~post6#1_5|) (= v_~s~0_126 (+ |v_thread3Thread1of1ForFork3_#t~post6#1_5| 1)) (<= 0 (+ 2147483649 |v_thread3Thread1of1ForFork3_#t~post6#1_5|))) InVars {~s~0=v_~s~0_127} OutVars{thread3Thread1of1ForFork3_#t~post6#1=|v_thread3Thread1of1ForFork3_#t~post6#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~post6#1, ~s~0][88], [17#L66true, 9#L100-1true, 132#(<= ~s~0 2), Black: 115#(<= ~s~0 1), Black: 100#(<= ~s~0 0), 70#L56-5true, 138#(<= ~s~0 2), 3#L76-5true, 82#true, 68#L46true, Black: 123#true]) [2025-03-04 15:27:37,292 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-03-04 15:27:37,292 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-04 15:27:37,292 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 15:27:37,292 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 15:27:37,300 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([495] L45-1-->L46-5: Formula: (= v_~x~0_14 0) InVars {} OutVars{~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x~0][68], [115#(<= ~s~0 1), Black: 132#(<= ~s~0 2), Black: 100#(<= ~s~0 0), 44#thread4EXITtrue, 137#(<= ~s~0 1), 70#L56-5true, 131#(<= ~s~0 1), 64#L46-5true, 62#L101true, 13#L66-5true, 82#true, Black: 123#true]) [2025-03-04 15:27:37,300 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-03-04 15:27:37,300 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 15:27:37,300 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 15:27:37,300 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 15:27:37,321 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-5-->L66: Formula: (and (<= |v_thread3Thread1of1ForFork3_#t~post6#1_5| 2147483646) (= v_~s~0_127 |v_thread3Thread1of1ForFork3_#t~post6#1_5|) (= v_~s~0_126 (+ |v_thread3Thread1of1ForFork3_#t~post6#1_5| 1)) (<= 0 (+ 2147483649 |v_thread3Thread1of1ForFork3_#t~post6#1_5|))) InVars {~s~0=v_~s~0_127} OutVars{thread3Thread1of1ForFork3_#t~post6#1=|v_thread3Thread1of1ForFork3_#t~post6#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~post6#1, ~s~0][88], [17#L66true, 132#(<= ~s~0 2), Black: 115#(<= ~s~0 1), Black: 100#(<= ~s~0 0), 70#L56-5true, 3#L76-5true, 138#(<= ~s~0 2), 62#L101true, 82#true, 68#L46true, Black: 123#true]) [2025-03-04 15:27:37,321 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-03-04 15:27:37,321 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 15:27:37,321 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 15:27:37,321 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 15:27:37,322 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-5-->L66: Formula: (and (<= |v_thread3Thread1of1ForFork3_#t~post6#1_5| 2147483646) (= v_~s~0_127 |v_thread3Thread1of1ForFork3_#t~post6#1_5|) (= v_~s~0_126 (+ |v_thread3Thread1of1ForFork3_#t~post6#1_5| 1)) (<= 0 (+ 2147483649 |v_thread3Thread1of1ForFork3_#t~post6#1_5|))) InVars {~s~0=v_~s~0_127} OutVars{thread3Thread1of1ForFork3_#t~post6#1=|v_thread3Thread1of1ForFork3_#t~post6#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~post6#1, ~s~0][88], [17#L66true, 9#L100-1true, 132#(<= ~s~0 2), 18#thread1EXITtrue, Black: 115#(<= ~s~0 1), Black: 100#(<= ~s~0 0), 138#(<= ~s~0 2), 70#L56-5true, 3#L76-5true, 82#true, Black: 123#true]) [2025-03-04 15:27:37,322 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-03-04 15:27:37,322 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 15:27:37,322 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 15:27:37,322 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 15:27:37,331 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-5-->L66: Formula: (and (<= |v_thread3Thread1of1ForFork3_#t~post6#1_5| 2147483646) (= v_~s~0_127 |v_thread3Thread1of1ForFork3_#t~post6#1_5|) (= v_~s~0_126 (+ |v_thread3Thread1of1ForFork3_#t~post6#1_5| 1)) (<= 0 (+ 2147483649 |v_thread3Thread1of1ForFork3_#t~post6#1_5|))) InVars {~s~0=v_~s~0_127} OutVars{thread3Thread1of1ForFork3_#t~post6#1=|v_thread3Thread1of1ForFork3_#t~post6#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~post6#1, ~s~0][88], [17#L66true, 132#(<= ~s~0 2), 18#thread1EXITtrue, Black: 115#(<= ~s~0 1), Black: 100#(<= ~s~0 0), 70#L56-5true, 138#(<= ~s~0 2), 3#L76-5true, 62#L101true, 82#true, Black: 123#true]) [2025-03-04 15:27:37,332 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2025-03-04 15:27:37,332 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-04 15:27:37,332 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 15:27:37,332 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 15:27:37,335 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-5-->L66: Formula: (and (<= |v_thread3Thread1of1ForFork3_#t~post6#1_5| 2147483646) (= v_~s~0_127 |v_thread3Thread1of1ForFork3_#t~post6#1_5|) (= v_~s~0_126 (+ |v_thread3Thread1of1ForFork3_#t~post6#1_5| 1)) (<= 0 (+ 2147483649 |v_thread3Thread1of1ForFork3_#t~post6#1_5|))) InVars {~s~0=v_~s~0_127} OutVars{thread3Thread1of1ForFork3_#t~post6#1=|v_thread3Thread1of1ForFork3_#t~post6#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~post6#1, ~s~0][88], [17#L66true, 132#(<= ~s~0 2), Black: 115#(<= ~s~0 1), Black: 100#(<= ~s~0 0), 138#(<= ~s~0 2), 70#L56-5true, 3#L76-5true, 82#true, 52#L102true, Black: 123#true]) [2025-03-04 15:27:37,335 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-04 15:27:37,335 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2025-03-04 15:27:37,336 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 15:27:37,336 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-04 15:27:37,337 INFO L124 PetriNetUnfolderBase]: 13544/18859 cut-off events. [2025-03-04 15:27:37,337 INFO L125 PetriNetUnfolderBase]: For 21632/22190 co-relation queries the response was YES. [2025-03-04 15:27:37,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51232 conditions, 18859 events. 13544/18859 cut-off events. For 21632/22190 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 109092 event pairs, 1617 based on Foata normal form. 455/18511 useless extension candidates. Maximal degree in co-relation 27111. Up to 7613 conditions per place. [2025-03-04 15:27:37,412 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 0 selfloop transitions, 0 changer transitions 155/155 dead transitions. [2025-03-04 15:27:37,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 155 transitions, 813 flow [2025-03-04 15:27:37,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:27:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:27:37,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 202 transitions. [2025-03-04 15:27:37,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4611872146118721 [2025-03-04 15:27:37,414 INFO L175 Difference]: Start difference. First operand has 73 places, 79 transitions, 335 flow. Second operand 6 states and 202 transitions. [2025-03-04 15:27:37,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 155 transitions, 813 flow [2025-03-04 15:27:37,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 155 transitions, 752 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-04 15:27:37,789 INFO L231 Difference]: Finished difference. Result has 68 places, 0 transitions, 0 flow [2025-03-04 15:27:37,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=68, PETRI_TRANSITIONS=0} [2025-03-04 15:27:37,790 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -9 predicate places. [2025-03-04 15:27:37,790 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 0 transitions, 0 flow [2025-03-04 15:27:37,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:37,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 36 remaining) [2025-03-04 15:27:37,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 36 remaining) [2025-03-04 15:27:37,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 36 remaining) [2025-03-04 15:27:37,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 36 remaining) [2025-03-04 15:27:37,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 36 remaining) [2025-03-04 15:27:37,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 36 remaining) [2025-03-04 15:27:37,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 36 remaining) [2025-03-04 15:27:37,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 36 remaining) [2025-03-04 15:27:37,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 36 remaining) [2025-03-04 15:27:37,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 36 remaining) [2025-03-04 15:27:37,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 36 remaining) [2025-03-04 15:27:37,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 36 remaining) [2025-03-04 15:27:37,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 36 remaining) [2025-03-04 15:27:37,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 36 remaining) [2025-03-04 15:27:37,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 36 remaining) [2025-03-04 15:27:37,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 36 remaining) [2025-03-04 15:27:37,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 36 remaining) [2025-03-04 15:27:37,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 36 remaining) [2025-03-04 15:27:37,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 36 remaining) [2025-03-04 15:27:37,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 36 remaining) [2025-03-04 15:27:37,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 36 remaining) [2025-03-04 15:27:37,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 36 remaining) [2025-03-04 15:27:37,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 36 remaining) [2025-03-04 15:27:37,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 36 remaining) [2025-03-04 15:27:37,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 36 remaining) [2025-03-04 15:27:37,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 36 remaining) [2025-03-04 15:27:37,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 36 remaining) [2025-03-04 15:27:37,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 36 remaining) [2025-03-04 15:27:37,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 36 remaining) [2025-03-04 15:27:37,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 36 remaining) [2025-03-04 15:27:37,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 36 remaining) [2025-03-04 15:27:37,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 36 remaining) [2025-03-04 15:27:37,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 36 remaining) [2025-03-04 15:27:37,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 36 remaining) [2025-03-04 15:27:37,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 36 remaining) [2025-03-04 15:27:37,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 36 remaining) [2025-03-04 15:27:37,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:27:37,794 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:37,798 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:27:37,798 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:27:37,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:27:37 BasicIcfg [2025-03-04 15:27:37,802 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:27:37,802 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:27:37,802 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:27:37,803 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:27:37,803 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:27:12" (3/4) ... [2025-03-04 15:27:37,804 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:27:37,806 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 15:27:37,806 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 15:27:37,806 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 15:27:37,806 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-03-04 15:27:37,808 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2025-03-04 15:27:37,808 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-04 15:27:37,808 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-04 15:27:37,808 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 15:27:37,856 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:27:37,857 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:27:37,857 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:27:37,857 INFO L158 Benchmark]: Toolchain (without parser) took 25640.91ms. Allocated memory was 167.8MB in the beginning and 11.2GB in the end (delta: 11.0GB). Free memory was 124.1MB in the beginning and 9.0GB in the end (delta: -8.9GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2025-03-04 15:27:37,857 INFO L158 Benchmark]: CDTParser took 0.90ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:27:37,858 INFO L158 Benchmark]: CACSL2BoogieTranslator took 145.42ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 112.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:27:37,858 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.76ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 111.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:27:37,858 INFO L158 Benchmark]: Boogie Preprocessor took 27.89ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:27:37,858 INFO L158 Benchmark]: IcfgBuilder took 535.59ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 69.1MB in the end (delta: 40.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 15:27:37,858 INFO L158 Benchmark]: TraceAbstraction took 24852.54ms. Allocated memory was 167.8MB in the beginning and 11.2GB in the end (delta: 11.0GB). Free memory was 68.3MB in the beginning and 9.0GB in the end (delta: -9.0GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2025-03-04 15:27:37,858 INFO L158 Benchmark]: Witness Printer took 54.25ms. Allocated memory is still 11.2GB. Free memory was 9.0GB in the beginning and 9.0GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:27:37,859 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.90ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 145.42ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 112.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.76ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 111.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.89ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 535.59ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 69.1MB in the end (delta: 40.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 24852.54ms. Allocated memory was 167.8MB in the beginning and 11.2GB in the end (delta: 11.0GB). Free memory was 68.3MB in the beginning and 9.0GB in the end (delta: -9.0GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Witness Printer took 54.25ms. Allocated memory is still 11.2GB. Free memory was 9.0GB in the beginning and 9.0GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 123 locations, 36 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 23.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 664 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 654 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1294 IncrementalHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 6 mSDtfsCounter, 1294 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=7, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 464 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:27:37,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE