./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:27:28,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:27:28,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:27:28,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:27:28,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:27:28,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:27:28,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:27:28,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:27:28,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:27:28,927 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:27:28,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:27:28,927 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:27:28,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:27:28,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:27:28,927 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:27:28,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:27:28,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:27:28,927 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:27:28,928 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:27:28,928 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:27:28,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:27:28,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:27:28,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:27:28,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:27:28,929 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:27:28,929 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:27:28,929 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:27:28,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:27:28,929 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:27:28,929 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:27:28,929 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:27:28,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:27:28,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:27:28,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:27:28,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:27:28,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:27:28,930 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:27:28,930 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:27:28,930 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:27:28,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:27:28,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:27:28,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:27:28,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:27:28,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:27:28,931 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:27:28,931 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 [2025-03-04 15:27:29,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:27:29,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:27:29,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:27:29,194 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:27:29,194 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:27:29,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2025-03-04 15:27:30,301 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a8f325ee/895ec0dbd487470ebf414750306a49bc/FLAGb55f15eac [2025-03-04 15:27:30,517 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:27:30,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2025-03-04 15:27:30,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a8f325ee/895ec0dbd487470ebf414750306a49bc/FLAGb55f15eac [2025-03-04 15:27:30,879 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a8f325ee/895ec0dbd487470ebf414750306a49bc [2025-03-04 15:27:30,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:27:30,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:27:30,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:27:30,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:27:30,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:27:30,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:27:30" (1/1) ... [2025-03-04 15:27:30,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36758f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:30, skipping insertion in model container [2025-03-04 15:27:30,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:27:30" (1/1) ... [2025-03-04 15:27:30,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:27:31,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:27:31,043 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:27:31,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:27:31,076 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:27:31,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:31 WrapperNode [2025-03-04 15:27:31,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:27:31,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:27:31,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:27:31,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:27:31,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:31" (1/1) ... [2025-03-04 15:27:31,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:31" (1/1) ... [2025-03-04 15:27:31,110 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 161 [2025-03-04 15:27:31,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:27:31,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:27:31,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:27:31,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:27:31,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:31" (1/1) ... [2025-03-04 15:27:31,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:31" (1/1) ... [2025-03-04 15:27:31,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:31" (1/1) ... [2025-03-04 15:27:31,129 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 15:27:31,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:31" (1/1) ... [2025-03-04 15:27:31,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:31" (1/1) ... [2025-03-04 15:27:31,134 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:31" (1/1) ... [2025-03-04 15:27:31,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:31" (1/1) ... [2025-03-04 15:27:31,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:31" (1/1) ... [2025-03-04 15:27:31,137 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:31" (1/1) ... [2025-03-04 15:27:31,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:27:31,139 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:27:31,139 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:27:31,140 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:27:31,140 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:31" (1/1) ... [2025-03-04 15:27:31,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:27:31,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:31,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:27:31,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:27:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:27:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:27:31,182 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:27:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:27:31,182 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:27:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:27:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:27:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:27:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:27:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:27:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:27:31,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:27:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:27:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:27:31,184 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:27:31,254 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:27:31,255 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:27:31,520 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:27:31,521 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:27:31,678 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:27:31,679 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:27:31,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:27:31 BoogieIcfgContainer [2025-03-04 15:27:31,679 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:27:31,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:27:31,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:27:31,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:27:31,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:27:30" (1/3) ... [2025-03-04 15:27:31,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a40ca3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:27:31, skipping insertion in model container [2025-03-04 15:27:31,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:31" (2/3) ... [2025-03-04 15:27:31,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a40ca3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:27:31, skipping insertion in model container [2025-03-04 15:27:31,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:27:31" (3/3) ... [2025-03-04 15:27:31,687 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2025-03-04 15:27:31,698 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:27:31,699 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-counter-queue.wvr.c that has 3 procedures, 64 locations, 1 initial locations, 3 loop locations, and 18 error locations. [2025-03-04 15:27:31,699 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:27:31,756 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:27:31,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 70 transitions, 154 flow [2025-03-04 15:27:31,817 INFO L124 PetriNetUnfolderBase]: 7/68 cut-off events. [2025-03-04 15:27:31,819 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:27:31,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 68 events. 7/68 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 214 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2025-03-04 15:27:31,826 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 70 transitions, 154 flow [2025-03-04 15:27:31,829 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 66 transitions, 141 flow [2025-03-04 15:27:31,834 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:27:31,856 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;@7451e2c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:27:31,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-03-04 15:27:31,859 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:27:31,859 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:27:31,859 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:27:31,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:31,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:27:31,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:31,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:31,864 INFO L85 PathProgramCache]: Analyzing trace with hash 470822, now seen corresponding path program 1 times [2025-03-04 15:27:31,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:31,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719165338] [2025-03-04 15:27:31,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:31,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:31,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:27:31,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:27:31,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:31,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:32,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-03-04 15:27:32,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:32,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719165338] [2025-03-04 15:27:32,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719165338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:32,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:32,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:32,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538624236] [2025-03-04 15:27:32,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:32,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:32,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:32,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:32,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:32,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 70 [2025-03-04 15:27:32,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:32,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:32,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 70 [2025-03-04 15:27:32,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:32,316 INFO L124 PetriNetUnfolderBase]: 425/1058 cut-off events. [2025-03-04 15:27:32,316 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-04 15:27:32,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1758 conditions, 1058 events. 425/1058 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6731 event pairs, 290 based on Foata normal form. 1/851 useless extension candidates. Maximal degree in co-relation 1674. Up to 666 conditions per place. [2025-03-04 15:27:32,326 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 32 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2025-03-04 15:27:32,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 69 transitions, 219 flow [2025-03-04 15:27:32,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:32,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:32,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2025-03-04 15:27:32,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6357142857142857 [2025-03-04 15:27:32,339 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 141 flow. Second operand 4 states and 178 transitions. [2025-03-04 15:27:32,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 69 transitions, 219 flow [2025-03-04 15:27:32,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 69 transitions, 214 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:27:32,346 INFO L231 Difference]: Finished difference. Result has 68 places, 69 transitions, 165 flow [2025-03-04 15:27:32,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=68, PETRI_TRANSITIONS=69} [2025-03-04 15:27:32,352 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 2 predicate places. [2025-03-04 15:27:32,354 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 69 transitions, 165 flow [2025-03-04 15:27:32,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:32,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:32,354 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:27:32,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:27:32,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:32,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:32,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1141734880, now seen corresponding path program 1 times [2025-03-04 15:27:32,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:32,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606712102] [2025-03-04 15:27:32,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:32,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:32,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:27:32,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:27:32,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:32,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:32,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:32,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:32,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606712102] [2025-03-04 15:27:32,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606712102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:32,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870235587] [2025-03-04 15:27:32,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:32,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:32,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:32,451 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:32,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:27:32,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:27:32,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:27:32,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:32,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:32,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:27:32,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:32,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:27:32,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870235587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:32,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:27:32,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:27:32,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216845287] [2025-03-04 15:27:32,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:32,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:27:32,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:32,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:27:32,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:27:32,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 70 [2025-03-04 15:27:32,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 69 transitions, 165 flow. Second operand has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 6 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:32,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:32,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 70 [2025-03-04 15:27:32,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:32,768 INFO L124 PetriNetUnfolderBase]: 425/1057 cut-off events. [2025-03-04 15:27:32,768 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 15:27:32,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1758 conditions, 1057 events. 425/1057 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6754 event pairs, 290 based on Foata normal form. 1/851 useless extension candidates. Maximal degree in co-relation 1731. Up to 661 conditions per place. [2025-03-04 15:27:32,774 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 28 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2025-03-04 15:27:32,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 231 flow [2025-03-04 15:27:32,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:27:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:27:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 246 transitions. [2025-03-04 15:27:32,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5857142857142857 [2025-03-04 15:27:32,776 INFO L175 Difference]: Start difference. First operand has 68 places, 69 transitions, 165 flow. Second operand 6 states and 246 transitions. [2025-03-04 15:27:32,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 231 flow [2025-03-04 15:27:32,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 68 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:32,777 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 172 flow [2025-03-04 15:27:32,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2025-03-04 15:27:32,778 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 5 predicate places. [2025-03-04 15:27:32,778 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 172 flow [2025-03-04 15:27:32,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 6 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:32,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:32,778 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:27:32,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:27:32,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:32,983 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:32,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:32,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1034043291, now seen corresponding path program 1 times [2025-03-04 15:27:32,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:32,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120437893] [2025-03-04 15:27:32,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:32,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:32,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:27:33,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:27:33,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:33,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:33,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:33,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120437893] [2025-03-04 15:27:33,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120437893] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:33,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666739650] [2025-03-04 15:27:33,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:33,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:33,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:33,065 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:33,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:27:33,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:27:33,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:27:33,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:33,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:33,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:27:33,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:33,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:33,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:27:33,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:33,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666739650] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:27:33,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:27:33,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:27:33,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203482575] [2025-03-04 15:27:33,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:27:33,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:27:33,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:33,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:27:33,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:27:33,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 70 [2025-03-04 15:27:33,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 172 flow. Second operand has 12 states, 12 states have (on average 36.083333333333336) internal successors, (433), 12 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:33,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:33,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 70 [2025-03-04 15:27:33,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:33,411 INFO L124 PetriNetUnfolderBase]: 428/1069 cut-off events. [2025-03-04 15:27:33,412 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-04 15:27:33,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1802 conditions, 1069 events. 428/1069 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6860 event pairs, 290 based on Foata normal form. 3/863 useless extension candidates. Maximal degree in co-relation 1732. Up to 668 conditions per place. [2025-03-04 15:27:33,418 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 31 selfloop transitions, 13 changer transitions 0/77 dead transitions. [2025-03-04 15:27:33,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 77 transitions, 314 flow [2025-03-04 15:27:33,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:27:33,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:27:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 397 transitions. [2025-03-04 15:27:33,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5671428571428572 [2025-03-04 15:27:33,421 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 172 flow. Second operand 10 states and 397 transitions. [2025-03-04 15:27:33,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 77 transitions, 314 flow [2025-03-04 15:27:33,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 77 transitions, 268 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-04 15:27:33,423 INFO L231 Difference]: Finished difference. Result has 78 places, 77 transitions, 224 flow [2025-03-04 15:27:33,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=224, PETRI_PLACES=78, PETRI_TRANSITIONS=77} [2025-03-04 15:27:33,426 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 12 predicate places. [2025-03-04 15:27:33,426 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 224 flow [2025-03-04 15:27:33,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 36.083333333333336) internal successors, (433), 12 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:33,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:33,426 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:33,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:27:33,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 15:27:33,627 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:33,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:33,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1120572038, now seen corresponding path program 1 times [2025-03-04 15:27:33,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:33,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938768433] [2025-03-04 15:27:33,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:33,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:33,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:27:33,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:27:33,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:33,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:33,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:33,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938768433] [2025-03-04 15:27:33,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938768433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:33,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:33,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:33,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073407749] [2025-03-04 15:27:33,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:33,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:33,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:33,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:33,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:33,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 70 [2025-03-04 15:27:33,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:33,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:33,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 70 [2025-03-04 15:27:33,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:33,906 INFO L124 PetriNetUnfolderBase]: 733/1642 cut-off events. [2025-03-04 15:27:33,907 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-04 15:27:33,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2870 conditions, 1642 events. 733/1642 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 11118 event pairs, 285 based on Foata normal form. 48/1379 useless extension candidates. Maximal degree in co-relation 2836. Up to 634 conditions per place. [2025-03-04 15:27:33,917 INFO L140 encePairwiseOnDemand]: 62/70 looper letters, 75 selfloop transitions, 5 changer transitions 0/108 dead transitions. [2025-03-04 15:27:33,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 108 transitions, 450 flow [2025-03-04 15:27:33,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2025-03-04 15:27:33,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2025-03-04 15:27:33,918 INFO L175 Difference]: Start difference. First operand has 78 places, 77 transitions, 224 flow. Second operand 4 states and 195 transitions. [2025-03-04 15:27:33,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 108 transitions, 450 flow [2025-03-04 15:27:33,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 108 transitions, 439 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:33,922 INFO L231 Difference]: Finished difference. Result has 81 places, 79 transitions, 247 flow [2025-03-04 15:27:33,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=247, PETRI_PLACES=81, PETRI_TRANSITIONS=79} [2025-03-04 15:27:33,923 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places. [2025-03-04 15:27:33,923 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 79 transitions, 247 flow [2025-03-04 15:27:33,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:33,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:33,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:33,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:27:33,925 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:33,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:33,926 INFO L85 PathProgramCache]: Analyzing trace with hash 377995251, now seen corresponding path program 1 times [2025-03-04 15:27:33,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:33,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485633683] [2025-03-04 15:27:33,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:33,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:33,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:27:33,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:27:33,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:33,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:34,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:34,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485633683] [2025-03-04 15:27:34,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485633683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:34,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:34,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:27:34,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731659974] [2025-03-04 15:27:34,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:34,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:27:34,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:34,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:27:34,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:27:34,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 70 [2025-03-04 15:27:34,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 79 transitions, 247 flow. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:34,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:34,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 70 [2025-03-04 15:27:34,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:34,203 INFO L124 PetriNetUnfolderBase]: 606/1560 cut-off events. [2025-03-04 15:27:34,203 INFO L125 PetriNetUnfolderBase]: For 320/352 co-relation queries the response was YES. [2025-03-04 15:27:34,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2820 conditions, 1560 events. 606/1560 cut-off events. For 320/352 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 11092 event pairs, 397 based on Foata normal form. 41/1342 useless extension candidates. Maximal degree in co-relation 2784. Up to 802 conditions per place. [2025-03-04 15:27:34,211 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 70 selfloop transitions, 5 changer transitions 2/111 dead transitions. [2025-03-04 15:27:34,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 111 transitions, 471 flow [2025-03-04 15:27:34,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:27:34,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:27:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 252 transitions. [2025-03-04 15:27:34,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.72 [2025-03-04 15:27:34,212 INFO L175 Difference]: Start difference. First operand has 81 places, 79 transitions, 247 flow. Second operand 5 states and 252 transitions. [2025-03-04 15:27:34,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 111 transitions, 471 flow [2025-03-04 15:27:34,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 111 transitions, 471 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:27:34,217 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 272 flow [2025-03-04 15:27:34,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=87, PETRI_TRANSITIONS=81} [2025-03-04 15:27:34,219 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 21 predicate places. [2025-03-04 15:27:34,219 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 81 transitions, 272 flow [2025-03-04 15:27:34,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:34,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:34,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:34,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:27:34,219 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:34,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:34,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1230790016, now seen corresponding path program 1 times [2025-03-04 15:27:34,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:34,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110155884] [2025-03-04 15:27:34,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:34,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:34,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:27:34,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:27:34,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:34,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:34,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:34,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:34,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110155884] [2025-03-04 15:27:34,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110155884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:34,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:34,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:34,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980943574] [2025-03-04 15:27:34,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:34,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:34,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:34,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:34,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:34,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 70 [2025-03-04 15:27:34,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 81 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:34,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:34,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 70 [2025-03-04 15:27:34,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:34,516 INFO L124 PetriNetUnfolderBase]: 1051/2435 cut-off events. [2025-03-04 15:27:34,516 INFO L125 PetriNetUnfolderBase]: For 867/901 co-relation queries the response was YES. [2025-03-04 15:27:34,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4862 conditions, 2435 events. 1051/2435 cut-off events. For 867/901 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 17844 event pairs, 417 based on Foata normal form. 88/2153 useless extension candidates. Maximal degree in co-relation 4823. Up to 948 conditions per place. [2025-03-04 15:27:34,529 INFO L140 encePairwiseOnDemand]: 62/70 looper letters, 85 selfloop transitions, 5 changer transitions 0/118 dead transitions. [2025-03-04 15:27:34,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 118 transitions, 592 flow [2025-03-04 15:27:34,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:34,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:34,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2025-03-04 15:27:34,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6892857142857143 [2025-03-04 15:27:34,533 INFO L175 Difference]: Start difference. First operand has 87 places, 81 transitions, 272 flow. Second operand 4 states and 193 transitions. [2025-03-04 15:27:34,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 118 transitions, 592 flow [2025-03-04 15:27:34,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 118 transitions, 587 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:34,539 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 301 flow [2025-03-04 15:27:34,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=301, PETRI_PLACES=90, PETRI_TRANSITIONS=83} [2025-03-04 15:27:34,541 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 24 predicate places. [2025-03-04 15:27:34,541 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 301 flow [2025-03-04 15:27:34,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:34,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:34,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:34,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:27:34,542 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:34,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:34,542 INFO L85 PathProgramCache]: Analyzing trace with hash -500214700, now seen corresponding path program 1 times [2025-03-04 15:27:34,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:34,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644251458] [2025-03-04 15:27:34,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:34,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:34,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:27:34,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:27:34,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:34,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:34,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:34,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:34,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644251458] [2025-03-04 15:27:34,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644251458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:34,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:34,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:27:34,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067278254] [2025-03-04 15:27:34,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:34,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:27:34,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:34,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:27:34,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:27:34,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 70 [2025-03-04 15:27:34,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 83 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:34,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:34,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 70 [2025-03-04 15:27:34,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:34,823 INFO L124 PetriNetUnfolderBase]: 669/1731 cut-off events. [2025-03-04 15:27:34,824 INFO L125 PetriNetUnfolderBase]: For 816/873 co-relation queries the response was YES. [2025-03-04 15:27:34,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3584 conditions, 1731 events. 669/1731 cut-off events. For 816/873 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12843 event pairs, 474 based on Foata normal form. 39/1567 useless extension candidates. Maximal degree in co-relation 3543. Up to 994 conditions per place. [2025-03-04 15:27:34,834 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 44 selfloop transitions, 2 changer transitions 14/94 dead transitions. [2025-03-04 15:27:34,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 94 transitions, 456 flow [2025-03-04 15:27:34,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:27:34,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:27:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2025-03-04 15:27:34,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6657142857142857 [2025-03-04 15:27:34,836 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 301 flow. Second operand 5 states and 233 transitions. [2025-03-04 15:27:34,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 94 transitions, 456 flow [2025-03-04 15:27:34,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 94 transitions, 456 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:27:34,840 INFO L231 Difference]: Finished difference. Result has 96 places, 80 transitions, 294 flow [2025-03-04 15:27:34,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=96, PETRI_TRANSITIONS=80} [2025-03-04 15:27:34,840 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 30 predicate places. [2025-03-04 15:27:34,840 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 80 transitions, 294 flow [2025-03-04 15:27:34,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:34,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:34,841 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:34,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:27:34,841 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:34,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:34,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1113090695, now seen corresponding path program 1 times [2025-03-04 15:27:34,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:34,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870617370] [2025-03-04 15:27:34,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:34,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:34,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:27:34,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:27:34,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:34,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:35,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:35,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:35,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870617370] [2025-03-04 15:27:35,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870617370] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:35,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911383377] [2025-03-04 15:27:35,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:35,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:35,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:35,088 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:35,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:27:35,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:27:35,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:27:35,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:35,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:35,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:27:35,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:35,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:27:35,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 15:27:35,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:35,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:27:35,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-04 15:27:35,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-04 15:27:35,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:35,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911383377] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:27:35,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:27:35,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:27:35,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040095475] [2025-03-04 15:27:35,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:27:35,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 15:27:35,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:35,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:27:35,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:27:35,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 70 [2025-03-04 15:27:35,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 80 transitions, 294 flow. Second operand has 13 states, 13 states have (on average 35.38461538461539) internal successors, (460), 13 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:35,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:35,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 70 [2025-03-04 15:27:35,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:35,870 INFO L124 PetriNetUnfolderBase]: 1403/3495 cut-off events. [2025-03-04 15:27:35,872 INFO L125 PetriNetUnfolderBase]: For 1814/1913 co-relation queries the response was YES. [2025-03-04 15:27:35,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7431 conditions, 3495 events. 1403/3495 cut-off events. For 1814/1913 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 27167 event pairs, 405 based on Foata normal form. 57/3166 useless extension candidates. Maximal degree in co-relation 7401. Up to 833 conditions per place. [2025-03-04 15:27:35,889 INFO L140 encePairwiseOnDemand]: 57/70 looper letters, 110 selfloop transitions, 18 changer transitions 0/160 dead transitions. [2025-03-04 15:27:35,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 160 transitions, 840 flow [2025-03-04 15:27:35,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:27:35,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:27:35,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 448 transitions. [2025-03-04 15:27:35,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64 [2025-03-04 15:27:35,892 INFO L175 Difference]: Start difference. First operand has 96 places, 80 transitions, 294 flow. Second operand 10 states and 448 transitions. [2025-03-04 15:27:35,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 160 transitions, 840 flow [2025-03-04 15:27:35,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 160 transitions, 796 flow, removed 20 selfloop flow, removed 6 redundant places. [2025-03-04 15:27:35,899 INFO L231 Difference]: Finished difference. Result has 98 places, 89 transitions, 385 flow [2025-03-04 15:27:35,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=385, PETRI_PLACES=98, PETRI_TRANSITIONS=89} [2025-03-04 15:27:35,901 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 32 predicate places. [2025-03-04 15:27:35,901 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 89 transitions, 385 flow [2025-03-04 15:27:35,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 35.38461538461539) internal successors, (460), 13 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:35,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:35,902 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:35,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:27:36,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:36,102 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:36,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:36,103 INFO L85 PathProgramCache]: Analyzing trace with hash -146103484, now seen corresponding path program 1 times [2025-03-04 15:27:36,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:36,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677534024] [2025-03-04 15:27:36,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:36,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:36,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:27:36,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:27:36,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:36,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:36,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:36,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:36,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677534024] [2025-03-04 15:27:36,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677534024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:36,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860192909] [2025-03-04 15:27:36,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:36,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:36,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:36,309 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:36,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:27:36,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:27:36,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:27:36,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:36,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:36,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:27:36,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:36,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:27:36,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 15:27:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:36,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:27:36,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-04 15:27:36,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-04 15:27:36,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:36,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860192909] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:27:36,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:27:36,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 15:27:36,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133502037] [2025-03-04 15:27:36,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:27:36,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:27:36,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:36,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:27:36,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:27:36,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 70 [2025-03-04 15:27:36,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 385 flow. Second operand has 12 states, 12 states have (on average 33.5) internal successors, (402), 12 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:36,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:36,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 70 [2025-03-04 15:27:36,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:36,961 INFO L124 PetriNetUnfolderBase]: 1672/3706 cut-off events. [2025-03-04 15:27:36,961 INFO L125 PetriNetUnfolderBase]: For 2824/2941 co-relation queries the response was YES. [2025-03-04 15:27:36,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8650 conditions, 3706 events. 1672/3706 cut-off events. For 2824/2941 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 26961 event pairs, 498 based on Foata normal form. 91/3454 useless extension candidates. Maximal degree in co-relation 8611. Up to 1052 conditions per place. [2025-03-04 15:27:36,989 INFO L140 encePairwiseOnDemand]: 57/70 looper letters, 114 selfloop transitions, 18 changer transitions 0/161 dead transitions. [2025-03-04 15:27:36,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 161 transitions, 881 flow [2025-03-04 15:27:36,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:27:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:27:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 428 transitions. [2025-03-04 15:27:36,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6114285714285714 [2025-03-04 15:27:36,993 INFO L175 Difference]: Start difference. First operand has 98 places, 89 transitions, 385 flow. Second operand 10 states and 428 transitions. [2025-03-04 15:27:36,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 161 transitions, 881 flow [2025-03-04 15:27:37,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 161 transitions, 869 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 15:27:37,003 INFO L231 Difference]: Finished difference. Result has 105 places, 91 transitions, 435 flow [2025-03-04 15:27:37,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=435, PETRI_PLACES=105, PETRI_TRANSITIONS=91} [2025-03-04 15:27:37,003 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 39 predicate places. [2025-03-04 15:27:37,003 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 91 transitions, 435 flow [2025-03-04 15:27:37,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 33.5) internal successors, (402), 12 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:37,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:37,005 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:37,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:27:37,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:37,206 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:37,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:37,207 INFO L85 PathProgramCache]: Analyzing trace with hash -234241253, now seen corresponding path program 1 times [2025-03-04 15:27:37,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:37,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657397000] [2025-03-04 15:27:37,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:37,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:37,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:27:37,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:27:37,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:37,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:27:37,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:37,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657397000] [2025-03-04 15:27:37,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657397000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:37,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:37,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:37,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322466529] [2025-03-04 15:27:37,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:37,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:27:37,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:37,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:27:37,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:27:37,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 70 [2025-03-04 15:27:37,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 91 transitions, 435 flow. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:37,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:37,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 70 [2025-03-04 15:27:37,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:37,863 INFO L124 PetriNetUnfolderBase]: 2855/6315 cut-off events. [2025-03-04 15:27:37,863 INFO L125 PetriNetUnfolderBase]: For 6715/6876 co-relation queries the response was YES. [2025-03-04 15:27:37,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15182 conditions, 6315 events. 2855/6315 cut-off events. For 6715/6876 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 52233 event pairs, 619 based on Foata normal form. 179/6011 useless extension candidates. Maximal degree in co-relation 15141. Up to 3087 conditions per place. [2025-03-04 15:27:37,891 INFO L140 encePairwiseOnDemand]: 61/70 looper letters, 144 selfloop transitions, 12 changer transitions 0/184 dead transitions. [2025-03-04 15:27:37,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 184 transitions, 1106 flow [2025-03-04 15:27:37,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:27:37,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:27:37,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 334 transitions. [2025-03-04 15:27:37,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6816326530612244 [2025-03-04 15:27:37,894 INFO L175 Difference]: Start difference. First operand has 105 places, 91 transitions, 435 flow. Second operand 7 states and 334 transitions. [2025-03-04 15:27:37,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 184 transitions, 1106 flow [2025-03-04 15:27:37,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 184 transitions, 1068 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-04 15:27:37,905 INFO L231 Difference]: Finished difference. Result has 108 places, 102 transitions, 518 flow [2025-03-04 15:27:37,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=518, PETRI_PLACES=108, PETRI_TRANSITIONS=102} [2025-03-04 15:27:37,906 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 42 predicate places. [2025-03-04 15:27:37,906 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 102 transitions, 518 flow [2025-03-04 15:27:37,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:37,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:37,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:37,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:27:37,906 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:37,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:37,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1085268058, now seen corresponding path program 1 times [2025-03-04 15:27:37,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:37,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622361062] [2025-03-04 15:27:37,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:37,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:37,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:27:37,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:27:37,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:37,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:38,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:38,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:38,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622361062] [2025-03-04 15:27:38,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622361062] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:38,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217523571] [2025-03-04 15:27:38,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:38,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:38,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:38,098 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:38,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:27:38,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:27:38,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:27:38,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:38,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:38,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:27:38,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:38,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:27:38,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 15:27:38,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:38,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:27:38,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-04 15:27:38,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-04 15:27:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:38,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217523571] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:27:38,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:27:38,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:27:38,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618661072] [2025-03-04 15:27:38,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:27:38,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 15:27:38,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:38,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:27:38,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:27:38,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 70 [2025-03-04 15:27:38,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 102 transitions, 518 flow. Second operand has 13 states, 13 states have (on average 35.69230769230769) internal successors, (464), 13 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:38,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:38,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 70 [2025-03-04 15:27:38,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:39,070 INFO L124 PetriNetUnfolderBase]: 3060/7501 cut-off events. [2025-03-04 15:27:39,070 INFO L125 PetriNetUnfolderBase]: For 8527/8792 co-relation queries the response was YES. [2025-03-04 15:27:39,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18065 conditions, 7501 events. 3060/7501 cut-off events. For 8527/8792 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 65042 event pairs, 797 based on Foata normal form. 147/6871 useless extension candidates. Maximal degree in co-relation 18023. Up to 1955 conditions per place. [2025-03-04 15:27:39,103 INFO L140 encePairwiseOnDemand]: 57/70 looper letters, 166 selfloop transitions, 18 changer transitions 0/221 dead transitions. [2025-03-04 15:27:39,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 221 transitions, 1602 flow [2025-03-04 15:27:39,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:27:39,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:27:39,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 444 transitions. [2025-03-04 15:27:39,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6342857142857142 [2025-03-04 15:27:39,104 INFO L175 Difference]: Start difference. First operand has 108 places, 102 transitions, 518 flow. Second operand 10 states and 444 transitions. [2025-03-04 15:27:39,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 221 transitions, 1602 flow [2025-03-04 15:27:39,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 221 transitions, 1588 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-03-04 15:27:39,117 INFO L231 Difference]: Finished difference. Result has 120 places, 111 transitions, 621 flow [2025-03-04 15:27:39,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=621, PETRI_PLACES=120, PETRI_TRANSITIONS=111} [2025-03-04 15:27:39,118 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 54 predicate places. [2025-03-04 15:27:39,118 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 111 transitions, 621 flow [2025-03-04 15:27:39,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 35.69230769230769) internal successors, (464), 13 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:39,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:39,119 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:39,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:27:39,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 15:27:39,319 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:39,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1328456199, now seen corresponding path program 1 times [2025-03-04 15:27:39,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:39,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542229193] [2025-03-04 15:27:39,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:39,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:39,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:27:39,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:27:39,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:39,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:39,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:27:39,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:39,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542229193] [2025-03-04 15:27:39,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542229193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:39,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:39,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:27:39,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427522067] [2025-03-04 15:27:39,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:39,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:27:39,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:39,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:27:39,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:27:39,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 70 [2025-03-04 15:27:39,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 111 transitions, 621 flow. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:39,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:39,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 70 [2025-03-04 15:27:39,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:40,403 INFO L124 PetriNetUnfolderBase]: 5279/12041 cut-off events. [2025-03-04 15:27:40,404 INFO L125 PetriNetUnfolderBase]: For 17651/18216 co-relation queries the response was YES. [2025-03-04 15:27:40,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32099 conditions, 12041 events. 5279/12041 cut-off events. For 17651/18216 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 108696 event pairs, 1349 based on Foata normal form. 358/11264 useless extension candidates. Maximal degree in co-relation 32050. Up to 5854 conditions per place. [2025-03-04 15:27:40,491 INFO L140 encePairwiseOnDemand]: 60/70 looper letters, 183 selfloop transitions, 27 changer transitions 0/240 dead transitions. [2025-03-04 15:27:40,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 240 transitions, 1722 flow [2025-03-04 15:27:40,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:27:40,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 15:27:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 411 transitions. [2025-03-04 15:27:40,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6523809523809524 [2025-03-04 15:27:40,493 INFO L175 Difference]: Start difference. First operand has 120 places, 111 transitions, 621 flow. Second operand 9 states and 411 transitions. [2025-03-04 15:27:40,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 240 transitions, 1722 flow [2025-03-04 15:27:40,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 240 transitions, 1704 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 15:27:40,530 INFO L231 Difference]: Finished difference. Result has 126 places, 130 transitions, 805 flow [2025-03-04 15:27:40,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=805, PETRI_PLACES=126, PETRI_TRANSITIONS=130} [2025-03-04 15:27:40,530 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 60 predicate places. [2025-03-04 15:27:40,531 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 130 transitions, 805 flow [2025-03-04 15:27:40,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:40,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:40,531 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:40,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:27:40,531 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:40,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:40,532 INFO L85 PathProgramCache]: Analyzing trace with hash -716458850, now seen corresponding path program 1 times [2025-03-04 15:27:40,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:40,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755536713] [2025-03-04 15:27:40,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:40,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:40,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:27:40,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:27:40,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:40,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:40,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:40,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:40,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755536713] [2025-03-04 15:27:40,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755536713] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:40,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40193973] [2025-03-04 15:27:40,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:40,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:40,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:40,692 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:40,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:27:40,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:27:40,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:27:40,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:40,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:40,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:27:40,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:40,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:27:40,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 15:27:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:40,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:27:40,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-04 15:27:40,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-04 15:27:40,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:40,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40193973] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:27:40,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:27:40,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:27:40,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734426031] [2025-03-04 15:27:40,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:27:40,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 15:27:40,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:40,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:27:40,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:27:40,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 70 [2025-03-04 15:27:40,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 130 transitions, 805 flow. Second operand has 13 states, 13 states have (on average 33.84615384615385) internal successors, (440), 13 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:40,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:40,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 70 [2025-03-04 15:27:40,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:41,864 INFO L124 PetriNetUnfolderBase]: 4068/9107 cut-off events. [2025-03-04 15:27:41,864 INFO L125 PetriNetUnfolderBase]: For 17400/17829 co-relation queries the response was YES. [2025-03-04 15:27:41,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25623 conditions, 9107 events. 4068/9107 cut-off events. For 17400/17829 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 77673 event pairs, 1061 based on Foata normal form. 245/8580 useless extension candidates. Maximal degree in co-relation 25574. Up to 2868 conditions per place. [2025-03-04 15:27:41,932 INFO L140 encePairwiseOnDemand]: 57/70 looper letters, 208 selfloop transitions, 18 changer transitions 0/264 dead transitions. [2025-03-04 15:27:41,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 264 transitions, 2201 flow [2025-03-04 15:27:41,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:27:41,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:27:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 424 transitions. [2025-03-04 15:27:41,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6057142857142858 [2025-03-04 15:27:41,934 INFO L175 Difference]: Start difference. First operand has 126 places, 130 transitions, 805 flow. Second operand 10 states and 424 transitions. [2025-03-04 15:27:41,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 264 transitions, 2201 flow [2025-03-04 15:27:41,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 264 transitions, 2183 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-04 15:27:41,963 INFO L231 Difference]: Finished difference. Result has 137 places, 132 transitions, 859 flow [2025-03-04 15:27:41,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=859, PETRI_PLACES=137, PETRI_TRANSITIONS=132} [2025-03-04 15:27:41,964 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 71 predicate places. [2025-03-04 15:27:41,964 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 132 transitions, 859 flow [2025-03-04 15:27:41,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 33.84615384615385) internal successors, (440), 13 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:41,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:41,965 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:41,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:27:42,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:42,166 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:42,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:42,166 INFO L85 PathProgramCache]: Analyzing trace with hash -848841406, now seen corresponding path program 1 times [2025-03-04 15:27:42,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:42,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338131627] [2025-03-04 15:27:42,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:42,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:42,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:27:42,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:27:42,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:42,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:27:42,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:42,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338131627] [2025-03-04 15:27:42,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338131627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:42,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:42,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:27:42,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487983037] [2025-03-04 15:27:42,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:42,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:27:42,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:42,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:27:42,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:27:42,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 70 [2025-03-04 15:27:42,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 132 transitions, 859 flow. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:42,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:42,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 70 [2025-03-04 15:27:42,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:43,076 INFO L124 PetriNetUnfolderBase]: 4494/10026 cut-off events. [2025-03-04 15:27:43,077 INFO L125 PetriNetUnfolderBase]: For 21137/21355 co-relation queries the response was YES. [2025-03-04 15:27:43,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30072 conditions, 10026 events. 4494/10026 cut-off events. For 21137/21355 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 86147 event pairs, 1666 based on Foata normal form. 302/9727 useless extension candidates. Maximal degree in co-relation 30017. Up to 3839 conditions per place. [2025-03-04 15:27:43,128 INFO L140 encePairwiseOnDemand]: 62/70 looper letters, 182 selfloop transitions, 21 changer transitions 0/233 dead transitions. [2025-03-04 15:27:43,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 233 transitions, 1900 flow [2025-03-04 15:27:43,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:27:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:27:43,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 274 transitions. [2025-03-04 15:27:43,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6523809523809524 [2025-03-04 15:27:43,130 INFO L175 Difference]: Start difference. First operand has 137 places, 132 transitions, 859 flow. Second operand 6 states and 274 transitions. [2025-03-04 15:27:43,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 233 transitions, 1900 flow [2025-03-04 15:27:43,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 233 transitions, 1794 flow, removed 6 selfloop flow, removed 9 redundant places. [2025-03-04 15:27:43,175 INFO L231 Difference]: Finished difference. Result has 135 places, 133 transitions, 862 flow [2025-03-04 15:27:43,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=862, PETRI_PLACES=135, PETRI_TRANSITIONS=133} [2025-03-04 15:27:43,176 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 69 predicate places. [2025-03-04 15:27:43,176 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 133 transitions, 862 flow [2025-03-04 15:27:43,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:43,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:43,176 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:43,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:27:43,176 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:43,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:43,176 INFO L85 PathProgramCache]: Analyzing trace with hash -848842399, now seen corresponding path program 1 times [2025-03-04 15:27:43,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:43,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598036298] [2025-03-04 15:27:43,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:43,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:43,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:27:43,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:27:43,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:43,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:27:43,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:43,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598036298] [2025-03-04 15:27:43,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598036298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:43,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:43,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:43,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397678810] [2025-03-04 15:27:43,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:43,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:43,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:43,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:43,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:43,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 70 [2025-03-04 15:27:43,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 133 transitions, 862 flow. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:43,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:43,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 70 [2025-03-04 15:27:43,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:44,137 INFO L124 PetriNetUnfolderBase]: 4781/10367 cut-off events. [2025-03-04 15:27:44,137 INFO L125 PetriNetUnfolderBase]: For 20412/20768 co-relation queries the response was YES. [2025-03-04 15:27:44,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31409 conditions, 10367 events. 4781/10367 cut-off events. For 20412/20768 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 88075 event pairs, 1973 based on Foata normal form. 360/10064 useless extension candidates. Maximal degree in co-relation 31358. Up to 4310 conditions per place. [2025-03-04 15:27:44,222 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 131 selfloop transitions, 16 changer transitions 0/185 dead transitions. [2025-03-04 15:27:44,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 185 transitions, 1465 flow [2025-03-04 15:27:44,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2025-03-04 15:27:44,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-03-04 15:27:44,224 INFO L175 Difference]: Start difference. First operand has 135 places, 133 transitions, 862 flow. Second operand 4 states and 196 transitions. [2025-03-04 15:27:44,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 185 transitions, 1465 flow [2025-03-04 15:27:44,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 185 transitions, 1430 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-03-04 15:27:44,281 INFO L231 Difference]: Finished difference. Result has 137 places, 134 transitions, 893 flow [2025-03-04 15:27:44,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=893, PETRI_PLACES=137, PETRI_TRANSITIONS=134} [2025-03-04 15:27:44,282 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 71 predicate places. [2025-03-04 15:27:44,282 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 134 transitions, 893 flow [2025-03-04 15:27:44,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:44,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:44,282 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:44,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:27:44,282 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:44,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:44,283 INFO L85 PathProgramCache]: Analyzing trace with hash -735388388, now seen corresponding path program 1 times [2025-03-04 15:27:44,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:44,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534995886] [2025-03-04 15:27:44,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:44,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:44,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:27:44,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:27:44,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:44,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:27:44,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:44,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534995886] [2025-03-04 15:27:44,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534995886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:44,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:44,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:44,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891679517] [2025-03-04 15:27:44,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:44,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:27:44,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:44,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:27:44,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:27:44,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 70 [2025-03-04 15:27:44,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 134 transitions, 893 flow. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:44,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:44,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 70 [2025-03-04 15:27:44,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:45,450 INFO L124 PetriNetUnfolderBase]: 5261/11191 cut-off events. [2025-03-04 15:27:45,450 INFO L125 PetriNetUnfolderBase]: For 33222/33922 co-relation queries the response was YES. [2025-03-04 15:27:45,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35430 conditions, 11191 events. 5261/11191 cut-off events. For 33222/33922 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 95561 event pairs, 1596 based on Foata normal form. 448/11083 useless extension candidates. Maximal degree in co-relation 35378. Up to 6800 conditions per place. [2025-03-04 15:27:45,509 INFO L140 encePairwiseOnDemand]: 61/70 looper letters, 178 selfloop transitions, 19 changer transitions 0/234 dead transitions. [2025-03-04 15:27:45,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 234 transitions, 1918 flow [2025-03-04 15:27:45,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:27:45,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:27:45,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 334 transitions. [2025-03-04 15:27:45,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6816326530612244 [2025-03-04 15:27:45,511 INFO L175 Difference]: Start difference. First operand has 137 places, 134 transitions, 893 flow. Second operand 7 states and 334 transitions. [2025-03-04 15:27:45,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 234 transitions, 1918 flow [2025-03-04 15:27:45,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 234 transitions, 1887 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:45,559 INFO L231 Difference]: Finished difference. Result has 145 places, 143 transitions, 1000 flow [2025-03-04 15:27:45,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1000, PETRI_PLACES=145, PETRI_TRANSITIONS=143} [2025-03-04 15:27:45,559 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 79 predicate places. [2025-03-04 15:27:45,559 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 143 transitions, 1000 flow [2025-03-04 15:27:45,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:45,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:45,560 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-04 15:27:45,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:27:45,560 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:45,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:45,560 INFO L85 PathProgramCache]: Analyzing trace with hash 330685333, now seen corresponding path program 2 times [2025-03-04 15:27:45,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:45,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821967257] [2025-03-04 15:27:45,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:27:45,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:45,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:27:45,570 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:27:45,570 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:27:45,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:45,598 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:27:45,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:45,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821967257] [2025-03-04 15:27:45,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821967257] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:45,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011350651] [2025-03-04 15:27:45,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:27:45,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:45,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:45,601 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:45,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:27:45,645 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:27:45,656 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:27:45,656 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:27:45,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:45,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:27:45,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:45,675 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:27:45,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:27:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:27:45,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011350651] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:27:45,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:27:45,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:27:45,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135659908] [2025-03-04 15:27:45,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:27:45,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:45,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:45,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:45,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:45,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 70 [2025-03-04 15:27:45,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 143 transitions, 1000 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:45,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:45,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 70 [2025-03-04 15:27:45,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:46,278 INFO L124 PetriNetUnfolderBase]: 3372/8698 cut-off events. [2025-03-04 15:27:46,278 INFO L125 PetriNetUnfolderBase]: For 20970/21389 co-relation queries the response was YES. [2025-03-04 15:27:46,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27003 conditions, 8698 events. 3372/8698 cut-off events. For 20970/21389 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 80902 event pairs, 2230 based on Foata normal form. 213/8428 useless extension candidates. Maximal degree in co-relation 26951. Up to 5278 conditions per place. [2025-03-04 15:27:46,338 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 80 selfloop transitions, 15 changer transitions 0/142 dead transitions. [2025-03-04 15:27:46,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 142 transitions, 1180 flow [2025-03-04 15:27:46,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:46,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:46,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2025-03-04 15:27:46,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2025-03-04 15:27:46,339 INFO L175 Difference]: Start difference. First operand has 145 places, 143 transitions, 1000 flow. Second operand 4 states and 172 transitions. [2025-03-04 15:27:46,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 142 transitions, 1180 flow [2025-03-04 15:27:46,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 142 transitions, 1166 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-04 15:27:46,390 INFO L231 Difference]: Finished difference. Result has 143 places, 142 transitions, 1006 flow [2025-03-04 15:27:46,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1006, PETRI_PLACES=143, PETRI_TRANSITIONS=142} [2025-03-04 15:27:46,390 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 77 predicate places. [2025-03-04 15:27:46,390 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 142 transitions, 1006 flow [2025-03-04 15:27:46,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:46,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:46,390 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:46,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 15:27:46,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:46,593 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:46,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:46,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1070770913, now seen corresponding path program 1 times [2025-03-04 15:27:46,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:46,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971430873] [2025-03-04 15:27:46,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:46,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:46,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:27:46,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:27:46,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:46,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:27:46,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:46,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971430873] [2025-03-04 15:27:46,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971430873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:46,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:46,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:46,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030974080] [2025-03-04 15:27:46,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:46,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:46,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:46,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:46,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:46,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 70 [2025-03-04 15:27:46,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 142 transitions, 1006 flow. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:46,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:46,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 70 [2025-03-04 15:27:46,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:47,377 INFO L124 PetriNetUnfolderBase]: 4646/10390 cut-off events. [2025-03-04 15:27:47,377 INFO L125 PetriNetUnfolderBase]: For 25534/25888 co-relation queries the response was YES. [2025-03-04 15:27:47,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33416 conditions, 10390 events. 4646/10390 cut-off events. For 25534/25888 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 90467 event pairs, 2436 based on Foata normal form. 329/10261 useless extension candidates. Maximal degree in co-relation 33297. Up to 5669 conditions per place. [2025-03-04 15:27:47,439 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 160 selfloop transitions, 7 changer transitions 0/205 dead transitions. [2025-03-04 15:27:47,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 205 transitions, 1771 flow [2025-03-04 15:27:47,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:47,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:47,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2025-03-04 15:27:47,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7107142857142857 [2025-03-04 15:27:47,440 INFO L175 Difference]: Start difference. First operand has 143 places, 142 transitions, 1006 flow. Second operand 4 states and 199 transitions. [2025-03-04 15:27:47,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 205 transitions, 1771 flow [2025-03-04 15:27:47,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 205 transitions, 1741 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:27:47,501 INFO L231 Difference]: Finished difference. Result has 145 places, 144 transitions, 1028 flow [2025-03-04 15:27:47,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1028, PETRI_PLACES=145, PETRI_TRANSITIONS=144} [2025-03-04 15:27:47,502 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 79 predicate places. [2025-03-04 15:27:47,502 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 144 transitions, 1028 flow [2025-03-04 15:27:47,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:47,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:47,502 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:47,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:27:47,503 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:47,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:47,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1322203071, now seen corresponding path program 1 times [2025-03-04 15:27:47,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:47,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43368891] [2025-03-04 15:27:47,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:47,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:47,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:27:47,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:27:47,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:47,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:47,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:27:47,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:47,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43368891] [2025-03-04 15:27:47,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43368891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:47,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:47,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:27:47,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710235704] [2025-03-04 15:27:47,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:47,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:27:47,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:47,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:27:47,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:27:47,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 70 [2025-03-04 15:27:47,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 144 transitions, 1028 flow. Second operand has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:47,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:47,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 70 [2025-03-04 15:27:47,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:48,632 INFO L124 PetriNetUnfolderBase]: 6455/13295 cut-off events. [2025-03-04 15:27:48,633 INFO L125 PetriNetUnfolderBase]: For 45163/46217 co-relation queries the response was YES. [2025-03-04 15:27:48,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45060 conditions, 13295 events. 6455/13295 cut-off events. For 45163/46217 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 114393 event pairs, 1761 based on Foata normal form. 609/13185 useless extension candidates. Maximal degree in co-relation 44955. Up to 7688 conditions per place. [2025-03-04 15:27:48,699 INFO L140 encePairwiseOnDemand]: 60/70 looper letters, 211 selfloop transitions, 34 changer transitions 0/283 dead transitions. [2025-03-04 15:27:48,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 283 transitions, 2465 flow [2025-03-04 15:27:48,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:27:48,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 15:27:48,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 411 transitions. [2025-03-04 15:27:48,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6523809523809524 [2025-03-04 15:27:48,700 INFO L175 Difference]: Start difference. First operand has 145 places, 144 transitions, 1028 flow. Second operand 9 states and 411 transitions. [2025-03-04 15:27:48,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 283 transitions, 2465 flow [2025-03-04 15:27:48,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 283 transitions, 2463 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 15:27:48,795 INFO L231 Difference]: Finished difference. Result has 155 places, 163 transitions, 1261 flow [2025-03-04 15:27:48,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1261, PETRI_PLACES=155, PETRI_TRANSITIONS=163} [2025-03-04 15:27:48,795 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 89 predicate places. [2025-03-04 15:27:48,795 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 163 transitions, 1261 flow [2025-03-04 15:27:48,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:48,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:48,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:48,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:27:48,796 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:48,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:48,796 INFO L85 PathProgramCache]: Analyzing trace with hash -2084498787, now seen corresponding path program 1 times [2025-03-04 15:27:48,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:48,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628744231] [2025-03-04 15:27:48,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:48,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:48,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:27:48,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:27:48,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:48,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:48,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:27:48,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:48,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628744231] [2025-03-04 15:27:48,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628744231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:48,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:48,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:48,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036651199] [2025-03-04 15:27:48,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:48,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:48,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:48,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:48,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:48,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 70 [2025-03-04 15:27:48,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 163 transitions, 1261 flow. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:48,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:48,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 70 [2025-03-04 15:27:48,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:49,593 INFO L124 PetriNetUnfolderBase]: 4000/9598 cut-off events. [2025-03-04 15:27:49,594 INFO L125 PetriNetUnfolderBase]: For 29425/29801 co-relation queries the response was YES. [2025-03-04 15:27:49,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33590 conditions, 9598 events. 4000/9598 cut-off events. For 29425/29801 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 87289 event pairs, 1424 based on Foata normal form. 324/9781 useless extension candidates. Maximal degree in co-relation 33481. Up to 3474 conditions per place. [2025-03-04 15:27:49,667 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 187 selfloop transitions, 4 changer transitions 0/241 dead transitions. [2025-03-04 15:27:49,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 241 transitions, 2210 flow [2025-03-04 15:27:49,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:49,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:49,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2025-03-04 15:27:49,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7607142857142857 [2025-03-04 15:27:49,668 INFO L175 Difference]: Start difference. First operand has 155 places, 163 transitions, 1261 flow. Second operand 4 states and 213 transitions. [2025-03-04 15:27:49,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 241 transitions, 2210 flow [2025-03-04 15:27:49,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 241 transitions, 2196 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-03-04 15:27:49,774 INFO L231 Difference]: Finished difference. Result has 160 places, 164 transitions, 1274 flow [2025-03-04 15:27:49,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1253, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1274, PETRI_PLACES=160, PETRI_TRANSITIONS=164} [2025-03-04 15:27:49,774 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 94 predicate places. [2025-03-04 15:27:49,774 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 164 transitions, 1274 flow [2025-03-04 15:27:49,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:49,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:49,774 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:49,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:27:49,774 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:49,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:49,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1414901118, now seen corresponding path program 1 times [2025-03-04 15:27:49,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:49,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593200000] [2025-03-04 15:27:49,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:49,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:49,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:27:49,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:27:49,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:49,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:27:49,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:49,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593200000] [2025-03-04 15:27:49,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593200000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:49,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:49,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:49,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198389864] [2025-03-04 15:27:49,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:49,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:49,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:49,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:49,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:49,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 70 [2025-03-04 15:27:49,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 164 transitions, 1274 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:49,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:49,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 70 [2025-03-04 15:27:49,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:50,939 INFO L124 PetriNetUnfolderBase]: 5799/12012 cut-off events. [2025-03-04 15:27:50,939 INFO L125 PetriNetUnfolderBase]: For 43211/44157 co-relation queries the response was YES. [2025-03-04 15:27:50,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43061 conditions, 12012 events. 5799/12012 cut-off events. For 43211/44157 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 101905 event pairs, 2255 based on Foata normal form. 572/12393 useless extension candidates. Maximal degree in co-relation 42949. Up to 5343 conditions per place. [2025-03-04 15:27:51,040 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 192 selfloop transitions, 16 changer transitions 0/253 dead transitions. [2025-03-04 15:27:51,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 253 transitions, 2471 flow [2025-03-04 15:27:51,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:51,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2025-03-04 15:27:51,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6928571428571428 [2025-03-04 15:27:51,042 INFO L175 Difference]: Start difference. First operand has 160 places, 164 transitions, 1274 flow. Second operand 4 states and 194 transitions. [2025-03-04 15:27:51,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 253 transitions, 2471 flow [2025-03-04 15:27:51,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 253 transitions, 2462 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:51,173 INFO L231 Difference]: Finished difference. Result has 164 places, 165 transitions, 1337 flow [2025-03-04 15:27:51,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1271, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1337, PETRI_PLACES=164, PETRI_TRANSITIONS=165} [2025-03-04 15:27:51,173 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 98 predicate places. [2025-03-04 15:27:51,173 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 165 transitions, 1337 flow [2025-03-04 15:27:51,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:51,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:51,174 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:51,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 15:27:51,174 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:51,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:51,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1414900125, now seen corresponding path program 1 times [2025-03-04 15:27:51,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:51,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712250309] [2025-03-04 15:27:51,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:51,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:51,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:27:51,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:27:51,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:51,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:51,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:27:51,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:51,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712250309] [2025-03-04 15:27:51,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712250309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:51,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:51,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:27:51,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673914995] [2025-03-04 15:27:51,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:51,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:27:51,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:51,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:27:51,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:27:51,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 70 [2025-03-04 15:27:51,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 165 transitions, 1337 flow. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:51,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:51,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 70 [2025-03-04 15:27:51,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:52,383 INFO L124 PetriNetUnfolderBase]: 5391/11099 cut-off events. [2025-03-04 15:27:52,383 INFO L125 PetriNetUnfolderBase]: For 45914/46759 co-relation queries the response was YES. [2025-03-04 15:27:52,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41923 conditions, 11099 events. 5391/11099 cut-off events. For 45914/46759 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 92229 event pairs, 1912 based on Foata normal form. 528/11460 useless extension candidates. Maximal degree in co-relation 41810. Up to 4678 conditions per place. [2025-03-04 15:27:52,477 INFO L140 encePairwiseOnDemand]: 62/70 looper letters, 280 selfloop transitions, 21 changer transitions 0/338 dead transitions. [2025-03-04 15:27:52,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 338 transitions, 3445 flow [2025-03-04 15:27:52,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:27:52,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:27:52,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 270 transitions. [2025-03-04 15:27:52,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-03-04 15:27:52,478 INFO L175 Difference]: Start difference. First operand has 164 places, 165 transitions, 1337 flow. Second operand 6 states and 270 transitions. [2025-03-04 15:27:52,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 338 transitions, 3445 flow [2025-03-04 15:27:52,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 338 transitions, 3383 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-04 15:27:52,591 INFO L231 Difference]: Finished difference. Result has 167 places, 166 transitions, 1336 flow [2025-03-04 15:27:52,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1336, PETRI_PLACES=167, PETRI_TRANSITIONS=166} [2025-03-04 15:27:52,591 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 101 predicate places. [2025-03-04 15:27:52,592 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 166 transitions, 1336 flow [2025-03-04 15:27:52,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:52,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:52,592 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:52,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 15:27:52,592 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:52,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:52,592 INFO L85 PathProgramCache]: Analyzing trace with hash 702819835, now seen corresponding path program 1 times [2025-03-04 15:27:52,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:52,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653962064] [2025-03-04 15:27:52,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:52,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:52,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:27:52,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:27:52,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:52,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:52,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:27:52,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:52,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653962064] [2025-03-04 15:27:52,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653962064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:52,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:52,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:52,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325720258] [2025-03-04 15:27:52,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:52,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:52,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:52,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:52,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:52,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 70 [2025-03-04 15:27:52,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 166 transitions, 1336 flow. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:52,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:52,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 70 [2025-03-04 15:27:52,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:53,493 INFO L124 PetriNetUnfolderBase]: 5192/10817 cut-off events. [2025-03-04 15:27:53,493 INFO L125 PetriNetUnfolderBase]: For 46400/47272 co-relation queries the response was YES. [2025-03-04 15:27:53,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41493 conditions, 10817 events. 5192/10817 cut-off events. For 46400/47272 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 90608 event pairs, 2705 based on Foata normal form. 542/11161 useless extension candidates. Maximal degree in co-relation 41380. Up to 6418 conditions per place. [2025-03-04 15:27:53,560 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 205 selfloop transitions, 7 changer transitions 0/255 dead transitions. [2025-03-04 15:27:53,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 255 transitions, 2551 flow [2025-03-04 15:27:53,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:53,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:53,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2025-03-04 15:27:53,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7035714285714286 [2025-03-04 15:27:53,561 INFO L175 Difference]: Start difference. First operand has 167 places, 166 transitions, 1336 flow. Second operand 4 states and 197 transitions. [2025-03-04 15:27:53,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 255 transitions, 2551 flow [2025-03-04 15:27:53,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 255 transitions, 2529 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:53,646 INFO L231 Difference]: Finished difference. Result has 170 places, 168 transitions, 1366 flow [2025-03-04 15:27:53,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1314, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1366, PETRI_PLACES=170, PETRI_TRANSITIONS=168} [2025-03-04 15:27:53,646 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 104 predicate places. [2025-03-04 15:27:53,646 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 168 transitions, 1366 flow [2025-03-04 15:27:53,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:53,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:53,647 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:53,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 15:27:53,647 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:53,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:53,647 INFO L85 PathProgramCache]: Analyzing trace with hash -606080290, now seen corresponding path program 1 times [2025-03-04 15:27:53,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:53,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052652603] [2025-03-04 15:27:53,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:53,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:53,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:27:53,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:27:53,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:53,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:27:53,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:53,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052652603] [2025-03-04 15:27:53,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052652603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:53,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:53,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:53,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940099394] [2025-03-04 15:27:53,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:53,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:53,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:53,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:53,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:53,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 70 [2025-03-04 15:27:53,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 168 transitions, 1366 flow. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:53,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:53,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 70 [2025-03-04 15:27:53,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:54,367 INFO L124 PetriNetUnfolderBase]: 4024/9234 cut-off events. [2025-03-04 15:27:54,368 INFO L125 PetriNetUnfolderBase]: For 39950/40621 co-relation queries the response was YES. [2025-03-04 15:27:54,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35911 conditions, 9234 events. 4024/9234 cut-off events. For 39950/40621 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 80972 event pairs, 1446 based on Foata normal form. 428/9621 useless extension candidates. Maximal degree in co-relation 35796. Up to 3479 conditions per place. [2025-03-04 15:27:54,437 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 197 selfloop transitions, 4 changer transitions 0/252 dead transitions. [2025-03-04 15:27:54,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 252 transitions, 2467 flow [2025-03-04 15:27:54,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:54,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2025-03-04 15:27:54,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7535714285714286 [2025-03-04 15:27:54,438 INFO L175 Difference]: Start difference. First operand has 170 places, 168 transitions, 1366 flow. Second operand 4 states and 211 transitions. [2025-03-04 15:27:54,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 252 transitions, 2467 flow [2025-03-04 15:27:54,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 252 transitions, 2465 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 15:27:54,570 INFO L231 Difference]: Finished difference. Result has 175 places, 169 transitions, 1385 flow [2025-03-04 15:27:54,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1385, PETRI_PLACES=175, PETRI_TRANSITIONS=169} [2025-03-04 15:27:54,571 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 109 predicate places. [2025-03-04 15:27:54,571 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 169 transitions, 1385 flow [2025-03-04 15:27:54,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:54,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:54,571 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:54,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 15:27:54,571 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:54,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:54,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1979385646, now seen corresponding path program 1 times [2025-03-04 15:27:54,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:54,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110321968] [2025-03-04 15:27:54,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:54,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:54,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:27:54,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:27:54,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:54,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:54,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:54,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:54,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110321968] [2025-03-04 15:27:54,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110321968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:54,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295379350] [2025-03-04 15:27:54,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:54,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:54,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:54,646 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:54,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 15:27:54,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:27:54,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:27:54,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:54,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:54,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:27:54,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:54,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:27:54,854 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:54,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295379350] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:27:54,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:27:54,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-04 15:27:54,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125504600] [2025-03-04 15:27:54,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:27:54,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 15:27:54,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:54,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 15:27:54,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-03-04 15:27:54,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 70 [2025-03-04 15:27:54,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 169 transitions, 1385 flow. Second operand has 20 states, 20 states have (on average 34.95) internal successors, (699), 20 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:54,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:54,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 70 [2025-03-04 15:27:54,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:56,342 INFO L124 PetriNetUnfolderBase]: 6277/14444 cut-off events. [2025-03-04 15:27:56,342 INFO L125 PetriNetUnfolderBase]: For 64538/65525 co-relation queries the response was YES. [2025-03-04 15:27:56,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57522 conditions, 14444 events. 6277/14444 cut-off events. For 64538/65525 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 136107 event pairs, 3022 based on Foata normal form. 516/14876 useless extension candidates. Maximal degree in co-relation 53777. Up to 6396 conditions per place. [2025-03-04 15:27:56,454 INFO L140 encePairwiseOnDemand]: 61/70 looper letters, 303 selfloop transitions, 16 changer transitions 6/376 dead transitions. [2025-03-04 15:27:56,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 376 transitions, 3881 flow [2025-03-04 15:27:56,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:27:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:27:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 439 transitions. [2025-03-04 15:27:56,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6271428571428571 [2025-03-04 15:27:56,455 INFO L175 Difference]: Start difference. First operand has 175 places, 169 transitions, 1385 flow. Second operand 10 states and 439 transitions. [2025-03-04 15:27:56,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 376 transitions, 3881 flow [2025-03-04 15:27:56,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 376 transitions, 3866 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:56,686 INFO L231 Difference]: Finished difference. Result has 187 places, 174 transitions, 1477 flow [2025-03-04 15:27:56,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1477, PETRI_PLACES=187, PETRI_TRANSITIONS=174} [2025-03-04 15:27:56,686 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 121 predicate places. [2025-03-04 15:27:56,686 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 174 transitions, 1477 flow [2025-03-04 15:27:56,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 34.95) internal successors, (699), 20 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:56,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:56,687 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:56,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:27:56,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 15:27:56,887 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:56,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:56,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1363412013, now seen corresponding path program 1 times [2025-03-04 15:27:56,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:56,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269812285] [2025-03-04 15:27:56,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:56,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:56,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:27:56,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:27:56,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:56,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:56,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:27:56,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:56,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269812285] [2025-03-04 15:27:56,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269812285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:56,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:56,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:56,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257927838] [2025-03-04 15:27:56,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:56,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:56,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:56,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:56,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:56,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 70 [2025-03-04 15:27:56,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 174 transitions, 1477 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:56,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:56,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 70 [2025-03-04 15:27:56,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:58,238 INFO L124 PetriNetUnfolderBase]: 7207/15537 cut-off events. [2025-03-04 15:27:58,238 INFO L125 PetriNetUnfolderBase]: For 76205/77241 co-relation queries the response was YES. [2025-03-04 15:27:58,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63361 conditions, 15537 events. 7207/15537 cut-off events. For 76205/77241 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 141365 event pairs, 2489 based on Foata normal form. 596/16051 useless extension candidates. Maximal degree in co-relation 59606. Up to 6043 conditions per place. [2025-03-04 15:27:58,369 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 203 selfloop transitions, 18 changer transitions 0/266 dead transitions. [2025-03-04 15:27:58,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 266 transitions, 2774 flow [2025-03-04 15:27:58,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:58,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:58,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2025-03-04 15:27:58,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675 [2025-03-04 15:27:58,370 INFO L175 Difference]: Start difference. First operand has 187 places, 174 transitions, 1477 flow. Second operand 4 states and 189 transitions. [2025-03-04 15:27:58,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 266 transitions, 2774 flow [2025-03-04 15:27:58,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 266 transitions, 2749 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 15:27:58,832 INFO L231 Difference]: Finished difference. Result has 184 places, 172 transitions, 1471 flow [2025-03-04 15:27:58,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1471, PETRI_PLACES=184, PETRI_TRANSITIONS=172} [2025-03-04 15:27:58,833 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 118 predicate places. [2025-03-04 15:27:58,833 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 172 transitions, 1471 flow [2025-03-04 15:27:58,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:58,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:58,833 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:58,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 15:27:58,833 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:27:58,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:58,834 INFO L85 PathProgramCache]: Analyzing trace with hash 525775160, now seen corresponding path program 1 times [2025-03-04 15:27:58,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:58,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549490945] [2025-03-04 15:27:58,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:58,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:58,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:27:58,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:27:58,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:58,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:27:58,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:58,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549490945] [2025-03-04 15:27:58,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549490945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:58,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:58,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:27:58,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672354681] [2025-03-04 15:27:58,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:58,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:27:58,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:58,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:27:58,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:27:59,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 70 [2025-03-04 15:27:59,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 172 transitions, 1471 flow. Second operand has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:59,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:59,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 70 [2025-03-04 15:27:59,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:02,321 INFO L124 PetriNetUnfolderBase]: 16136/31539 cut-off events. [2025-03-04 15:28:02,321 INFO L125 PetriNetUnfolderBase]: For 158136/159447 co-relation queries the response was YES. [2025-03-04 15:28:02,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130926 conditions, 31539 events. 16136/31539 cut-off events. For 158136/159447 co-relation queries the response was YES. Maximal size of possible extension queue 1109. Compared 289884 event pairs, 2298 based on Foata normal form. 978/32417 useless extension candidates. Maximal degree in co-relation 117981. Up to 10010 conditions per place. [2025-03-04 15:28:02,680 INFO L140 encePairwiseOnDemand]: 55/70 looper letters, 495 selfloop transitions, 145 changer transitions 0/674 dead transitions. [2025-03-04 15:28:02,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 674 transitions, 6851 flow [2025-03-04 15:28:02,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 15:28:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-04 15:28:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1196 transitions. [2025-03-04 15:28:02,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5511520737327189 [2025-03-04 15:28:02,682 INFO L175 Difference]: Start difference. First operand has 184 places, 172 transitions, 1471 flow. Second operand 31 states and 1196 transitions. [2025-03-04 15:28:02,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 674 transitions, 6851 flow [2025-03-04 15:28:03,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 674 transitions, 6682 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-03-04 15:28:03,692 INFO L231 Difference]: Finished difference. Result has 223 places, 288 transitions, 3087 flow [2025-03-04 15:28:03,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=3087, PETRI_PLACES=223, PETRI_TRANSITIONS=288} [2025-03-04 15:28:03,693 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 157 predicate places. [2025-03-04 15:28:03,693 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 288 transitions, 3087 flow [2025-03-04 15:28:03,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:03,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:03,693 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:03,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 15:28:03,693 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:28:03,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:03,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2128038507, now seen corresponding path program 1 times [2025-03-04 15:28:03,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:03,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778307090] [2025-03-04 15:28:03,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:03,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:03,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:28:03,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:28:03,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:03,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:28:03,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:03,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778307090] [2025-03-04 15:28:03,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778307090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:03,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:03,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:28:03,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377232000] [2025-03-04 15:28:03,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:03,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:28:03,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:03,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:28:03,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:28:03,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 70 [2025-03-04 15:28:03,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 288 transitions, 3087 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:03,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:03,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 70 [2025-03-04 15:28:03,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:07,146 INFO L124 PetriNetUnfolderBase]: 11360/24686 cut-off events. [2025-03-04 15:28:07,146 INFO L125 PetriNetUnfolderBase]: For 159367/161671 co-relation queries the response was YES. [2025-03-04 15:28:07,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107283 conditions, 24686 events. 11360/24686 cut-off events. For 159367/161671 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 239746 event pairs, 4068 based on Foata normal form. 899/25454 useless extension candidates. Maximal degree in co-relation 100728. Up to 10178 conditions per place. [2025-03-04 15:28:07,365 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 295 selfloop transitions, 36 changer transitions 0/396 dead transitions. [2025-03-04 15:28:07,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 396 transitions, 4932 flow [2025-03-04 15:28:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:28:07,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:28:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2025-03-04 15:28:07,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6821428571428572 [2025-03-04 15:28:07,365 INFO L175 Difference]: Start difference. First operand has 223 places, 288 transitions, 3087 flow. Second operand 4 states and 191 transitions. [2025-03-04 15:28:07,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 396 transitions, 4932 flow [2025-03-04 15:28:08,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 396 transitions, 4674 flow, removed 34 selfloop flow, removed 11 redundant places. [2025-03-04 15:28:08,143 INFO L231 Difference]: Finished difference. Result has 214 places, 286 transitions, 2898 flow [2025-03-04 15:28:08,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=2826, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2898, PETRI_PLACES=214, PETRI_TRANSITIONS=286} [2025-03-04 15:28:08,143 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 148 predicate places. [2025-03-04 15:28:08,143 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 286 transitions, 2898 flow [2025-03-04 15:28:08,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:08,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:08,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:08,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 15:28:08,144 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:28:08,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:08,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2128039500, now seen corresponding path program 1 times [2025-03-04 15:28:08,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:08,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506321187] [2025-03-04 15:28:08,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:08,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:08,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:28:08,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:28:08,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:08,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:08,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:08,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:08,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506321187] [2025-03-04 15:28:08,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506321187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:08,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:08,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:28:08,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496539883] [2025-03-04 15:28:08,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:08,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:28:08,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:08,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:28:08,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:28:08,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 70 [2025-03-04 15:28:08,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 286 transitions, 2898 flow. Second operand has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:08,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:08,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 70 [2025-03-04 15:28:08,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:14,016 INFO L124 PetriNetUnfolderBase]: 23812/46316 cut-off events. [2025-03-04 15:28:14,016 INFO L125 PetriNetUnfolderBase]: For 303105/305288 co-relation queries the response was YES. [2025-03-04 15:28:14,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205774 conditions, 46316 events. 23812/46316 cut-off events. For 303105/305288 co-relation queries the response was YES. Maximal size of possible extension queue 1586. Compared 448550 event pairs, 3731 based on Foata normal form. 1390/47579 useless extension candidates. Maximal degree in co-relation 182981. Up to 17458 conditions per place. [2025-03-04 15:28:14,533 INFO L140 encePairwiseOnDemand]: 55/70 looper letters, 613 selfloop transitions, 197 changer transitions 0/850 dead transitions. [2025-03-04 15:28:14,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 850 transitions, 9666 flow [2025-03-04 15:28:14,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 15:28:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-04 15:28:14,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1189 transitions. [2025-03-04 15:28:14,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5479262672811059 [2025-03-04 15:28:14,535 INFO L175 Difference]: Start difference. First operand has 214 places, 286 transitions, 2898 flow. Second operand 31 states and 1189 transitions. [2025-03-04 15:28:14,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 850 transitions, 9666 flow [2025-03-04 15:28:16,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 850 transitions, 9477 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-03-04 15:28:16,942 INFO L231 Difference]: Finished difference. Result has 255 places, 402 transitions, 4788 flow [2025-03-04 15:28:16,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=2840, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=4788, PETRI_PLACES=255, PETRI_TRANSITIONS=402} [2025-03-04 15:28:16,943 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 189 predicate places. [2025-03-04 15:28:16,943 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 402 transitions, 4788 flow [2025-03-04 15:28:16,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:16,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:16,944 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:16,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 15:28:16,944 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:28:16,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:16,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1118162477, now seen corresponding path program 1 times [2025-03-04 15:28:16,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:16,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789866417] [2025-03-04 15:28:16,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:16,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:16,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:28:16,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:28:16,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:16,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:17,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:17,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:17,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789866417] [2025-03-04 15:28:17,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789866417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:17,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069955635] [2025-03-04 15:28:17,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:17,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:17,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:17,039 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:28:17,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 15:28:17,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:28:17,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:28:17,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:17,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:17,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:28:17,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:17,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:17,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:17,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069955635] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:17,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:17,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-04 15:28:17,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339174076] [2025-03-04 15:28:17,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:17,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 15:28:17,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:17,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 15:28:17,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-03-04 15:28:17,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 70 [2025-03-04 15:28:17,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 402 transitions, 4788 flow. Second operand has 20 states, 20 states have (on average 35.05) internal successors, (701), 20 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:17,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:17,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 70 [2025-03-04 15:28:17,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:21,491 INFO L124 PetriNetUnfolderBase]: 12411/27996 cut-off events. [2025-03-04 15:28:21,491 INFO L125 PetriNetUnfolderBase]: For 215321/217922 co-relation queries the response was YES. [2025-03-04 15:28:21,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128499 conditions, 27996 events. 12411/27996 cut-off events. For 215321/217922 co-relation queries the response was YES. Maximal size of possible extension queue 893. Compared 282599 event pairs, 6454 based on Foata normal form. 1058/28917 useless extension candidates. Maximal degree in co-relation 119732. Up to 16160 conditions per place. [2025-03-04 15:28:21,718 INFO L140 encePairwiseOnDemand]: 61/70 looper letters, 386 selfloop transitions, 20 changer transitions 178/683 dead transitions. [2025-03-04 15:28:21,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 683 transitions, 9486 flow [2025-03-04 15:28:21,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:28:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:28:21,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 436 transitions. [2025-03-04 15:28:21,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6228571428571429 [2025-03-04 15:28:21,720 INFO L175 Difference]: Start difference. First operand has 255 places, 402 transitions, 4788 flow. Second operand 10 states and 436 transitions. [2025-03-04 15:28:21,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 683 transitions, 9486 flow [2025-03-04 15:28:23,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 683 transitions, 9110 flow, removed 60 selfloop flow, removed 12 redundant places. [2025-03-04 15:28:23,147 INFO L231 Difference]: Finished difference. Result has 256 places, 407 transitions, 4659 flow [2025-03-04 15:28:23,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=4522, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4659, PETRI_PLACES=256, PETRI_TRANSITIONS=407} [2025-03-04 15:28:23,148 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 190 predicate places. [2025-03-04 15:28:23,148 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 407 transitions, 4659 flow [2025-03-04 15:28:23,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 35.05) internal successors, (701), 20 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:23,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:23,148 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:23,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 15:28:23,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:23,349 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:28:23,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:23,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1730522072, now seen corresponding path program 2 times [2025-03-04 15:28:23,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:23,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235400272] [2025-03-04 15:28:23,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:28:23,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:23,353 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 15:28:23,357 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:28:23,357 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:28:23,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:23,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:23,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:23,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235400272] [2025-03-04 15:28:23,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235400272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:23,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264633052] [2025-03-04 15:28:23,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:28:23,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:23,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:23,632 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:28:23,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 15:28:23,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 15:28:23,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:28:23,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:28:23,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:23,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 15:28:23,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:23,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 15:28:23,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-04 15:28:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:23,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:23,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-04 15:28:23,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-04 15:28:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:23,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264633052] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:23,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:23,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2025-03-04 15:28:23,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105886697] [2025-03-04 15:28:23,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:23,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 15:28:23,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:23,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 15:28:23,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2025-03-04 15:28:24,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 70 [2025-03-04 15:28:24,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 407 transitions, 4659 flow. Second operand has 26 states, 26 states have (on average 31.807692307692307) internal successors, (827), 26 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:24,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:24,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 70 [2025-03-04 15:28:24,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:35,631 INFO L124 PetriNetUnfolderBase]: 31416/68360 cut-off events. [2025-03-04 15:28:35,631 INFO L125 PetriNetUnfolderBase]: For 518842/526892 co-relation queries the response was YES. [2025-03-04 15:28:36,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312073 conditions, 68360 events. 31416/68360 cut-off events. For 518842/526892 co-relation queries the response was YES. Maximal size of possible extension queue 1799. Compared 753017 event pairs, 4597 based on Foata normal form. 3243/71485 useless extension candidates. Maximal degree in co-relation 298524. Up to 8679 conditions per place. [2025-03-04 15:28:36,756 INFO L140 encePairwiseOnDemand]: 56/70 looper letters, 1555 selfloop transitions, 178 changer transitions 192/2022 dead transitions. [2025-03-04 15:28:36,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 2022 transitions, 26665 flow [2025-03-04 15:28:36,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 15:28:36,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-04 15:28:36,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 1555 transitions. [2025-03-04 15:28:36,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6346938775510204 [2025-03-04 15:28:36,758 INFO L175 Difference]: Start difference. First operand has 256 places, 407 transitions, 4659 flow. Second operand 35 states and 1555 transitions. [2025-03-04 15:28:36,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 2022 transitions, 26665 flow [2025-03-04 15:28:42,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 2022 transitions, 26632 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-04 15:28:42,190 INFO L231 Difference]: Finished difference. Result has 291 places, 514 transitions, 6471 flow [2025-03-04 15:28:42,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=4636, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=6471, PETRI_PLACES=291, PETRI_TRANSITIONS=514} [2025-03-04 15:28:42,191 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 225 predicate places. [2025-03-04 15:28:42,191 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 514 transitions, 6471 flow [2025-03-04 15:28:42,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 31.807692307692307) internal successors, (827), 26 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:42,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:42,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:42,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 15:28:42,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-04 15:28:42,392 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-04 15:28:42,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:42,393 INFO L85 PathProgramCache]: Analyzing trace with hash -683930863, now seen corresponding path program 1 times [2025-03-04 15:28:42,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:42,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629081601] [2025-03-04 15:28:42,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:42,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:42,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:28:42,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:28:42,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:42,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:42,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:42,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:42,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629081601] [2025-03-04 15:28:42,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629081601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:42,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:42,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 15:28:42,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561370982] [2025-03-04 15:28:42,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:42,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:28:42,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:42,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:28:42,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:28:42,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 70 [2025-03-04 15:28:42,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 514 transitions, 6471 flow. Second operand has 11 states, 11 states have (on average 22.818181818181817) internal successors, (251), 11 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:42,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:42,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 70 [2025-03-04 15:28:42,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand