./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-difference-det.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-difference-det.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74892b4fb04a6fe0e809c110df08d9da57c5c90ea65da5b04a32432686fc90f8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:11:24,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:11:24,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 14:11:24,722 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:11:24,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:11:24,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:11:24,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:11:24,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:11:24,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:11:24,744 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:11:24,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:11:24,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:11:24,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:11:24,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:11:24,746 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:11:24,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:11:24,746 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:11:24,746 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:11:24,746 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:11:24,746 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:11:24,746 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:11:24,746 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:11:24,747 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:11:24,747 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:11:24,747 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:11:24,747 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:11:24,747 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:11:24,747 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:11:24,747 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:11:24,747 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:11:24,747 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:11:24,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:11:24,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:11:24,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:11:24,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:11:24,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:11:24,748 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:11:24,748 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:11:24,748 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:11:24,748 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:11:24,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:11:24,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:11:24,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:11:24,748 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:11:24,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:11:24,749 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 74892b4fb04a6fe0e809c110df08d9da57c5c90ea65da5b04a32432686fc90f8 [2025-02-08 14:11:24,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:11:24,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:11:24,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:11:24,959 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:11:24,959 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:11:24,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-difference-det.wvr.c [2025-02-08 14:11:26,083 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05515fd5f/63ad90bf607e4491847098aea5f8c7f8/FLAGcd7177f32 [2025-02-08 14:11:26,303 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:11:26,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-difference-det.wvr.c [2025-02-08 14:11:26,309 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05515fd5f/63ad90bf607e4491847098aea5f8c7f8/FLAGcd7177f32 [2025-02-08 14:11:26,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05515fd5f/63ad90bf607e4491847098aea5f8c7f8 [2025-02-08 14:11:26,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:11:26,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:11:26,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:11:26,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:11:26,669 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:11:26,670 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:11:26" (1/1) ... [2025-02-08 14:11:26,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@486eb593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:26, skipping insertion in model container [2025-02-08 14:11:26,671 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:11:26" (1/1) ... [2025-02-08 14:11:26,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:11:26,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:11:26,819 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:11:26,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:11:26,856 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:11:26,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:26 WrapperNode [2025-02-08 14:11:26,857 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:11:26,858 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:11:26,858 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:11:26,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:11:26,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:26" (1/1) ... [2025-02-08 14:11:26,873 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:26" (1/1) ... [2025-02-08 14:11:26,891 INFO L138 Inliner]: procedures = 20, calls = 14, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 103 [2025-02-08 14:11:26,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:11:26,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:11:26,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:11:26,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:11:26,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:26" (1/1) ... [2025-02-08 14:11:26,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:26" (1/1) ... [2025-02-08 14:11:26,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:26" (1/1) ... [2025-02-08 14:11:26,916 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 14:11:26,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:26" (1/1) ... [2025-02-08 14:11:26,916 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:26" (1/1) ... [2025-02-08 14:11:26,921 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:26" (1/1) ... [2025-02-08 14:11:26,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:26" (1/1) ... [2025-02-08 14:11:26,922 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:26" (1/1) ... [2025-02-08 14:11:26,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:26" (1/1) ... [2025-02-08 14:11:26,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:11:26,925 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:11:26,925 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:11:26,925 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:11:26,925 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:26" (1/1) ... [2025-02-08 14:11:26,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:11:26,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:11:26,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 14:11:26,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 14:11:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:11:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 14:11:26,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 14:11:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 14:11:26,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 14:11:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 14:11:26,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 14:11:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 14:11:26,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 14:11:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:11:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:11:26,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:11:26,968 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 14:11:27,033 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:11:27,035 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:11:27,231 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:11:27,235 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:11:27,347 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:11:27,349 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:11:27,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:11:27 BoogieIcfgContainer [2025-02-08 14:11:27,350 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:11:27,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:11:27,352 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:11:27,355 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:11:27,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:11:26" (1/3) ... [2025-02-08 14:11:27,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2264be57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:11:27, skipping insertion in model container [2025-02-08 14:11:27,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:26" (2/3) ... [2025-02-08 14:11:27,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2264be57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:11:27, skipping insertion in model container [2025-02-08 14:11:27,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:11:27" (3/3) ... [2025-02-08 14:11:27,358 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-difference-det.wvr.c [2025-02-08 14:11:27,370 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:11:27,371 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-difference-det.wvr.c that has 5 procedures, 59 locations, 1 initial locations, 4 loop locations, and 16 error locations. [2025-02-08 14:11:27,371 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:11:27,432 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 14:11:27,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 152 flow [2025-02-08 14:11:27,486 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2025-02-08 14:11:27,487 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 14:11:27,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 58 events. 4/58 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 174 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2025-02-08 14:11:27,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 62 transitions, 152 flow [2025-02-08 14:11:27,493 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 56 transitions, 133 flow [2025-02-08 14:11:27,498 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:11:27,508 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;@7df255ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:11:27,508 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-02-08 14:11:27,511 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:11:27,511 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-02-08 14:11:27,511 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:11:27,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:27,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:11:27,512 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-08 14:11:27,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:27,516 INFO L85 PathProgramCache]: Analyzing trace with hash 351108804, now seen corresponding path program 1 times [2025-02-08 14:11:27,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:27,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140719017] [2025-02-08 14:11:27,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:27,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:27,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:11:27,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:11:27,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:27,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:27,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:27,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:27,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140719017] [2025-02-08 14:11:27,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140719017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:27,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:27,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:11:27,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529888008] [2025-02-08 14:11:27,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:27,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:11:27,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:27,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:11:27,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:11:27,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-02-08 14:11:27,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:27,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:27,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-02-08 14:11:27,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:30,108 INFO L124 PetriNetUnfolderBase]: 26633/39270 cut-off events. [2025-02-08 14:11:30,109 INFO L125 PetriNetUnfolderBase]: For 1954/1954 co-relation queries the response was YES. [2025-02-08 14:11:30,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75644 conditions, 39270 events. 26633/39270 cut-off events. For 1954/1954 co-relation queries the response was YES. Maximal size of possible extension queue 1882. Compared 287176 event pairs, 6878 based on Foata normal form. 0/28358 useless extension candidates. Maximal degree in co-relation 69273. Up to 29555 conditions per place. [2025-02-08 14:11:30,414 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 69 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2025-02-08 14:11:30,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 85 transitions, 351 flow [2025-02-08 14:11:30,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:11:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:11:30,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-02-08 14:11:30,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6881720430107527 [2025-02-08 14:11:30,428 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 133 flow. Second operand 3 states and 128 transitions. [2025-02-08 14:11:30,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 85 transitions, 351 flow [2025-02-08 14:11:30,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 85 transitions, 327 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 14:11:30,456 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 136 flow [2025-02-08 14:11:30,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2025-02-08 14:11:30,463 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -4 predicate places. [2025-02-08 14:11:30,464 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 136 flow [2025-02-08 14:11:30,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:30,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:30,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:30,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:11:30,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-08 14:11:30,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:30,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1886842360, now seen corresponding path program 1 times [2025-02-08 14:11:30,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:30,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547250511] [2025-02-08 14:11:30,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:30,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:30,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:11:30,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:11:30,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:30,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:30,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:30,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:30,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547250511] [2025-02-08 14:11:30,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547250511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:30,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:30,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:11:30,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010750769] [2025-02-08 14:11:30,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:30,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:30,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:30,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:30,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:30,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-02-08 14:11:30,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 136 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-02-08 14:11:30,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:30,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-02-08 14:11:30,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:33,073 INFO L124 PetriNetUnfolderBase]: 40657/59827 cut-off events. [2025-02-08 14:11:33,073 INFO L125 PetriNetUnfolderBase]: For 3180/3180 co-relation queries the response was YES. [2025-02-08 14:11:33,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119187 conditions, 59827 events. 40657/59827 cut-off events. For 3180/3180 co-relation queries the response was YES. Maximal size of possible extension queue 2731. Compared 448435 event pairs, 23154 based on Foata normal form. 1026/45634 useless extension candidates. Maximal degree in co-relation 53067. Up to 42823 conditions per place. [2025-02-08 14:11:33,383 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 104 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2025-02-08 14:11:33,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 120 transitions, 490 flow [2025-02-08 14:11:33,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:33,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2025-02-08 14:11:33,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7016129032258065 [2025-02-08 14:11:33,389 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 136 flow. Second operand 4 states and 174 transitions. [2025-02-08 14:11:33,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 120 transitions, 490 flow [2025-02-08 14:11:33,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 120 transitions, 488 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:11:33,395 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 163 flow [2025-02-08 14:11:33,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2025-02-08 14:11:33,395 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 0 predicate places. [2025-02-08 14:11:33,396 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 163 flow [2025-02-08 14:11:33,396 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-02-08 14:11:33,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:33,397 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:33,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:11:33,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-08 14:11:33,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:33,398 INFO L85 PathProgramCache]: Analyzing trace with hash 858025072, now seen corresponding path program 1 times [2025-02-08 14:11:33,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:33,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702133397] [2025-02-08 14:11:33,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:33,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:33,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:11:33,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:11:33,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:33,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:33,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:33,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702133397] [2025-02-08 14:11:33,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702133397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:33,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:33,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:11:33,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957826029] [2025-02-08 14:11:33,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:33,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:11:33,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:33,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:11:33,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:11:33,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-02-08 14:11:33,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:33,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:33,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-02-08 14:11:33,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:35,430 INFO L124 PetriNetUnfolderBase]: 34577/51753 cut-off events. [2025-02-08 14:11:35,431 INFO L125 PetriNetUnfolderBase]: For 12388/14116 co-relation queries the response was YES. [2025-02-08 14:11:35,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112209 conditions, 51753 events. 34577/51753 cut-off events. For 12388/14116 co-relation queries the response was YES. Maximal size of possible extension queue 1963. Compared 380962 event pairs, 8936 based on Foata normal form. 0/39815 useless extension candidates. Maximal degree in co-relation 56052. Up to 37724 conditions per place. [2025-02-08 14:11:35,714 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 72 selfloop transitions, 2 changer transitions 1/89 dead transitions. [2025-02-08 14:11:35,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 405 flow [2025-02-08 14:11:35,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:11:35,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:11:35,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2025-02-08 14:11:35,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-08 14:11:35,715 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 163 flow. Second operand 3 states and 124 transitions. [2025-02-08 14:11:35,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 405 flow [2025-02-08 14:11:35,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 89 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:11:35,729 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 176 flow [2025-02-08 14:11:35,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2025-02-08 14:11:35,730 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 2 predicate places. [2025-02-08 14:11:35,730 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 176 flow [2025-02-08 14:11:35,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:35,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:35,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:35,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:11:35,731 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-08 14:11:35,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:35,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1856203440, now seen corresponding path program 1 times [2025-02-08 14:11:35,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:35,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226111523] [2025-02-08 14:11:35,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:35,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:35,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:11:35,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:11:35,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:35,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:35,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:35,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226111523] [2025-02-08 14:11:35,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226111523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:35,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:35,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:11:35,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110101375] [2025-02-08 14:11:35,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:35,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:11:35,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:35,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:11:35,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:11:35,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-02-08 14:11:35,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:35,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:35,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-02-08 14:11:35,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:37,999 INFO L124 PetriNetUnfolderBase]: 31801/47514 cut-off events. [2025-02-08 14:11:37,999 INFO L125 PetriNetUnfolderBase]: For 12733/13661 co-relation queries the response was YES. [2025-02-08 14:11:38,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108125 conditions, 47514 events. 31801/47514 cut-off events. For 12733/13661 co-relation queries the response was YES. Maximal size of possible extension queue 1783. Compared 349516 event pairs, 19145 based on Foata normal form. 0/38679 useless extension candidates. Maximal degree in co-relation 50342. Up to 29306 conditions per place. [2025-02-08 14:11:38,219 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 79 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2025-02-08 14:11:38,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 96 transitions, 444 flow [2025-02-08 14:11:38,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:11:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:11:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2025-02-08 14:11:38,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6989247311827957 [2025-02-08 14:11:38,220 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 176 flow. Second operand 3 states and 130 transitions. [2025-02-08 14:11:38,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 96 transitions, 444 flow [2025-02-08 14:11:38,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 96 transitions, 441 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:11:38,240 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 198 flow [2025-02-08 14:11:38,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2025-02-08 14:11:38,241 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 4 predicate places. [2025-02-08 14:11:38,241 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 198 flow [2025-02-08 14:11:38,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:38,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:38,241 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:38,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:11:38,241 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-08 14:11:38,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:38,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1856203441, now seen corresponding path program 1 times [2025-02-08 14:11:38,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:38,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884738030] [2025-02-08 14:11:38,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:38,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:38,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:11:38,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:11:38,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:38,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:38,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:38,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884738030] [2025-02-08 14:11:38,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884738030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:38,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:38,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:11:38,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607867523] [2025-02-08 14:11:38,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:38,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:38,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:38,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:38,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:38,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-02-08 14:11:38,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:38,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:38,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-02-08 14:11:38,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:40,776 INFO L124 PetriNetUnfolderBase]: 37799/56542 cut-off events. [2025-02-08 14:11:40,776 INFO L125 PetriNetUnfolderBase]: For 31719/31853 co-relation queries the response was YES. [2025-02-08 14:11:40,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137236 conditions, 56542 events. 37799/56542 cut-off events. For 31719/31853 co-relation queries the response was YES. Maximal size of possible extension queue 1778. Compared 417265 event pairs, 5739 based on Foata normal form. 1533/51839 useless extension candidates. Maximal degree in co-relation 68035. Up to 24870 conditions per place. [2025-02-08 14:11:41,121 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 107 selfloop transitions, 4 changer transitions 0/125 dead transitions. [2025-02-08 14:11:41,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 125 transitions, 598 flow [2025-02-08 14:11:41,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:41,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2025-02-08 14:11:41,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7258064516129032 [2025-02-08 14:11:41,122 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 198 flow. Second operand 4 states and 180 transitions. [2025-02-08 14:11:41,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 125 transitions, 598 flow [2025-02-08 14:11:41,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 125 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:11:41,286 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 226 flow [2025-02-08 14:11:41,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2025-02-08 14:11:41,287 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 7 predicate places. [2025-02-08 14:11:41,287 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 226 flow [2025-02-08 14:11:41,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:41,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:41,287 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:41,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:11:41,287 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-08 14:11:41,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:41,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1611552677, now seen corresponding path program 1 times [2025-02-08 14:11:41,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:41,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215865667] [2025-02-08 14:11:41,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:41,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:41,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:11:41,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:11:41,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:41,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:41,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:41,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:41,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215865667] [2025-02-08 14:11:41,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215865667] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:11:41,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553953890] [2025-02-08 14:11:41,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:41,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:41,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:11:41,329 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:11:41,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 14:11:41,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:11:41,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:11:41,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:41,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:41,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:11:41,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:11:41,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:41,413 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:11:41,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553953890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:41,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:11:41,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2025-02-08 14:11:41,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034704422] [2025-02-08 14:11:41,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:41,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:11:41,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:41,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:11:41,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:11:41,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-02-08 14:11:41,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:41,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:41,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-02-08 14:11:41,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:43,671 INFO L124 PetriNetUnfolderBase]: 34553/52546 cut-off events. [2025-02-08 14:11:43,671 INFO L125 PetriNetUnfolderBase]: For 42264/43106 co-relation queries the response was YES. [2025-02-08 14:11:43,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125865 conditions, 52546 events. 34553/52546 cut-off events. For 42264/43106 co-relation queries the response was YES. Maximal size of possible extension queue 1603. Compared 392301 event pairs, 29596 based on Foata normal form. 1344/47169 useless extension candidates. Maximal degree in co-relation 54267. Up to 45342 conditions per place. [2025-02-08 14:11:43,933 INFO L140 encePairwiseOnDemand]: 60/62 looper letters, 47 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2025-02-08 14:11:43,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 62 transitions, 304 flow [2025-02-08 14:11:43,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:11:43,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:11:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-02-08 14:11:43,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.510752688172043 [2025-02-08 14:11:43,935 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 226 flow. Second operand 3 states and 95 transitions. [2025-02-08 14:11:43,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 62 transitions, 304 flow [2025-02-08 14:11:43,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 62 transitions, 298 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:11:43,955 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 204 flow [2025-02-08 14:11:43,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2025-02-08 14:11:43,955 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 5 predicate places. [2025-02-08 14:11:43,955 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 204 flow [2025-02-08 14:11:43,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:43,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:43,956 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:43,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 14:11:44,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:44,156 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-08 14:11:44,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:44,157 INFO L85 PathProgramCache]: Analyzing trace with hash -71612556, now seen corresponding path program 1 times [2025-02-08 14:11:44,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:44,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549625246] [2025-02-08 14:11:44,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:44,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:44,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:11:44,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:11:44,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:44,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:44,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:44,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:44,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549625246] [2025-02-08 14:11:44,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549625246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:44,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:44,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:11:44,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174399975] [2025-02-08 14:11:44,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:44,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:44,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:44,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:44,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:44,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-02-08 14:11:44,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:44,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:44,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-02-08 14:11:44,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:47,698 INFO L124 PetriNetUnfolderBase]: 53601/78304 cut-off events. [2025-02-08 14:11:47,698 INFO L125 PetriNetUnfolderBase]: For 42862/44256 co-relation queries the response was YES. [2025-02-08 14:11:47,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187236 conditions, 78304 events. 53601/78304 cut-off events. For 42862/44256 co-relation queries the response was YES. Maximal size of possible extension queue 2247. Compared 569524 event pairs, 30660 based on Foata normal form. 1448/71286 useless extension candidates. Maximal degree in co-relation 187222. Up to 56061 conditions per place. [2025-02-08 14:11:48,103 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 115 selfloop transitions, 4 changer transitions 0/131 dead transitions. [2025-02-08 14:11:48,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 131 transitions, 696 flow [2025-02-08 14:11:48,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2025-02-08 14:11:48,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6612903225806451 [2025-02-08 14:11:48,104 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 204 flow. Second operand 4 states and 164 transitions. [2025-02-08 14:11:48,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 131 transitions, 696 flow [2025-02-08 14:11:48,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 131 transitions, 695 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:11:48,131 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 232 flow [2025-02-08 14:11:48,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2025-02-08 14:11:48,131 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 9 predicate places. [2025-02-08 14:11:48,132 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 232 flow [2025-02-08 14:11:48,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:48,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:48,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:48,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:11:48,132 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-08 14:11:48,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:48,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1400091732, now seen corresponding path program 1 times [2025-02-08 14:11:48,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:48,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366031651] [2025-02-08 14:11:48,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:48,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:48,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:11:48,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:11:48,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:48,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:48,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:48,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366031651] [2025-02-08 14:11:48,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366031651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:48,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:48,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:11:48,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622639803] [2025-02-08 14:11:48,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:48,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:48,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:48,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:48,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:48,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-02-08 14:11:48,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 232 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:48,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:48,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-02-08 14:11:48,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:54,491 INFO L124 PetriNetUnfolderBase]: 84106/122381 cut-off events. [2025-02-08 14:11:54,492 INFO L125 PetriNetUnfolderBase]: For 85445/90719 co-relation queries the response was YES. [2025-02-08 14:11:54,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318324 conditions, 122381 events. 84106/122381 cut-off events. For 85445/90719 co-relation queries the response was YES. Maximal size of possible extension queue 3297. Compared 926630 event pairs, 46265 based on Foata normal form. 1846/111038 useless extension candidates. Maximal degree in co-relation 318308. Up to 72801 conditions per place. [2025-02-08 14:11:55,389 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 126 selfloop transitions, 4 changer transitions 0/142 dead transitions. [2025-02-08 14:11:55,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 142 transitions, 790 flow [2025-02-08 14:11:55,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:55,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:55,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2025-02-08 14:11:55,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6733870967741935 [2025-02-08 14:11:55,390 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 232 flow. Second operand 4 states and 167 transitions. [2025-02-08 14:11:55,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 142 transitions, 790 flow [2025-02-08 14:11:55,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 142 transitions, 781 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:11:55,450 INFO L231 Difference]: Finished difference. Result has 78 places, 68 transitions, 258 flow [2025-02-08 14:11:55,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=78, PETRI_TRANSITIONS=68} [2025-02-08 14:11:55,450 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 13 predicate places. [2025-02-08 14:11:55,450 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 68 transitions, 258 flow [2025-02-08 14:11:55,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:55,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:55,451 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:55,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:11:55,451 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-02-08 14:11:55,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:55,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1781057879, now seen corresponding path program 1 times [2025-02-08 14:11:55,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:55,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069419491] [2025-02-08 14:11:55,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:55,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:55,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:11:55,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:11:55,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:55,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:55,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:55,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069419491] [2025-02-08 14:11:55,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069419491] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:11:55,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176850698] [2025-02-08 14:11:55,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:55,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:55,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:11:55,507 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:11:55,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 14:11:55,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:11:55,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:11:55,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:55,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:55,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:11:55,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:11:55,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:55,567 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:11:55,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176850698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:55,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:11:55,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-08 14:11:55,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957301828] [2025-02-08 14:11:55,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:55,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:11:55,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:55,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:11:55,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:11:55,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-02-08 14:11:55,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 258 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:55,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:55,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-02-08 14:11:55,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand