./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-time-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-time-trans.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 ef62179d17d90afe74c7b4fe8189ca3bb011e55daf3a169b42e4b3589691fc53 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:49:40,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:49:40,806 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:49:40,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:49:40,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:49:40,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:49:40,835 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:49:40,835 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:49:40,836 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:49:40,836 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:49:40,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:49:40,836 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:49:40,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:49:40,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:49:40,837 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:49:40,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:49:40,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:49:40,838 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:49:40,838 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:49:40,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:49:40,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:49:40,838 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:49:40,838 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:49:40,838 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:49:40,838 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:49:40,838 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:49:40,838 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:49:40,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:49:40,838 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:49:40,839 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:49:40,839 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:49:40,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:49:40,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:49:40,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:49:40,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:49:40,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:49:40,839 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:49:40,839 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:49:40,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:49:40,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:49:40,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:49:40,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:49:40,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:49:40,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:49:40,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:49:40,840 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 -> ef62179d17d90afe74c7b4fe8189ca3bb011e55daf3a169b42e4b3589691fc53 [2025-02-06 18:49:41,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:49:41,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:49:41,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:49:41,078 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:49:41,078 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:49:41,080 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-time-trans.wvr.c [2025-02-06 18:49:41,584 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61e69a066/199027fcce034b0fa85af8f0ed1429f0/FLAG6a7a41530 [2025-02-06 18:49:43,213 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:49:43,214 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-time-trans.wvr.c [2025-02-06 18:49:43,220 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61e69a066/199027fcce034b0fa85af8f0ed1429f0/FLAG6a7a41530 [2025-02-06 18:49:43,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61e69a066/199027fcce034b0fa85af8f0ed1429f0 [2025-02-06 18:49:43,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:49:43,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:49:43,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:49:43,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:49:43,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:49:43,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:49:43" (1/1) ... [2025-02-06 18:49:43,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ec358b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:43, skipping insertion in model container [2025-02-06 18:49:43,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:49:43" (1/1) ... [2025-02-06 18:49:43,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:49:43,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:49:43,694 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:49:43,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:49:43,718 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:49:43,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:43 WrapperNode [2025-02-06 18:49:43,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:49:43,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:49:43,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:49:43,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:49:43,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:43" (1/1) ... [2025-02-06 18:49:43,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:43" (1/1) ... [2025-02-06 18:49:43,764 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 12, calls inlined = 22, statements flattened = 293 [2025-02-06 18:49:43,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:49:43,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:49:43,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:49:43,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:49:43,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:43" (1/1) ... [2025-02-06 18:49:43,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:43" (1/1) ... [2025-02-06 18:49:43,777 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:43" (1/1) ... [2025-02-06 18:49:43,795 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 18:49:43,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:43" (1/1) ... [2025-02-06 18:49:43,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:43" (1/1) ... [2025-02-06 18:49:43,804 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:43" (1/1) ... [2025-02-06 18:49:43,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:43" (1/1) ... [2025-02-06 18:49:43,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:43" (1/1) ... [2025-02-06 18:49:43,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:43" (1/1) ... [2025-02-06 18:49:43,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:49:43,811 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:49:43,814 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:49:43,814 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:49:43,815 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:43" (1/1) ... [2025-02-06 18:49:43,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:49:43,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:49:43,847 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:49:43,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:49:43,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:49:43,868 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 18:49:43,868 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 18:49:43,868 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 18:49:43,868 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 18:49:43,868 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 18:49:43,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 18:49:43,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:49:43,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 18:49:43,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 18:49:43,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:49:43,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:49:43,870 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 18:49:43,955 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:49:43,957 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:49:44,363 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:49:44,364 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:49:44,947 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:49:44,948 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:49:44,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:49:44 BoogieIcfgContainer [2025-02-06 18:49:44,948 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:49:44,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:49:44,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:49:44,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:49:44,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:49:43" (1/3) ... [2025-02-06 18:49:44,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfb5b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:49:44, skipping insertion in model container [2025-02-06 18:49:44,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:43" (2/3) ... [2025-02-06 18:49:44,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfb5b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:49:44, skipping insertion in model container [2025-02-06 18:49:44,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:49:44" (3/3) ... [2025-02-06 18:49:44,955 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-time-trans.wvr.c [2025-02-06 18:49:44,966 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:49:44,967 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-time-trans.wvr.c that has 4 procedures, 60 locations, 1 initial locations, 0 loop locations, and 36 error locations. [2025-02-06 18:49:44,967 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:49:45,117 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 18:49:45,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 59 transitions, 139 flow [2025-02-06 18:49:45,167 INFO L124 PetriNetUnfolderBase]: 0/56 cut-off events. [2025-02-06 18:49:45,169 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 18:49:45,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 56 events. 0/56 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 222 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-02-06 18:49:45,171 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 59 transitions, 139 flow [2025-02-06 18:49:45,173 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 54 transitions, 123 flow [2025-02-06 18:49:45,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:49:45,185 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;@77d3415f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:49:45,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2025-02-06 18:49:45,188 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:49:45,188 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 18:49:45,188 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:49:45,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:45,189 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:49:45,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:49:45,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:45,193 INFO L85 PathProgramCache]: Analyzing trace with hash 30620536, now seen corresponding path program 1 times [2025-02-06 18:49:45,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:45,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082434140] [2025-02-06 18:49:45,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:45,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:45,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:49:45,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:49:45,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:45,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:45,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:45,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082434140] [2025-02-06 18:49:45,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082434140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:45,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:45,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:49:45,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945266295] [2025-02-06 18:49:45,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:45,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 18:49:45,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:45,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 18:49:45,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 18:49:45,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 59 [2025-02-06 18:49:45,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 123 flow. Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:45,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:45,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 59 [2025-02-06 18:49:45,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:47,386 INFO L124 PetriNetUnfolderBase]: 6620/9800 cut-off events. [2025-02-06 18:49:47,386 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-02-06 18:49:47,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19882 conditions, 9800 events. 6620/9800 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 1884. Compared 72913 event pairs, 6620 based on Foata normal form. 0/3428 useless extension candidates. Maximal degree in co-relation 19015. Up to 9680 conditions per place. [2025-02-06 18:49:47,449 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 39 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2025-02-06 18:49:47,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 177 flow [2025-02-06 18:49:47,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 18:49:47,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 18:49:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2025-02-06 18:49:47,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5338983050847458 [2025-02-06 18:49:47,460 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 123 flow. Second operand 2 states and 63 transitions. [2025-02-06 18:49:47,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 177 flow [2025-02-06 18:49:47,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 18:49:47,473 INFO L231 Difference]: Finished difference. Result has 48 places, 42 transitions, 90 flow [2025-02-06 18:49:47,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2025-02-06 18:49:47,477 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -16 predicate places. [2025-02-06 18:49:47,477 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 90 flow [2025-02-06 18:49:47,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:47,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:47,478 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:49:47,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:49:47,478 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:49:47,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:47,479 INFO L85 PathProgramCache]: Analyzing trace with hash 30620546, now seen corresponding path program 1 times [2025-02-06 18:49:47,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:47,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172204574] [2025-02-06 18:49:47,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:47,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:47,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:49:47,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:49:47,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:47,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:47,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:47,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172204574] [2025-02-06 18:49:47,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172204574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:47,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:47,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:49:47,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588461330] [2025-02-06 18:49:47,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:47,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:49:47,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:47,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:49:47,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:49:47,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 59 [2025-02-06 18:49:47,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:47,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:47,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 59 [2025-02-06 18:49:47,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:48,577 INFO L124 PetriNetUnfolderBase]: 5485/8156 cut-off events. [2025-02-06 18:49:48,578 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-06 18:49:48,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16436 conditions, 8156 events. 5485/8156 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 1527. Compared 59765 event pairs, 5485 based on Foata normal form. 0/2973 useless extension candidates. Maximal degree in co-relation 16433. Up to 8046 conditions per place. [2025-02-06 18:49:48,705 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 36 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2025-02-06 18:49:48,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 160 flow [2025-02-06 18:49:48,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:49:48,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:49:48,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-02-06 18:49:48,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3220338983050847 [2025-02-06 18:49:48,707 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 90 flow. Second operand 3 states and 57 transitions. [2025-02-06 18:49:48,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 160 flow [2025-02-06 18:49:48,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:49:48,710 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 88 flow [2025-02-06 18:49:48,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2025-02-06 18:49:48,711 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -16 predicate places. [2025-02-06 18:49:48,711 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 88 flow [2025-02-06 18:49:48,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:48,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:48,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:49:48,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 18:49:48,712 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:49:48,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:48,715 INFO L85 PathProgramCache]: Analyzing trace with hash 30620547, now seen corresponding path program 1 times [2025-02-06 18:49:48,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:48,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076392921] [2025-02-06 18:49:48,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:48,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:48,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:49:48,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:49:48,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:48,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:48,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:48,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:48,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076392921] [2025-02-06 18:49:48,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076392921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:48,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:48,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:49:48,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553317605] [2025-02-06 18:49:48,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:48,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:49:48,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:48,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:49:48,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:49:48,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 59 [2025-02-06 18:49:48,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:48,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:48,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 59 [2025-02-06 18:49:48,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:49,684 INFO L124 PetriNetUnfolderBase]: 4456/6662 cut-off events. [2025-02-06 18:49:49,684 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-06 18:49:49,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13438 conditions, 6662 events. 4456/6662 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 1209. Compared 47812 event pairs, 4456 based on Foata normal form. 0/2548 useless extension candidates. Maximal degree in co-relation 13434. Up to 6563 conditions per place. [2025-02-06 18:49:49,708 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 34 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2025-02-06 18:49:49,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 38 transitions, 154 flow [2025-02-06 18:49:49,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:49:49,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:49:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-02-06 18:49:49,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3107344632768362 [2025-02-06 18:49:49,710 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 88 flow. Second operand 3 states and 55 transitions. [2025-02-06 18:49:49,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 38 transitions, 154 flow [2025-02-06 18:49:49,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:49,711 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 85 flow [2025-02-06 18:49:49,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2025-02-06 18:49:49,712 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -17 predicate places. [2025-02-06 18:49:49,712 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 85 flow [2025-02-06 18:49:49,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:49,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:49,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:49:49,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:49:49,712 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:49:49,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:49,713 INFO L85 PathProgramCache]: Analyzing trace with hash 30620537, now seen corresponding path program 1 times [2025-02-06 18:49:49,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:49,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864397194] [2025-02-06 18:49:49,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:49,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:49,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:49:49,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:49:49,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:49,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:49,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:49,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:49,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864397194] [2025-02-06 18:49:49,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864397194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:49,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:49,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:49:49,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398141316] [2025-02-06 18:49:49,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:49,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:49:49,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:49,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:49:49,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:49:49,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 59 [2025-02-06 18:49:49,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:49,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:49,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 59 [2025-02-06 18:49:49,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:50,587 INFO L124 PetriNetUnfolderBase]: 3584/5380 cut-off events. [2025-02-06 18:49:50,587 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 18:49:50,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10855 conditions, 5380 events. 3584/5380 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 956. Compared 37522 event pairs, 3584 based on Foata normal form. 0/2152 useless extension candidates. Maximal degree in co-relation 10851. Up to 5300 conditions per place. [2025-02-06 18:49:50,599 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 32 selfloop transitions, 1 changer transitions 0/36 dead transitions. [2025-02-06 18:49:50,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 147 flow [2025-02-06 18:49:50,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:49:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:49:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-02-06 18:49:50,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2994350282485876 [2025-02-06 18:49:50,600 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 53 transitions. [2025-02-06 18:49:50,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 147 flow [2025-02-06 18:49:50,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:50,601 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2025-02-06 18:49:50,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-02-06 18:49:50,602 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -18 predicate places. [2025-02-06 18:49:50,602 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2025-02-06 18:49:50,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:50,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:50,602 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:49:50,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:49:50,602 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:49:50,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:50,603 INFO L85 PathProgramCache]: Analyzing trace with hash 30620538, now seen corresponding path program 1 times [2025-02-06 18:49:50,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:50,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239331021] [2025-02-06 18:49:50,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:50,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:50,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:49:50,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:49:50,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:50,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:50,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:50,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:50,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239331021] [2025-02-06 18:49:50,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239331021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:50,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:50,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:49:50,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534772601] [2025-02-06 18:49:50,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:50,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:49:50,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:50,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:49:50,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:49:50,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 59 [2025-02-06 18:49:50,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:50,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:50,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 59 [2025-02-06 18:49:50,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:51,022 INFO L124 PetriNetUnfolderBase]: 2806/4234 cut-off events. [2025-02-06 18:49:51,023 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-06 18:49:51,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8546 conditions, 4234 events. 2806/4234 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 28784 event pairs, 2806 based on Foata normal form. 0/1788 useless extension candidates. Maximal degree in co-relation 8542. Up to 4171 conditions per place. [2025-02-06 18:49:51,035 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 30 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2025-02-06 18:49:51,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 34 transitions, 140 flow [2025-02-06 18:49:51,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:49:51,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:49:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-02-06 18:49:51,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.288135593220339 [2025-02-06 18:49:51,037 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 51 transitions. [2025-02-06 18:49:51,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 34 transitions, 140 flow [2025-02-06 18:49:51,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 139 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:51,037 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 79 flow [2025-02-06 18:49:51,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2025-02-06 18:49:51,038 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -19 predicate places. [2025-02-06 18:49:51,038 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 79 flow [2025-02-06 18:49:51,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:51,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:51,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:49:51,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:49:51,039 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:49:51,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:51,039 INFO L85 PathProgramCache]: Analyzing trace with hash 30620540, now seen corresponding path program 1 times [2025-02-06 18:49:51,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:51,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802913010] [2025-02-06 18:49:51,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:51,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:51,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:49:51,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:49:51,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:51,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:51,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:51,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802913010] [2025-02-06 18:49:51,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802913010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:51,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:51,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:49:51,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820651278] [2025-02-06 18:49:51,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:51,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:49:51,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:51,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:49:51,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:49:51,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 59 [2025-02-06 18:49:51,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:51,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:51,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 59 [2025-02-06 18:49:51,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:51,381 INFO L124 PetriNetUnfolderBase]: 2143/3262 cut-off events. [2025-02-06 18:49:51,381 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-06 18:49:51,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6593 conditions, 3262 events. 2143/3262 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 21542 event pairs, 2143 based on Foata normal form. 0/1477 useless extension candidates. Maximal degree in co-relation 6589. Up to 3208 conditions per place. [2025-02-06 18:49:51,391 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 28 selfloop transitions, 1 changer transitions 0/32 dead transitions. [2025-02-06 18:49:51,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 32 transitions, 133 flow [2025-02-06 18:49:51,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:49:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:49:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-02-06 18:49:51,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2768361581920904 [2025-02-06 18:49:51,392 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 79 flow. Second operand 3 states and 49 transitions. [2025-02-06 18:49:51,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 32 transitions, 133 flow [2025-02-06 18:49:51,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 32 transitions, 132 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:51,393 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 76 flow [2025-02-06 18:49:51,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2025-02-06 18:49:51,393 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -20 predicate places. [2025-02-06 18:49:51,393 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 76 flow [2025-02-06 18:49:51,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:51,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:51,394 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:49:51,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:49:51,394 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:49:51,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:51,394 INFO L85 PathProgramCache]: Analyzing trace with hash 30620541, now seen corresponding path program 1 times [2025-02-06 18:49:51,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:51,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380863703] [2025-02-06 18:49:51,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:51,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:51,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:49:51,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:49:51,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:51,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:51,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:51,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:51,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380863703] [2025-02-06 18:49:51,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380863703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:51,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:51,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:49:51,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242922341] [2025-02-06 18:49:51,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:51,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:49:51,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:51,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:49:51,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:49:51,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 59 [2025-02-06 18:49:51,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:51,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:51,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 59 [2025-02-06 18:49:51,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:51,679 INFO L124 PetriNetUnfolderBase]: 1566/2412 cut-off events. [2025-02-06 18:49:51,679 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-06 18:49:51,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4884 conditions, 2412 events. 1566/2412 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 15268 event pairs, 1566 based on Foata normal form. 0/1192 useless extension candidates. Maximal degree in co-relation 4880. Up to 2367 conditions per place. [2025-02-06 18:49:51,686 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 26 selfloop transitions, 1 changer transitions 0/30 dead transitions. [2025-02-06 18:49:51,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 126 flow [2025-02-06 18:49:51,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:49:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:49:51,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-02-06 18:49:51,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2655367231638418 [2025-02-06 18:49:51,687 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 47 transitions. [2025-02-06 18:49:51,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 126 flow [2025-02-06 18:49:51,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 30 transitions, 125 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:51,688 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 73 flow [2025-02-06 18:49:51,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2025-02-06 18:49:51,689 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -21 predicate places. [2025-02-06 18:49:51,689 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 73 flow [2025-02-06 18:49:51,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:51,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:51,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:49:51,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:49:51,690 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:49:51,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:51,690 INFO L85 PathProgramCache]: Analyzing trace with hash 30620543, now seen corresponding path program 1 times [2025-02-06 18:49:51,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:51,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305258197] [2025-02-06 18:49:51,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:51,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:51,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:49:51,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:49:51,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:51,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:51,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:51,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305258197] [2025-02-06 18:49:51,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305258197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:51,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:51,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:49:51,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821044797] [2025-02-06 18:49:51,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:51,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:49:51,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:51,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:49:51,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:49:51,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 59 [2025-02-06 18:49:51,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:51,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:51,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 59 [2025-02-06 18:49:51,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:51,891 INFO L124 PetriNetUnfolderBase]: 1102/1718 cut-off events. [2025-02-06 18:49:51,891 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-06 18:49:51,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3483 conditions, 1718 events. 1102/1718 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 10393 event pairs, 1102 based on Foata normal form. 0/936 useless extension candidates. Maximal degree in co-relation 3479. Up to 1686 conditions per place. [2025-02-06 18:49:51,896 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 24 selfloop transitions, 1 changer transitions 0/28 dead transitions. [2025-02-06 18:49:51,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 28 transitions, 119 flow [2025-02-06 18:49:51,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:49:51,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:49:51,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2025-02-06 18:49:51,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2542372881355932 [2025-02-06 18:49:51,897 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 73 flow. Second operand 3 states and 45 transitions. [2025-02-06 18:49:51,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 28 transitions, 119 flow [2025-02-06 18:49:51,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 28 transitions, 118 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:51,898 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 70 flow [2025-02-06 18:49:51,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2025-02-06 18:49:51,899 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -22 predicate places. [2025-02-06 18:49:51,899 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 70 flow [2025-02-06 18:49:51,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:51,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:51,899 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:49:51,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:49:51,899 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:49:51,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:51,900 INFO L85 PathProgramCache]: Analyzing trace with hash 30620544, now seen corresponding path program 1 times [2025-02-06 18:49:51,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:51,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178686307] [2025-02-06 18:49:51,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:51,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:51,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:49:51,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:49:51,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:51,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:51,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:51,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:51,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178686307] [2025-02-06 18:49:51,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178686307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:51,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:51,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:49:51,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456611427] [2025-02-06 18:49:51,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:51,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:49:51,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:51,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:49:51,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:49:51,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 59 [2025-02-06 18:49:51,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:51,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:51,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 59 [2025-02-06 18:49:51,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:52,044 INFO L124 PetriNetUnfolderBase]: 712/1132 cut-off events. [2025-02-06 18:49:52,044 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 18:49:52,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2300 conditions, 1132 events. 712/1132 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 6429 event pairs, 712 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 2296. Up to 1111 conditions per place. [2025-02-06 18:49:52,048 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 22 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2025-02-06 18:49:52,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 26 transitions, 112 flow [2025-02-06 18:49:52,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:49:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:49:52,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-02-06 18:49:52,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24293785310734464 [2025-02-06 18:49:52,049 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 70 flow. Second operand 3 states and 43 transitions. [2025-02-06 18:49:52,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 26 transitions, 112 flow [2025-02-06 18:49:52,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 26 transitions, 111 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:52,049 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 67 flow [2025-02-06 18:49:52,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2025-02-06 18:49:52,050 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -23 predicate places. [2025-02-06 18:49:52,050 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 67 flow [2025-02-06 18:49:52,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:52,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:52,050 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 18:49:52,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:49:52,050 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:49:52,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:52,051 INFO L85 PathProgramCache]: Analyzing trace with hash -638448756, now seen corresponding path program 1 times [2025-02-06 18:49:52,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:52,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730398984] [2025-02-06 18:49:52,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:52,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:52,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:49:52,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:49:52,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:52,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:52,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:52,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730398984] [2025-02-06 18:49:52,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730398984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:52,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:52,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:49:52,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942918520] [2025-02-06 18:49:52,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:52,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:49:52,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:52,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:49:52,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:49:52,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 59 [2025-02-06 18:49:52,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:52,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:52,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 59 [2025-02-06 18:49:52,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:52,166 INFO L124 PetriNetUnfolderBase]: 520/839 cut-off events. [2025-02-06 18:49:52,167 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 18:49:52,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1712 conditions, 839 events. 520/839 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 4499 event pairs, 520 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 1708. Up to 821 conditions per place. [2025-02-06 18:49:52,169 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 20 selfloop transitions, 1 changer transitions 0/24 dead transitions. [2025-02-06 18:49:52,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 24 transitions, 105 flow [2025-02-06 18:49:52,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:49:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:49:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-02-06 18:49:52,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23163841807909605 [2025-02-06 18:49:52,169 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 67 flow. Second operand 3 states and 41 transitions. [2025-02-06 18:49:52,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 24 transitions, 105 flow [2025-02-06 18:49:52,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 24 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:52,170 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 64 flow [2025-02-06 18:49:52,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2025-02-06 18:49:52,171 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -24 predicate places. [2025-02-06 18:49:52,171 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 64 flow [2025-02-06 18:49:52,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:52,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:52,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 18:49:52,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:49:52,171 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:49:52,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:52,171 INFO L85 PathProgramCache]: Analyzing trace with hash -638448755, now seen corresponding path program 1 times [2025-02-06 18:49:52,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:52,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325187634] [2025-02-06 18:49:52,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:52,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:52,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:49:52,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:49:52,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:52,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:52,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:52,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325187634] [2025-02-06 18:49:52,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325187634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:52,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:52,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:49:52,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873007686] [2025-02-06 18:49:52,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:52,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:49:52,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:52,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:49:52,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:49:52,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 59 [2025-02-06 18:49:52,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:52,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:52,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 59 [2025-02-06 18:49:52,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:52,268 INFO L124 PetriNetUnfolderBase]: 358/590 cut-off events. [2025-02-06 18:49:52,269 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 18:49:52,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1212 conditions, 590 events. 358/590 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 2933 event pairs, 358 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 1208. Up to 575 conditions per place. [2025-02-06 18:49:52,270 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 18 selfloop transitions, 1 changer transitions 0/22 dead transitions. [2025-02-06 18:49:52,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 22 transitions, 98 flow [2025-02-06 18:49:52,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:49:52,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:49:52,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2025-02-06 18:49:52,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22033898305084745 [2025-02-06 18:49:52,271 INFO L175 Difference]: Start difference. First operand has 40 places, 24 transitions, 64 flow. Second operand 3 states and 39 transitions. [2025-02-06 18:49:52,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 22 transitions, 98 flow [2025-02-06 18:49:52,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 22 transitions, 97 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:52,272 INFO L231 Difference]: Finished difference. Result has 39 places, 22 transitions, 61 flow [2025-02-06 18:49:52,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=39, PETRI_TRANSITIONS=22} [2025-02-06 18:49:52,276 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -25 predicate places. [2025-02-06 18:49:52,276 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 61 flow [2025-02-06 18:49:52,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:52,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:52,276 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 18:49:52,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:49:52,276 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:49:52,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:52,276 INFO L85 PathProgramCache]: Analyzing trace with hash -638448750, now seen corresponding path program 1 times [2025-02-06 18:49:52,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:52,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604193124] [2025-02-06 18:49:52,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:52,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:52,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:49:52,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:49:52,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:52,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:52,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:52,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604193124] [2025-02-06 18:49:52,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604193124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:52,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:52,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:49:52,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504444687] [2025-02-06 18:49:52,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:52,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:49:52,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:52,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:49:52,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:49:52,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 59 [2025-02-06 18:49:52,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:52,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:52,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 59 [2025-02-06 18:49:52,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:52,357 INFO L124 PetriNetUnfolderBase]: 226/385 cut-off events. [2025-02-06 18:49:52,358 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 18:49:52,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 385 events. 226/385 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1725 event pairs, 226 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 796. Up to 373 conditions per place. [2025-02-06 18:49:52,359 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 16 selfloop transitions, 1 changer transitions 0/20 dead transitions. [2025-02-06 18:49:52,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 20 transitions, 91 flow [2025-02-06 18:49:52,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:49:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:49:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-02-06 18:49:52,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.20903954802259886 [2025-02-06 18:49:52,360 INFO L175 Difference]: Start difference. First operand has 39 places, 22 transitions, 61 flow. Second operand 3 states and 37 transitions. [2025-02-06 18:49:52,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 20 transitions, 91 flow [2025-02-06 18:49:52,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 20 transitions, 90 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:52,360 INFO L231 Difference]: Finished difference. Result has 38 places, 20 transitions, 58 flow [2025-02-06 18:49:52,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=38, PETRI_TRANSITIONS=20} [2025-02-06 18:49:52,361 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -26 predicate places. [2025-02-06 18:49:52,361 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 20 transitions, 58 flow [2025-02-06 18:49:52,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:52,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:52,361 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 18:49:52,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 18:49:52,361 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:49:52,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:52,362 INFO L85 PathProgramCache]: Analyzing trace with hash -638448749, now seen corresponding path program 1 times [2025-02-06 18:49:52,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:52,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230178619] [2025-02-06 18:49:52,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:52,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:52,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:49:52,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:49:52,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:52,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:52,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:52,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:52,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230178619] [2025-02-06 18:49:52,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230178619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:52,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:52,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:49:52,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789487661] [2025-02-06 18:49:52,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:52,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:49:52,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:52,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:49:52,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:49:52,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 59 [2025-02-06 18:49:52,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 20 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:52,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:52,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 59 [2025-02-06 18:49:52,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:52,434 INFO L124 PetriNetUnfolderBase]: 124/224 cut-off events. [2025-02-06 18:49:52,435 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 18:49:52,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 224 events. 124/224 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 838 event pairs, 124 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 472. Up to 215 conditions per place. [2025-02-06 18:49:52,435 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 0 selfloop transitions, 0 changer transitions 18/18 dead transitions. [2025-02-06 18:49:52,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 18 transitions, 84 flow [2025-02-06 18:49:52,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:49:52,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:49:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2025-02-06 18:49:52,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.1977401129943503 [2025-02-06 18:49:52,436 INFO L175 Difference]: Start difference. First operand has 38 places, 20 transitions, 58 flow. Second operand 3 states and 35 transitions. [2025-02-06 18:49:52,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 18 transitions, 84 flow [2025-02-06 18:49:52,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 18 transitions, 83 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:52,437 INFO L231 Difference]: Finished difference. Result has 37 places, 0 transitions, 0 flow [2025-02-06 18:49:52,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=37, PETRI_TRANSITIONS=0} [2025-02-06 18:49:52,437 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -27 predicate places. [2025-02-06 18:49:52,437 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 0 transitions, 0 flow [2025-02-06 18:49:52,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:52,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 75 remaining) [2025-02-06 18:49:52,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 75 remaining) [2025-02-06 18:49:52,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 75 remaining) [2025-02-06 18:49:52,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 75 remaining) [2025-02-06 18:49:52,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 75 remaining) [2025-02-06 18:49:52,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 75 remaining) [2025-02-06 18:49:52,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 75 remaining) [2025-02-06 18:49:52,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 75 remaining) [2025-02-06 18:49:52,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 75 remaining) [2025-02-06 18:49:52,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 75 remaining) [2025-02-06 18:49:52,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 75 remaining) [2025-02-06 18:49:52,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 75 remaining) [2025-02-06 18:49:52,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 75 remaining) [2025-02-06 18:49:52,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 75 remaining) [2025-02-06 18:49:52,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 75 remaining) [2025-02-06 18:49:52,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 75 remaining) [2025-02-06 18:49:52,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 75 remaining) [2025-02-06 18:49:52,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 75 remaining) [2025-02-06 18:49:52,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 75 remaining) [2025-02-06 18:49:52,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 75 remaining) [2025-02-06 18:49:52,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 75 remaining) [2025-02-06 18:49:52,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 75 remaining) [2025-02-06 18:49:52,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 75 remaining) [2025-02-06 18:49:52,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 75 remaining) [2025-02-06 18:49:52,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 75 remaining) [2025-02-06 18:49:52,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 75 remaining) [2025-02-06 18:49:52,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 75 remaining) [2025-02-06 18:49:52,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 75 remaining) [2025-02-06 18:49:52,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 75 remaining) [2025-02-06 18:49:52,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 75 remaining) [2025-02-06 18:49:52,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 75 remaining) [2025-02-06 18:49:52,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 75 remaining) [2025-02-06 18:49:52,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 75 remaining) [2025-02-06 18:49:52,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 75 remaining) [2025-02-06 18:49:52,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 75 remaining) [2025-02-06 18:49:52,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 75 remaining) [2025-02-06 18:49:52,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 75 remaining) [2025-02-06 18:49:52,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 75 remaining) [2025-02-06 18:49:52,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 75 remaining) [2025-02-06 18:49:52,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 75 remaining) [2025-02-06 18:49:52,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 75 remaining) [2025-02-06 18:49:52,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 75 remaining) [2025-02-06 18:49:52,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 75 remaining) [2025-02-06 18:49:52,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 75 remaining) [2025-02-06 18:49:52,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 75 remaining) [2025-02-06 18:49:52,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 75 remaining) [2025-02-06 18:49:52,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 75 remaining) [2025-02-06 18:49:52,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 75 remaining) [2025-02-06 18:49:52,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 75 remaining) [2025-02-06 18:49:52,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 75 remaining) [2025-02-06 18:49:52,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 75 remaining) [2025-02-06 18:49:52,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 75 remaining) [2025-02-06 18:49:52,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 75 remaining) [2025-02-06 18:49:52,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 75 remaining) [2025-02-06 18:49:52,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 75 remaining) [2025-02-06 18:49:52,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 75 remaining) [2025-02-06 18:49:52,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 75 remaining) [2025-02-06 18:49:52,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 75 remaining) [2025-02-06 18:49:52,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 75 remaining) [2025-02-06 18:49:52,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 75 remaining) [2025-02-06 18:49:52,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 75 remaining) [2025-02-06 18:49:52,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 75 remaining) [2025-02-06 18:49:52,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 75 remaining) [2025-02-06 18:49:52,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 75 remaining) [2025-02-06 18:49:52,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 75 remaining) [2025-02-06 18:49:52,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 75 remaining) [2025-02-06 18:49:52,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 75 remaining) [2025-02-06 18:49:52,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 75 remaining) [2025-02-06 18:49:52,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 75 remaining) [2025-02-06 18:49:52,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 75 remaining) [2025-02-06 18:49:52,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 75 remaining) [2025-02-06 18:49:52,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 75 remaining) [2025-02-06 18:49:52,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 75 remaining) [2025-02-06 18:49:52,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 75 remaining) [2025-02-06 18:49:52,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 75 remaining) [2025-02-06 18:49:52,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 18:49:52,444 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:49:52,448 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 18:49:52,448 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 18:49:52,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 06:49:52 BasicIcfg [2025-02-06 18:49:52,452 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 18:49:52,452 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 18:49:52,452 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 18:49:52,452 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 18:49:52,453 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:49:44" (3/4) ... [2025-02-06 18:49:52,454 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 18:49:52,456 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 18:49:52,456 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 18:49:52,456 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-06 18:49:52,458 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2025-02-06 18:49:52,458 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-02-06 18:49:52,459 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-06 18:49:52,459 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 18:49:52,459 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 18:49:52,509 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 18:49:52,509 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 18:49:52,509 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 18:49:52,510 INFO L158 Benchmark]: Toolchain (without parser) took 8950.88ms. Allocated memory was 167.8MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 131.5MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 98.4MB. Max. memory is 16.1GB. [2025-02-06 18:49:52,510 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 18:49:52,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.20ms. Allocated memory is still 167.8MB. Free memory was 131.5MB in the beginning and 119.6MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 18:49:52,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.63ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 117.6MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 18:49:52,511 INFO L158 Benchmark]: Boogie Preprocessor took 45.45ms. Allocated memory is still 167.8MB. Free memory was 117.6MB in the beginning and 115.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 18:49:52,511 INFO L158 Benchmark]: IcfgBuilder took 1136.92ms. Allocated memory is still 167.8MB. Free memory was 115.5MB in the beginning and 118.9MB in the end (delta: -3.3MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. [2025-02-06 18:49:52,511 INFO L158 Benchmark]: TraceAbstraction took 7502.26ms. Allocated memory was 167.8MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 118.9MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. [2025-02-06 18:49:52,511 INFO L158 Benchmark]: Witness Printer took 56.99ms. Allocated memory is still 2.0GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 18:49:52,512 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.19ms. Allocated memory is still 201.3MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.20ms. Allocated memory is still 167.8MB. Free memory was 131.5MB in the beginning and 119.6MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.63ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 117.6MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.45ms. Allocated memory is still 167.8MB. Free memory was 117.6MB in the beginning and 115.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1136.92ms. Allocated memory is still 167.8MB. Free memory was 115.5MB in the beginning and 118.9MB in the end (delta: -3.3MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7502.26ms. Allocated memory was 167.8MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 118.9MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. * Witness Printer took 56.99ms. Allocated memory is still 2.0GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: 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 7 procedures, 111 locations, 75 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 280 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 280 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 351 IncrementalHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 0 mSDtfsCounter, 351 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=0, InterpolantAutomatonStates: 38, 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.5s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 179 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 36 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 18:49:52,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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