./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-horseshoe.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-horseshoe.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 ceb2af5016fd0ad74653237fbc44a2b3541e4ff971325e3807dab6f19c05af6d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:28:17,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:28:17,806 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:28:17,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:28:17,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:28:17,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:28:17,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:28:17,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:28:17,826 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:28:17,826 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:28:17,826 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:28:17,826 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:28:17,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:28:17,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:28:17,827 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:28:17,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:28:17,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:28:17,827 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:28:17,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:28:17,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:28:17,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:28:17,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:28:17,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:28:17,828 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:28:17,828 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:28:17,828 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:28:17,828 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:28:17,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:28:17,828 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:28:17,828 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:28:17,828 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:28:17,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:28:17,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:28:17,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:28:17,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:28:17,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:28:17,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:28:17,829 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:28:17,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:28:17,829 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:28:17,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:28:17,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:28:17,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:28:17,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:28:17,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:28:17,829 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 -> ceb2af5016fd0ad74653237fbc44a2b3541e4ff971325e3807dab6f19c05af6d [2025-03-04 15:28:18,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:28:18,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:28:18,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:28:18,063 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:28:18,064 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:28:18,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c [2025-03-04 15:28:19,192 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/505aaf058/87a75d503cb948c7be394ccf116db66f/FLAG3db1d65be [2025-03-04 15:28:19,421 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:28:19,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c [2025-03-04 15:28:19,427 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/505aaf058/87a75d503cb948c7be394ccf116db66f/FLAG3db1d65be [2025-03-04 15:28:19,765 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/505aaf058/87a75d503cb948c7be394ccf116db66f [2025-03-04 15:28:19,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:28:19,768 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:28:19,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:28:19,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:28:19,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:28:19,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:28:19" (1/1) ... [2025-03-04 15:28:19,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d2d9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:19, skipping insertion in model container [2025-03-04 15:28:19,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:28:19" (1/1) ... [2025-03-04 15:28:19,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:28:19,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:28:19,947 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:28:19,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:28:19,986 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:28:19,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:19 WrapperNode [2025-03-04 15:28:19,987 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:28:19,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:28:19,988 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:28:19,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:28:19,992 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:28:19" (1/1) ... [2025-03-04 15:28:20,001 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:28:19" (1/1) ... [2025-03-04 15:28:20,031 INFO L138 Inliner]: procedures = 24, calls = 41, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 252 [2025-03-04 15:28:20,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:28:20,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:28:20,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:28:20,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:28:20,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:19" (1/1) ... [2025-03-04 15:28:20,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:19" (1/1) ... [2025-03-04 15:28:20,043 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:19" (1/1) ... [2025-03-04 15:28:20,057 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-04 15:28:20,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:19" (1/1) ... [2025-03-04 15:28:20,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:19" (1/1) ... [2025-03-04 15:28:20,067 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:19" (1/1) ... [2025-03-04 15:28:20,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:19" (1/1) ... [2025-03-04 15:28:20,070 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:19" (1/1) ... [2025-03-04 15:28:20,074 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:19" (1/1) ... [2025-03-04 15:28:20,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:28:20,076 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:28:20,076 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:28:20,077 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:28:20,078 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:19" (1/1) ... [2025-03-04 15:28:20,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:28:20,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:20,105 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:28:20,107 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:28:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:28:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:28:20,125 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:28:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:28:20,125 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:28:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:28:20,125 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:28:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:28:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:28:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:28:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:28:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:28:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:28:20,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:28:20,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:28:20,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:28:20,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:28:20,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:28:20,127 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:28:20,219 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:28:20,220 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:28:20,587 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:28:20,588 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:28:20,819 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:28:20,820 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:28:20,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:28:20 BoogieIcfgContainer [2025-03-04 15:28:20,820 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:28:20,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:28:20,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:28:20,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:28:20,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:28:19" (1/3) ... [2025-03-04 15:28:20,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47bf08c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:28:20, skipping insertion in model container [2025-03-04 15:28:20,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:19" (2/3) ... [2025-03-04 15:28:20,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47bf08c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:28:20, skipping insertion in model container [2025-03-04 15:28:20,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:28:20" (3/3) ... [2025-03-04 15:28:20,829 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-horseshoe.wvr.c [2025-03-04 15:28:20,856 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:28:20,857 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-horseshoe.wvr.c that has 4 procedures, 71 locations, 1 initial locations, 5 loop locations, and 26 error locations. [2025-03-04 15:28:20,857 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:28:20,918 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:28:20,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 77 transitions, 175 flow [2025-03-04 15:28:20,992 INFO L124 PetriNetUnfolderBase]: 7/74 cut-off events. [2025-03-04 15:28:20,994 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:28:20,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 74 events. 7/74 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 238 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2025-03-04 15:28:20,997 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 77 transitions, 175 flow [2025-03-04 15:28:21,003 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 73 transitions, 164 flow [2025-03-04 15:28:21,008 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:28:21,017 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;@44e37e3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:28:21,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2025-03-04 15:28:21,022 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:28:21,022 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:28:21,022 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:28:21,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:21,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:28:21,023 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:21,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:21,026 INFO L85 PathProgramCache]: Analyzing trace with hash 713946, now seen corresponding path program 1 times [2025-03-04 15:28:21,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:21,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643791258] [2025-03-04 15:28:21,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:21,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:21,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:28:21,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:28:21,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:21,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:21,197 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:28:21,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:21,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643791258] [2025-03-04 15:28:21,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643791258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:21,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:21,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:28:21,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743807421] [2025-03-04 15:28:21,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:21,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:28:21,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:21,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:28:21,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:28:21,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 77 [2025-03-04 15:28:21,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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:21,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:21,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 77 [2025-03-04 15:28:21,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:21,763 INFO L124 PetriNetUnfolderBase]: 2762/4730 cut-off events. [2025-03-04 15:28:21,763 INFO L125 PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES. [2025-03-04 15:28:21,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8774 conditions, 4730 events. 2762/4730 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 30565 event pairs, 2432 based on Foata normal form. 2/3392 useless extension candidates. Maximal degree in co-relation 8301. Up to 3790 conditions per place. [2025-03-04 15:28:21,806 INFO L140 encePairwiseOnDemand]: 59/77 looper letters, 41 selfloop transitions, 7 changer transitions 0/72 dead transitions. [2025-03-04 15:28:21,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 72 transitions, 258 flow [2025-03-04 15:28:21,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:28:21,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:28:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2025-03-04 15:28:21,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5422077922077922 [2025-03-04 15:28:21,819 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 164 flow. Second operand 4 states and 167 transitions. [2025-03-04 15:28:21,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 72 transitions, 258 flow [2025-03-04 15:28:21,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 72 transitions, 246 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 15:28:21,830 INFO L231 Difference]: Finished difference. Result has 71 places, 72 transitions, 198 flow [2025-03-04 15:28:21,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=71, PETRI_TRANSITIONS=72} [2025-03-04 15:28:21,835 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -5 predicate places. [2025-03-04 15:28:21,835 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 72 transitions, 198 flow [2025-03-04 15:28:21,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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:21,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:21,836 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:28:21,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:28:21,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:21,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:21,837 INFO L85 PathProgramCache]: Analyzing trace with hash -205012986, now seen corresponding path program 1 times [2025-03-04 15:28:21,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:21,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168507614] [2025-03-04 15:28:21,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:21,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:21,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:28:21,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:28:21,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:21,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:21,964 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:28:21,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:21,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168507614] [2025-03-04 15:28:21,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168507614] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:21,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672770905] [2025-03-04 15:28:21,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:21,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:21,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:21,968 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:28:21,969 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:28:22,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:28:22,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:28:22,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:22,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:22,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:28:22,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:22,074 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:28:22,074 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:28:22,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672770905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:22,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:28:22,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:28:22,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418432776] [2025-03-04 15:28:22,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:22,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:28:22,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:22,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:28:22,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:28:22,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 77 [2025-03-04 15:28:22,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 72 transitions, 198 flow. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 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:22,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:22,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 77 [2025-03-04 15:28:22,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:22,503 INFO L124 PetriNetUnfolderBase]: 2762/4728 cut-off events. [2025-03-04 15:28:22,503 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-04 15:28:22,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8636 conditions, 4728 events. 2762/4728 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 30547 event pairs, 2432 based on Foata normal form. 2/3393 useless extension candidates. Maximal degree in co-relation 8586. Up to 3780 conditions per place. [2025-03-04 15:28:22,533 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 34 selfloop transitions, 12 changer transitions 0/70 dead transitions. [2025-03-04 15:28:22,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 70 transitions, 282 flow [2025-03-04 15:28:22,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:28:22,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:28:22,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2025-03-04 15:28:22,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-03-04 15:28:22,538 INFO L175 Difference]: Start difference. First operand has 71 places, 72 transitions, 198 flow. Second operand 6 states and 210 transitions. [2025-03-04 15:28:22,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 70 transitions, 282 flow [2025-03-04 15:28:22,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 70 transitions, 282 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:28:22,541 INFO L231 Difference]: Finished difference. Result has 74 places, 70 transitions, 214 flow [2025-03-04 15:28:22,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=74, PETRI_TRANSITIONS=70} [2025-03-04 15:28:22,542 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -2 predicate places. [2025-03-04 15:28:22,542 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 70 transitions, 214 flow [2025-03-04 15:28:22,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 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:22,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:22,543 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:28:22,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 15:28:22,748 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:28:22,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:22,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:22,749 INFO L85 PathProgramCache]: Analyzing trace with hash -2060434609, now seen corresponding path program 1 times [2025-03-04 15:28:22,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:22,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729868211] [2025-03-04 15:28:22,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:22,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:22,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:28:22,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:28:22,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:22,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:22,864 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:28:22,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:22,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729868211] [2025-03-04 15:28:22,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729868211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:22,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077946181] [2025-03-04 15:28:22,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:22,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:22,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:22,867 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:28:22,868 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:28:22,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:28:22,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:28:22,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:22,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:22,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:28:22,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:22,955 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:28:22,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:22,990 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:28:22,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077946181] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:22,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:22,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:28:22,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76389602] [2025-03-04 15:28:22,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:22,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:28:22,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:22,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:28:22,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:28:23,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 77 [2025-03-04 15:28:23,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 70 transitions, 214 flow. Second operand has 12 states, 12 states have (on average 28.083333333333332) internal successors, (337), 12 states have internal predecessors, (337), 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,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:23,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 77 [2025-03-04 15:28:23,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:23,484 INFO L124 PetriNetUnfolderBase]: 2768/4752 cut-off events. [2025-03-04 15:28:23,484 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-03-04 15:28:23,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8730 conditions, 4752 events. 2768/4752 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 30838 event pairs, 2432 based on Foata normal form. 6/3420 useless extension candidates. Maximal degree in co-relation 8588. Up to 3791 conditions per place. [2025-03-04 15:28:23,514 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 39 selfloop transitions, 25 changer transitions 0/88 dead transitions. [2025-03-04 15:28:23,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 88 transitions, 456 flow [2025-03-04 15:28:23,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:28:23,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:28:23,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 340 transitions. [2025-03-04 15:28:23,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2025-03-04 15:28:23,518 INFO L175 Difference]: Start difference. First operand has 74 places, 70 transitions, 214 flow. Second operand 10 states and 340 transitions. [2025-03-04 15:28:23,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 88 transitions, 456 flow [2025-03-04 15:28:23,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 88 transitions, 398 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-04 15:28:23,522 INFO L231 Difference]: Finished difference. Result has 81 places, 88 transitions, 354 flow [2025-03-04 15:28:23,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=354, PETRI_PLACES=81, PETRI_TRANSITIONS=88} [2025-03-04 15:28:23,523 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 5 predicate places. [2025-03-04 15:28:23,523 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 88 transitions, 354 flow [2025-03-04 15:28:23,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 28.083333333333332) internal successors, (337), 12 states have internal predecessors, (337), 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,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:23,524 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:23,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:28:23,724 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:28:23,725 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:23,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:23,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1973757943, now seen corresponding path program 1 times [2025-03-04 15:28:23,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:23,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072953389] [2025-03-04 15:28:23,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:23,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:23,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:28:23,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:28:23,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:23,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:23,820 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:28:23,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:23,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072953389] [2025-03-04 15:28:23,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072953389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:23,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:23,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:28:23,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216078962] [2025-03-04 15:28:23,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:23,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:28:23,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:23,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:28:23,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:28:23,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 77 [2025-03-04 15:28:23,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 88 transitions, 354 flow. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:23,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 77 [2025-03-04 15:28:23,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:24,164 INFO L124 PetriNetUnfolderBase]: 2911/5051 cut-off events. [2025-03-04 15:28:24,164 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2025-03-04 15:28:24,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9319 conditions, 5051 events. 2911/5051 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 32892 event pairs, 2559 based on Foata normal form. 101/3780 useless extension candidates. Maximal degree in co-relation 9223. Up to 3806 conditions per place. [2025-03-04 15:28:24,182 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 87 selfloop transitions, 3 changer transitions 1/117 dead transitions. [2025-03-04 15:28:24,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 117 transitions, 670 flow [2025-03-04 15:28:24,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:28:24,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:28:24,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2025-03-04 15:28:24,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6103896103896104 [2025-03-04 15:28:24,184 INFO L175 Difference]: Start difference. First operand has 81 places, 88 transitions, 354 flow. Second operand 4 states and 188 transitions. [2025-03-04 15:28:24,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 117 transitions, 670 flow [2025-03-04 15:28:24,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 117 transitions, 636 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-04 15:28:24,188 INFO L231 Difference]: Finished difference. Result has 83 places, 88 transitions, 349 flow [2025-03-04 15:28:24,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=349, PETRI_PLACES=83, PETRI_TRANSITIONS=88} [2025-03-04 15:28:24,188 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 7 predicate places. [2025-03-04 15:28:24,188 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 88 transitions, 349 flow [2025-03-04 15:28:24,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:24,189 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:24,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:28:24,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:24,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:24,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1352547637, now seen corresponding path program 1 times [2025-03-04 15:28:24,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:24,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528046326] [2025-03-04 15:28:24,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:24,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:24,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:28:24,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:28:24,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:24,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:24,326 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:28:24,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:24,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528046326] [2025-03-04 15:28:24,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528046326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:24,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896698431] [2025-03-04 15:28:24,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:24,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:24,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:24,329 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:28:24,331 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:28:24,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:28:24,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:28:24,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:24,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:24,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:28:24,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:24,409 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:28:24,409 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:28:24,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896698431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:24,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:28:24,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-03-04 15:28:24,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235501472] [2025-03-04 15:28:24,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:24,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:28:24,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:24,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:28:24,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:28:24,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 77 [2025-03-04 15:28:24,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 88 transitions, 349 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:24,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:24,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 77 [2025-03-04 15:28:24,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:24,666 INFO L124 PetriNetUnfolderBase]: 2012/3458 cut-off events. [2025-03-04 15:28:24,666 INFO L125 PetriNetUnfolderBase]: For 424/424 co-relation queries the response was YES. [2025-03-04 15:28:24,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6839 conditions, 3458 events. 2012/3458 cut-off events. For 424/424 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 20487 event pairs, 1754 based on Foata normal form. 0/2788 useless extension candidates. Maximal degree in co-relation 6745. Up to 2847 conditions per place. [2025-03-04 15:28:24,682 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 58 selfloop transitions, 1 changer transitions 0/85 dead transitions. [2025-03-04 15:28:24,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 85 transitions, 455 flow [2025-03-04 15:28:24,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:28:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:28:24,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2025-03-04 15:28:24,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5670995670995671 [2025-03-04 15:28:24,684 INFO L175 Difference]: Start difference. First operand has 83 places, 88 transitions, 349 flow. Second operand 3 states and 131 transitions. [2025-03-04 15:28:24,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 85 transitions, 455 flow [2025-03-04 15:28:24,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 85 transitions, 451 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 15:28:24,688 INFO L231 Difference]: Finished difference. Result has 81 places, 85 transitions, 335 flow [2025-03-04 15:28:24,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=335, PETRI_PLACES=81, PETRI_TRANSITIONS=85} [2025-03-04 15:28:24,689 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 5 predicate places. [2025-03-04 15:28:24,690 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 85 transitions, 335 flow [2025-03-04 15:28:24,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:24,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:24,691 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:24,697 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:28:24,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:24,892 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:24,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:24,892 INFO L85 PathProgramCache]: Analyzing trace with hash 926545217, now seen corresponding path program 1 times [2025-03-04 15:28:24,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:24,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973637356] [2025-03-04 15:28:24,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:24,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:24,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:28:24,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:28:24,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:24,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:24,939 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:28:24,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:24,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973637356] [2025-03-04 15:28:24,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973637356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:24,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:24,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:28:24,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201395460] [2025-03-04 15:28:24,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:24,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:28:24,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:24,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:28:24,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:28:24,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 77 [2025-03-04 15:28:24,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 85 transitions, 335 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:24,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 77 [2025-03-04 15:28:24,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:25,256 INFO L124 PetriNetUnfolderBase]: 2002/3382 cut-off events. [2025-03-04 15:28:25,256 INFO L125 PetriNetUnfolderBase]: For 495/495 co-relation queries the response was YES. [2025-03-04 15:28:25,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6894 conditions, 3382 events. 2002/3382 cut-off events. For 495/495 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 19107 event pairs, 750 based on Foata normal form. 90/2767 useless extension candidates. Maximal degree in co-relation 6879. Up to 2102 conditions per place. [2025-03-04 15:28:25,270 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 73 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-03-04 15:28:25,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 101 transitions, 525 flow [2025-03-04 15:28:25,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:28:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:28:25,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2025-03-04 15:28:25,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6320346320346321 [2025-03-04 15:28:25,272 INFO L175 Difference]: Start difference. First operand has 81 places, 85 transitions, 335 flow. Second operand 3 states and 146 transitions. [2025-03-04 15:28:25,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 101 transitions, 525 flow [2025-03-04 15:28:25,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 101 transitions, 516 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:28:25,275 INFO L231 Difference]: Finished difference. Result has 82 places, 86 transitions, 340 flow [2025-03-04 15:28:25,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=82, PETRI_TRANSITIONS=86} [2025-03-04 15:28:25,276 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 6 predicate places. [2025-03-04 15:28:25,276 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 86 transitions, 340 flow [2025-03-04 15:28:25,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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:25,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:25,276 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:25,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:28:25,276 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:25,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:25,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1576787783, now seen corresponding path program 1 times [2025-03-04 15:28:25,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:25,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095444501] [2025-03-04 15:28:25,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:25,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:25,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:28:25,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:28:25,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:25,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:25,322 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:28:25,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:25,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095444501] [2025-03-04 15:28:25,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095444501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:25,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:25,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:28:25,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842667563] [2025-03-04 15:28:25,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:25,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:28:25,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:25,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:28:25,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:28:25,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 77 [2025-03-04 15:28:25,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 86 transitions, 340 flow. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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:25,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:25,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 77 [2025-03-04 15:28:25,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:25,710 INFO L124 PetriNetUnfolderBase]: 3986/6773 cut-off events. [2025-03-04 15:28:25,710 INFO L125 PetriNetUnfolderBase]: For 1028/1028 co-relation queries the response was YES. [2025-03-04 15:28:25,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14036 conditions, 6773 events. 3986/6773 cut-off events. For 1028/1028 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 43538 event pairs, 2542 based on Foata normal form. 136/5756 useless extension candidates. Maximal degree in co-relation 14020. Up to 4306 conditions per place. [2025-03-04 15:28:25,738 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 101 selfloop transitions, 4 changer transitions 0/128 dead transitions. [2025-03-04 15:28:25,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 128 transitions, 662 flow [2025-03-04 15:28:25,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:28:25,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:28:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2025-03-04 15:28:25,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6233766233766234 [2025-03-04 15:28:25,740 INFO L175 Difference]: Start difference. First operand has 82 places, 86 transitions, 340 flow. Second operand 4 states and 192 transitions. [2025-03-04 15:28:25,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 128 transitions, 662 flow [2025-03-04 15:28:25,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 128 transitions, 658 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:28:25,742 INFO L231 Difference]: Finished difference. Result has 86 places, 89 transitions, 367 flow [2025-03-04 15:28:25,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=367, PETRI_PLACES=86, PETRI_TRANSITIONS=89} [2025-03-04 15:28:25,742 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 10 predicate places. [2025-03-04 15:28:25,742 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 89 transitions, 367 flow [2025-03-04 15:28:25,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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:25,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:25,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:25,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:28:25,743 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:25,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:25,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1617025495, now seen corresponding path program 1 times [2025-03-04 15:28:25,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:25,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088995850] [2025-03-04 15:28:25,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:25,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:25,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:28:25,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:28:25,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:25,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:25,791 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:28:25,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:25,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088995850] [2025-03-04 15:28:25,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088995850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:25,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:25,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:28:25,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550909676] [2025-03-04 15:28:25,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:25,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:28:25,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:25,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:28:25,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:28:25,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 77 [2025-03-04 15:28:25,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 89 transitions, 367 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:25,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:25,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 77 [2025-03-04 15:28:25,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:26,008 INFO L124 PetriNetUnfolderBase]: 2115/3777 cut-off events. [2025-03-04 15:28:26,009 INFO L125 PetriNetUnfolderBase]: For 1138/1438 co-relation queries the response was YES. [2025-03-04 15:28:26,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8451 conditions, 3777 events. 2115/3777 cut-off events. For 1138/1438 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 23354 event pairs, 948 based on Foata normal form. 134/3286 useless extension candidates. Maximal degree in co-relation 8433. Up to 2794 conditions per place. [2025-03-04 15:28:26,026 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 68 selfloop transitions, 3 changer transitions 0/98 dead transitions. [2025-03-04 15:28:26,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 98 transitions, 533 flow [2025-03-04 15:28:26,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:28:26,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:28:26,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2025-03-04 15:28:26,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6017316017316018 [2025-03-04 15:28:26,027 INFO L175 Difference]: Start difference. First operand has 86 places, 89 transitions, 367 flow. Second operand 3 states and 139 transitions. [2025-03-04 15:28:26,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 98 transitions, 533 flow [2025-03-04 15:28:26,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 98 transitions, 530 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:28:26,030 INFO L231 Difference]: Finished difference. Result has 88 places, 91 transitions, 387 flow [2025-03-04 15:28:26,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=88, PETRI_TRANSITIONS=91} [2025-03-04 15:28:26,031 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 12 predicate places. [2025-03-04 15:28:26,031 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 91 transitions, 387 flow [2025-03-04 15:28:26,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:26,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:26,031 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:26,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:28:26,031 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:26,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:26,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1046907704, now seen corresponding path program 1 times [2025-03-04 15:28:26,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:26,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777796924] [2025-03-04 15:28:26,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:26,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:26,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:28:26,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:28:26,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:26,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:26,120 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:28:26,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:26,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777796924] [2025-03-04 15:28:26,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777796924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:26,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:26,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:28:26,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119412017] [2025-03-04 15:28:26,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:26,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:28:26,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:26,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:28:26,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:28:26,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 77 [2025-03-04 15:28:26,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 91 transitions, 387 flow. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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:26,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:26,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 77 [2025-03-04 15:28:26,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:26,413 INFO L124 PetriNetUnfolderBase]: 2434/4244 cut-off events. [2025-03-04 15:28:26,413 INFO L125 PetriNetUnfolderBase]: For 2207/2639 co-relation queries the response was YES. [2025-03-04 15:28:26,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10093 conditions, 4244 events. 2434/4244 cut-off events. For 2207/2639 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 25447 event pairs, 1929 based on Foata normal form. 222/3840 useless extension candidates. Maximal degree in co-relation 10073. Up to 2998 conditions per place. [2025-03-04 15:28:26,430 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 69 selfloop transitions, 9 changer transitions 6/111 dead transitions. [2025-03-04 15:28:26,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 111 transitions, 631 flow [2025-03-04 15:28:26,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:28:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:28:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 216 transitions. [2025-03-04 15:28:26,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.561038961038961 [2025-03-04 15:28:26,432 INFO L175 Difference]: Start difference. First operand has 88 places, 91 transitions, 387 flow. Second operand 5 states and 216 transitions. [2025-03-04 15:28:26,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 111 transitions, 631 flow [2025-03-04 15:28:26,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 111 transitions, 614 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 15:28:26,435 INFO L231 Difference]: Finished difference. Result has 92 places, 91 transitions, 410 flow [2025-03-04 15:28:26,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=410, PETRI_PLACES=92, PETRI_TRANSITIONS=91} [2025-03-04 15:28:26,436 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 16 predicate places. [2025-03-04 15:28:26,436 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 91 transitions, 410 flow [2025-03-04 15:28:26,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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:26,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:26,437 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-04 15:28:26,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:28:26,437 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:26,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:26,437 INFO L85 PathProgramCache]: Analyzing trace with hash 490993659, now seen corresponding path program 2 times [2025-03-04 15:28:26,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:26,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659276305] [2025-03-04 15:28:26,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:28:26,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:26,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:28:26,447 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:28:26,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:28:26,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:28:26,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:26,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659276305] [2025-03-04 15:28:26,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659276305] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:26,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368345367] [2025-03-04 15:28:26,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:28:26,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:26,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:26,490 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:28:26,492 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:28:26,531 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:28:26,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:28:26,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:28:26,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:26,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:28:26,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:28:26,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:26,583 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:28:26,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368345367] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:26,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:26,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:28:26,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398056196] [2025-03-04 15:28:26,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:26,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:28:26,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:26,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:28:26,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:28:26,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 77 [2025-03-04 15:28:26,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 91 transitions, 410 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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:26,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:26,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 77 [2025-03-04 15:28:26,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:26,852 INFO L124 PetriNetUnfolderBase]: 2434/4251 cut-off events. [2025-03-04 15:28:26,853 INFO L125 PetriNetUnfolderBase]: For 1488/1920 co-relation queries the response was YES. [2025-03-04 15:28:26,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9992 conditions, 4251 events. 2434/4251 cut-off events. For 1488/1920 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 25578 event pairs, 1929 based on Foata normal form. 149/3773 useless extension candidates. Maximal degree in co-relation 9970. Up to 3513 conditions per place. [2025-03-04 15:28:26,864 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 37 selfloop transitions, 26 changer transitions 1/89 dead transitions. [2025-03-04 15:28:26,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 89 transitions, 518 flow [2025-03-04 15:28:26,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:28:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:28:26,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2025-03-04 15:28:26,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4707792207792208 [2025-03-04 15:28:26,865 INFO L175 Difference]: Start difference. First operand has 92 places, 91 transitions, 410 flow. Second operand 4 states and 145 transitions. [2025-03-04 15:28:26,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 89 transitions, 518 flow [2025-03-04 15:28:26,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 89 transitions, 493 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-04 15:28:26,867 INFO L231 Difference]: Finished difference. Result has 87 places, 88 transitions, 411 flow [2025-03-04 15:28:26,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=411, PETRI_PLACES=87, PETRI_TRANSITIONS=88} [2025-03-04 15:28:26,869 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 11 predicate places. [2025-03-04 15:28:26,869 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 88 transitions, 411 flow [2025-03-04 15:28:26,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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:26,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:26,869 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:26,875 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:28:27,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:27,070 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:27,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:27,071 INFO L85 PathProgramCache]: Analyzing trace with hash -28432740, now seen corresponding path program 1 times [2025-03-04 15:28:27,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:27,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596122910] [2025-03-04 15:28:27,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:27,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:27,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:28:27,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:28:27,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:27,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:27,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:27,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:27,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596122910] [2025-03-04 15:28:27,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596122910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:27,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929333900] [2025-03-04 15:28:27,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:27,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:27,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:27,199 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:28:27,202 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:28:27,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:28:27,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:28:27,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:27,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:27,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:28:27,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:27,349 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:27,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:27,465 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:27,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929333900] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:27,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:27,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 15:28:27,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457642719] [2025-03-04 15:28:27,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:27,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 15:28:27,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:27,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:28:27,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:28:27,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 77 [2025-03-04 15:28:27,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 88 transitions, 411 flow. Second operand has 15 states, 15 states have (on average 28.6) internal successors, (429), 15 states have internal predecessors, (429), 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:27,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:27,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 77 [2025-03-04 15:28:27,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:28,066 INFO L124 PetriNetUnfolderBase]: 4011/7234 cut-off events. [2025-03-04 15:28:28,066 INFO L125 PetriNetUnfolderBase]: For 2574/3126 co-relation queries the response was YES. [2025-03-04 15:28:28,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16669 conditions, 7234 events. 4011/7234 cut-off events. For 2574/3126 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 50421 event pairs, 2633 based on Foata normal form. 578/6658 useless extension candidates. Maximal degree in co-relation 16651. Up to 3342 conditions per place. [2025-03-04 15:28:28,092 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 82 selfloop transitions, 32 changer transitions 1/140 dead transitions. [2025-03-04 15:28:28,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 140 transitions, 872 flow [2025-03-04 15:28:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:28:28,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 15:28:28,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 326 transitions. [2025-03-04 15:28:28,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4704184704184704 [2025-03-04 15:28:28,094 INFO L175 Difference]: Start difference. First operand has 87 places, 88 transitions, 411 flow. Second operand 9 states and 326 transitions. [2025-03-04 15:28:28,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 140 transitions, 872 flow [2025-03-04 15:28:28,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 140 transitions, 782 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 15:28:28,098 INFO L231 Difference]: Finished difference. Result has 94 places, 100 transitions, 538 flow [2025-03-04 15:28:28,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=538, PETRI_PLACES=94, PETRI_TRANSITIONS=100} [2025-03-04 15:28:28,098 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 18 predicate places. [2025-03-04 15:28:28,099 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 100 transitions, 538 flow [2025-03-04 15:28:28,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 28.6) internal successors, (429), 15 states have internal predecessors, (429), 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:28,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:28,099 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:28:28,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 15:28:28,303 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:28:28,303 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:28,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:28,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1146095419, now seen corresponding path program 1 times [2025-03-04 15:28:28,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:28,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560385689] [2025-03-04 15:28:28,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:28,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:28,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:28:28,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:28:28,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:28,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:28,819 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:28:28,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:28,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560385689] [2025-03-04 15:28:28,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560385689] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:28,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704630317] [2025-03-04 15:28:28,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:28,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:28,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:28,822 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:28:28,825 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:28:28,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:28:28,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:28:28,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:28,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:28,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:28:28,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:28,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-04 15:28:28,932 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 23 treesize of output 1 [2025-03-04 15:28:28,989 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:28:28,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:28:29,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 15:28:29,065 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:28:29,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:29,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:28:29,406 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 44 [2025-03-04 15:28:29,418 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:28:29,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 53 [2025-03-04 15:28:29,428 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 15:28:29,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 [2025-03-04 15:28:29,479 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:28:29,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704630317] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:29,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:29,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2025-03-04 15:28:29,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67623640] [2025-03-04 15:28:29,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:29,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 15:28:29,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:29,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 15:28:29,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=383, Unknown=3, NotChecked=0, Total=462 [2025-03-04 15:28:29,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 77 [2025-03-04 15:28:29,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 100 transitions, 538 flow. Second operand has 22 states, 22 states have (on average 22.272727272727273) internal successors, (490), 22 states have internal predecessors, (490), 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:29,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:29,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 77 [2025-03-04 15:28:29,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:31,339 INFO L124 PetriNetUnfolderBase]: 6244/10353 cut-off events. [2025-03-04 15:28:31,339 INFO L125 PetriNetUnfolderBase]: For 4198/5038 co-relation queries the response was YES. [2025-03-04 15:28:31,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24789 conditions, 10353 events. 6244/10353 cut-off events. For 4198/5038 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 69942 event pairs, 1771 based on Foata normal form. 376/9063 useless extension candidates. Maximal degree in co-relation 24768. Up to 3102 conditions per place. [2025-03-04 15:28:31,376 INFO L140 encePairwiseOnDemand]: 62/77 looper letters, 197 selfloop transitions, 52 changer transitions 2/269 dead transitions. [2025-03-04 15:28:31,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 269 transitions, 1607 flow [2025-03-04 15:28:31,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 15:28:31,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 15:28:31,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 644 transitions. [2025-03-04 15:28:31,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39826839826839827 [2025-03-04 15:28:31,378 INFO L175 Difference]: Start difference. First operand has 94 places, 100 transitions, 538 flow. Second operand 21 states and 644 transitions. [2025-03-04 15:28:31,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 269 transitions, 1607 flow [2025-03-04 15:28:31,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 269 transitions, 1605 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:28:31,384 INFO L231 Difference]: Finished difference. Result has 121 places, 128 transitions, 896 flow [2025-03-04 15:28:31,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=896, PETRI_PLACES=121, PETRI_TRANSITIONS=128} [2025-03-04 15:28:31,384 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 45 predicate places. [2025-03-04 15:28:31,384 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 128 transitions, 896 flow [2025-03-04 15:28:31,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 22.272727272727273) internal successors, (490), 22 states have internal predecessors, (490), 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:31,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:31,385 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:28:31,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 15:28:31,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:31,589 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:31,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:31,589 INFO L85 PathProgramCache]: Analyzing trace with hash -85464520, now seen corresponding path program 1 times [2025-03-04 15:28:31,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:31,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833531659] [2025-03-04 15:28:31,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:31,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:31,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:28:31,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:28:31,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:31,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:31,958 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:28:31,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:31,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833531659] [2025-03-04 15:28:31,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833531659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:31,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197422013] [2025-03-04 15:28:31,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:31,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:31,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:31,960 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:28:31,961 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:28:32,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:28:32,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:28:32,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:32,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:32,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:28:32,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:32,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:28:32,068 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:28:32,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197422013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:32,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:28:32,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 10 [2025-03-04 15:28:32,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278103995] [2025-03-04 15:28:32,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:32,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:28:32,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:32,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:28:32,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:28:32,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 77 [2025-03-04 15:28:32,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 128 transitions, 896 flow. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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:32,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:32,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 77 [2025-03-04 15:28:32,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:32,665 INFO L124 PetriNetUnfolderBase]: 5196/9568 cut-off events. [2025-03-04 15:28:32,666 INFO L125 PetriNetUnfolderBase]: For 8027/8557 co-relation queries the response was YES. [2025-03-04 15:28:32,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25206 conditions, 9568 events. 5196/9568 cut-off events. For 8027/8557 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 72104 event pairs, 951 based on Foata normal form. 350/9222 useless extension candidates. Maximal degree in co-relation 25176. Up to 3398 conditions per place. [2025-03-04 15:28:32,714 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 134 selfloop transitions, 15 changer transitions 0/173 dead transitions. [2025-03-04 15:28:32,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 173 transitions, 1366 flow [2025-03-04 15:28:32,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:28:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:28:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 231 transitions. [2025-03-04 15:28:32,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 15:28:32,715 INFO L175 Difference]: Start difference. First operand has 121 places, 128 transitions, 896 flow. Second operand 5 states and 231 transitions. [2025-03-04 15:28:32,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 173 transitions, 1366 flow [2025-03-04 15:28:32,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 173 transitions, 1327 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-03-04 15:28:32,729 INFO L231 Difference]: Finished difference. Result has 124 places, 132 transitions, 950 flow [2025-03-04 15:28:32,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=950, PETRI_PLACES=124, PETRI_TRANSITIONS=132} [2025-03-04 15:28:32,729 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 48 predicate places. [2025-03-04 15:28:32,729 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 132 transitions, 950 flow [2025-03-04 15:28:32,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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:32,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:32,730 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:28:32,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:28:32,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:32,930 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:32,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:32,930 INFO L85 PathProgramCache]: Analyzing trace with hash -85464518, now seen corresponding path program 1 times [2025-03-04 15:28:32,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:32,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935162537] [2025-03-04 15:28:32,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:32,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:32,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:28:32,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:28:32,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:32,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:33,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:33,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:33,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935162537] [2025-03-04 15:28:33,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935162537] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:33,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657719912] [2025-03-04 15:28:33,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:33,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:33,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:33,021 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:28:33,022 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:28:33,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:28:33,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:28:33,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:33,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:33,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:28:33,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:33,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:28:33,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:28:33,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657719912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:33,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:28:33,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-04 15:28:33,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130143308] [2025-03-04 15:28:33,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:33,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:28:33,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:33,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:28:33,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:28:33,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 77 [2025-03-04 15:28:33,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 132 transitions, 950 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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:33,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:33,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 77 [2025-03-04 15:28:33,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:33,621 INFO L124 PetriNetUnfolderBase]: 3985/7504 cut-off events. [2025-03-04 15:28:33,621 INFO L125 PetriNetUnfolderBase]: For 12615/13222 co-relation queries the response was YES. [2025-03-04 15:28:33,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20441 conditions, 7504 events. 3985/7504 cut-off events. For 12615/13222 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 55602 event pairs, 3289 based on Foata normal form. 528/7509 useless extension candidates. Maximal degree in co-relation 20408. Up to 5889 conditions per place. [2025-03-04 15:28:33,660 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 102 selfloop transitions, 1 changer transitions 0/129 dead transitions. [2025-03-04 15:28:33,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 129 transitions, 1138 flow [2025-03-04 15:28:33,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:28:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:28:33,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-03-04 15:28:33,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5541125541125541 [2025-03-04 15:28:33,661 INFO L175 Difference]: Start difference. First operand has 124 places, 132 transitions, 950 flow. Second operand 3 states and 128 transitions. [2025-03-04 15:28:33,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 129 transitions, 1138 flow [2025-03-04 15:28:33,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 129 transitions, 1130 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:28:33,678 INFO L231 Difference]: Finished difference. Result has 123 places, 129 transitions, 926 flow [2025-03-04 15:28:33,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=926, PETRI_PLACES=123, PETRI_TRANSITIONS=129} [2025-03-04 15:28:33,678 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 47 predicate places. [2025-03-04 15:28:33,679 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 129 transitions, 926 flow [2025-03-04 15:28:33,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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:33,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:33,679 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:28:33,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 15:28:33,879 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,SelfDestructingSolverStorable13 [2025-03-04 15:28:33,879 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:33,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:33,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1134509604, now seen corresponding path program 1 times [2025-03-04 15:28:33,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:33,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924920845] [2025-03-04 15:28:33,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:33,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:33,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:28:33,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:28:33,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:33,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:34,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:34,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:34,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924920845] [2025-03-04 15:28:34,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924920845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:34,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733493442] [2025-03-04 15:28:34,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:34,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:34,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:34,084 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:34,085 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:34,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:28:34,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:28:34,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:34,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:34,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:28:34,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:34,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:28:34,191 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:28:34,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733493442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:34,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:28:34,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2025-03-04 15:28:34,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929018922] [2025-03-04 15:28:34,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:34,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:28:34,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:34,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:28:34,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:28:34,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-04 15:28:34,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 129 transitions, 926 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:28:34,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:34,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-04 15:28:34,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:34,741 INFO L124 PetriNetUnfolderBase]: 4489/8179 cut-off events. [2025-03-04 15:28:34,742 INFO L125 PetriNetUnfolderBase]: For 9499/9991 co-relation queries the response was YES. [2025-03-04 15:28:34,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22479 conditions, 8179 events. 4489/8179 cut-off events. For 9499/9991 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 58074 event pairs, 1582 based on Foata normal form. 320/8024 useless extension candidates. Maximal degree in co-relation 22445. Up to 4425 conditions per place. [2025-03-04 15:28:34,789 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 125 selfloop transitions, 14 changer transitions 0/162 dead transitions. [2025-03-04 15:28:34,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 162 transitions, 1315 flow [2025-03-04 15:28:34,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:28:34,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:28:34,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2025-03-04 15:28:34,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5688311688311688 [2025-03-04 15:28:34,791 INFO L175 Difference]: Start difference. First operand has 123 places, 129 transitions, 926 flow. Second operand 5 states and 219 transitions. [2025-03-04 15:28:34,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 162 transitions, 1315 flow [2025-03-04 15:28:34,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 162 transitions, 1314 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:28:34,819 INFO L231 Difference]: Finished difference. Result has 128 places, 129 transitions, 984 flow [2025-03-04 15:28:34,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=984, PETRI_PLACES=128, PETRI_TRANSITIONS=129} [2025-03-04 15:28:34,820 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 52 predicate places. [2025-03-04 15:28:34,820 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 129 transitions, 984 flow [2025-03-04 15:28:34,820 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:28:34,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:34,820 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:28:34,826 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:35,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 15:28:35,021 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:35,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:35,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1645567999, now seen corresponding path program 1 times [2025-03-04 15:28:35,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:35,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085785590] [2025-03-04 15:28:35,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:35,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:35,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:28:35,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:28:35,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:35,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:35,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:28:35,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:35,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085785590] [2025-03-04 15:28:35,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085785590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:35,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:35,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:28:35,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255620933] [2025-03-04 15:28:35,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:35,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:28:35,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:35,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:28:35,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:28:35,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 77 [2025-03-04 15:28:35,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 129 transitions, 984 flow. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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:35,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:35,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 77 [2025-03-04 15:28:35,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:35,551 INFO L124 PetriNetUnfolderBase]: 5063/8304 cut-off events. [2025-03-04 15:28:35,551 INFO L125 PetriNetUnfolderBase]: For 13152/13953 co-relation queries the response was YES. [2025-03-04 15:28:35,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24521 conditions, 8304 events. 5063/8304 cut-off events. For 13152/13953 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 53253 event pairs, 1442 based on Foata normal form. 540/8402 useless extension candidates. Maximal degree in co-relation 24484. Up to 4047 conditions per place. [2025-03-04 15:28:35,591 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 128 selfloop transitions, 4 changer transitions 0/156 dead transitions. [2025-03-04 15:28:35,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 156 transitions, 1336 flow [2025-03-04 15:28:35,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:28:35,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:28:35,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2025-03-04 15:28:35,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5746753246753247 [2025-03-04 15:28:35,592 INFO L175 Difference]: Start difference. First operand has 128 places, 129 transitions, 984 flow. Second operand 4 states and 177 transitions. [2025-03-04 15:28:35,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 156 transitions, 1336 flow [2025-03-04 15:28:35,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 156 transitions, 1309 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 15:28:35,620 INFO L231 Difference]: Finished difference. Result has 130 places, 130 transitions, 974 flow [2025-03-04 15:28:35,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=974, PETRI_PLACES=130, PETRI_TRANSITIONS=130} [2025-03-04 15:28:35,621 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 54 predicate places. [2025-03-04 15:28:35,621 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 130 transitions, 974 flow [2025-03-04 15:28:35,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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:35,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:35,621 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:35,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:28:35,621 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:35,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:35,622 INFO L85 PathProgramCache]: Analyzing trace with hash -559545144, now seen corresponding path program 2 times [2025-03-04 15:28:35,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:35,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603911662] [2025-03-04 15:28:35,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:28:35,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:35,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 15:28:35,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:28:35,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:28:35,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:28:35,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:35,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603911662] [2025-03-04 15:28:35,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603911662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:35,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643753348] [2025-03-04 15:28:35,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:28:35,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:35,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:35,679 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:35,683 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:35,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 15:28:35,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:28:35,750 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:28:35,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:35,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:28:35,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:28:35,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:28:35,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643753348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:35,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:28:35,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 15:28:35,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347681324] [2025-03-04 15:28:35,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:35,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:28:35,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:35,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:28:35,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:28:35,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 77 [2025-03-04 15:28:35,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 130 transitions, 974 flow. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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:35,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:35,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 77 [2025-03-04 15:28:35,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:36,434 INFO L124 PetriNetUnfolderBase]: 6123/10354 cut-off events. [2025-03-04 15:28:36,435 INFO L125 PetriNetUnfolderBase]: For 22674/22908 co-relation queries the response was YES. [2025-03-04 15:28:36,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31207 conditions, 10354 events. 6123/10354 cut-off events. For 22674/22908 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 70143 event pairs, 1898 based on Foata normal form. 252/10210 useless extension candidates. Maximal degree in co-relation 31169. Up to 3378 conditions per place. [2025-03-04 15:28:36,517 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 156 selfloop transitions, 7 changer transitions 0/185 dead transitions. [2025-03-04 15:28:36,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 185 transitions, 1666 flow [2025-03-04 15:28:36,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:28:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:28:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2025-03-04 15:28:36,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5746753246753247 [2025-03-04 15:28:36,519 INFO L175 Difference]: Start difference. First operand has 130 places, 130 transitions, 974 flow. Second operand 4 states and 177 transitions. [2025-03-04 15:28:36,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 185 transitions, 1666 flow [2025-03-04 15:28:36,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 185 transitions, 1655 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:28:36,622 INFO L231 Difference]: Finished difference. Result has 130 places, 129 transitions, 979 flow [2025-03-04 15:28:36,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=979, PETRI_PLACES=130, PETRI_TRANSITIONS=129} [2025-03-04 15:28:36,622 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 54 predicate places. [2025-03-04 15:28:36,623 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 129 transitions, 979 flow [2025-03-04 15:28:36,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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:36,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:36,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:36,629 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:36,824 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,SelfDestructingSolverStorable16 [2025-03-04 15:28:36,824 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:36,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:36,824 INFO L85 PathProgramCache]: Analyzing trace with hash 982669021, now seen corresponding path program 1 times [2025-03-04 15:28:36,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:36,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451291853] [2025-03-04 15:28:36,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:36,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:36,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:28:36,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:28:36,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:36,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:37,172 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:28:37,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:37,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451291853] [2025-03-04 15:28:37,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451291853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:37,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542540053] [2025-03-04 15:28:37,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:37,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:37,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:37,175 INFO L229 MonitoredProcess]: Starting monitored process 12 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:37,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 15:28:37,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:28:37,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:28:37,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:37,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:37,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:28:37,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:28:37,316 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:28:37,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542540053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:37,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:28:37,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 10 [2025-03-04 15:28:37,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612126357] [2025-03-04 15:28:37,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:37,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:28:37,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:37,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:28:37,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:28:37,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-04 15:28:37,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 129 transitions, 979 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:28:37,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:37,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-04 15:28:37,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:37,918 INFO L124 PetriNetUnfolderBase]: 4333/7771 cut-off events. [2025-03-04 15:28:37,918 INFO L125 PetriNetUnfolderBase]: For 14836/15165 co-relation queries the response was YES. [2025-03-04 15:28:37,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23988 conditions, 7771 events. 4333/7771 cut-off events. For 14836/15165 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 53763 event pairs, 665 based on Foata normal form. 323/7933 useless extension candidates. Maximal degree in co-relation 23951. Up to 4094 conditions per place. [2025-03-04 15:28:37,953 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 133 selfloop transitions, 12 changer transitions 0/167 dead transitions. [2025-03-04 15:28:37,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 167 transitions, 1414 flow [2025-03-04 15:28:37,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:28:37,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:28:37,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 221 transitions. [2025-03-04 15:28:37,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.574025974025974 [2025-03-04 15:28:37,954 INFO L175 Difference]: Start difference. First operand has 130 places, 129 transitions, 979 flow. Second operand 5 states and 221 transitions. [2025-03-04 15:28:37,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 167 transitions, 1414 flow [2025-03-04 15:28:37,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 167 transitions, 1388 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:28:37,980 INFO L231 Difference]: Finished difference. Result has 132 places, 130 transitions, 1001 flow [2025-03-04 15:28:37,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1001, PETRI_PLACES=132, PETRI_TRANSITIONS=130} [2025-03-04 15:28:37,981 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 56 predicate places. [2025-03-04 15:28:37,981 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 130 transitions, 1001 flow [2025-03-04 15:28:37,981 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:28:37,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:37,981 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:37,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 15:28:38,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 15:28:38,182 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:38,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:38,182 INFO L85 PathProgramCache]: Analyzing trace with hash 696481093, now seen corresponding path program 1 times [2025-03-04 15:28:38,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:38,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92843336] [2025-03-04 15:28:38,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:38,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:38,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:28:38,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:28:38,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:38,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:38,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:38,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:38,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92843336] [2025-03-04 15:28:38,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92843336] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:38,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021142785] [2025-03-04 15:28:38,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:38,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:38,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:38,475 INFO L229 MonitoredProcess]: Starting monitored process 13 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:38,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 15:28:38,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:28:38,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:28:38,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:38,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:38,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:28:38,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:38,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:28:38,627 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:28:38,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021142785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:38,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:28:38,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2025-03-04 15:28:38,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139864794] [2025-03-04 15:28:38,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:38,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:28:38,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:38,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:28:38,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:28:38,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 77 [2025-03-04 15:28:38,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 130 transitions, 1001 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:28:38,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:38,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 77 [2025-03-04 15:28:38,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:39,342 INFO L124 PetriNetUnfolderBase]: 4813/8380 cut-off events. [2025-03-04 15:28:39,342 INFO L125 PetriNetUnfolderBase]: For 14824/15220 co-relation queries the response was YES. [2025-03-04 15:28:39,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25177 conditions, 8380 events. 4813/8380 cut-off events. For 14824/15220 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 56533 event pairs, 2075 based on Foata normal form. 316/8395 useless extension candidates. Maximal degree in co-relation 25138. Up to 5722 conditions per place. [2025-03-04 15:28:39,398 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 129 selfloop transitions, 10 changer transitions 0/160 dead transitions. [2025-03-04 15:28:39,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 160 transitions, 1368 flow [2025-03-04 15:28:39,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:28:39,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:28:39,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 213 transitions. [2025-03-04 15:28:39,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5532467532467532 [2025-03-04 15:28:39,399 INFO L175 Difference]: Start difference. First operand has 132 places, 130 transitions, 1001 flow. Second operand 5 states and 213 transitions. [2025-03-04 15:28:39,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 160 transitions, 1368 flow [2025-03-04 15:28:39,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 160 transitions, 1348 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:28:39,430 INFO L231 Difference]: Finished difference. Result has 134 places, 130 transitions, 1005 flow [2025-03-04 15:28:39,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1005, PETRI_PLACES=134, PETRI_TRANSITIONS=130} [2025-03-04 15:28:39,431 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 58 predicate places. [2025-03-04 15:28:39,431 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 130 transitions, 1005 flow [2025-03-04 15:28:39,431 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:28:39,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:39,431 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:39,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 15:28:39,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:39,632 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:39,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:39,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1849894263, now seen corresponding path program 1 times [2025-03-04 15:28:39,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:39,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875895818] [2025-03-04 15:28:39,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:39,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:39,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:28:39,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:28:39,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:39,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:40,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:40,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875895818] [2025-03-04 15:28:40,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875895818] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:40,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824511029] [2025-03-04 15:28:40,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:40,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:40,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:40,384 INFO L229 MonitoredProcess]: Starting monitored process 14 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:40,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 15:28:40,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:28:40,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:28:40,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:40,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:40,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 15:28:40,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:28:40,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:40,582 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:28:40,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2025-03-04 15:28:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:28:40,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824511029] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:40,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 15:28:40,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11, 5] total 18 [2025-03-04 15:28:40,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806687746] [2025-03-04 15:28:40,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:40,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:28:40,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:40,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:28:40,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-04 15:28:40,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 77 [2025-03-04 15:28:40,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 130 transitions, 1005 flow. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:40,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:40,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 77 [2025-03-04 15:28:40,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:41,184 INFO L124 PetriNetUnfolderBase]: 4220/7777 cut-off events. [2025-03-04 15:28:41,184 INFO L125 PetriNetUnfolderBase]: For 12929/13259 co-relation queries the response was YES. [2025-03-04 15:28:41,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22809 conditions, 7777 events. 4220/7777 cut-off events. For 12929/13259 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 54962 event pairs, 685 based on Foata normal form. 268/7818 useless extension candidates. Maximal degree in co-relation 22769. Up to 3824 conditions per place. [2025-03-04 15:28:41,224 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 114 selfloop transitions, 21 changer transitions 0/160 dead transitions. [2025-03-04 15:28:41,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 160 transitions, 1347 flow [2025-03-04 15:28:41,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:28:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:28:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 220 transitions. [2025-03-04 15:28:41,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-04 15:28:41,225 INFO L175 Difference]: Start difference. First operand has 134 places, 130 transitions, 1005 flow. Second operand 5 states and 220 transitions. [2025-03-04 15:28:41,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 160 transitions, 1347 flow [2025-03-04 15:28:41,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 160 transitions, 1328 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:28:41,250 INFO L231 Difference]: Finished difference. Result has 134 places, 128 transitions, 1000 flow [2025-03-04 15:28:41,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1000, PETRI_PLACES=134, PETRI_TRANSITIONS=128} [2025-03-04 15:28:41,251 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 58 predicate places. [2025-03-04 15:28:41,251 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 128 transitions, 1000 flow [2025-03-04 15:28:41,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:41,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:41,251 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:41,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 15:28:41,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-04 15:28:41,452 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:41,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:41,453 INFO L85 PathProgramCache]: Analyzing trace with hash -166029595, now seen corresponding path program 1 times [2025-03-04 15:28:41,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:41,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519609795] [2025-03-04 15:28:41,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:41,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:41,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:28:41,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:28:41,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:41,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:41,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:28:41,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:41,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519609795] [2025-03-04 15:28:41,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519609795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:41,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656227227] [2025-03-04 15:28:41,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:41,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:41,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:41,500 INFO L229 MonitoredProcess]: Starting monitored process 15 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:41,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 15:28:41,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:28:41,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:28:41,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:41,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:41,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:28:41,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:28:41,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:28:41,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656227227] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:41,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:41,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:28:41,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702302415] [2025-03-04 15:28:41,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:41,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:28:41,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:41,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:28:41,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:28:41,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 77 [2025-03-04 15:28:41,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 128 transitions, 1000 flow. Second operand has 12 states, 12 states have (on average 30.0) internal successors, (360), 12 states have internal predecessors, (360), 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:41,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:41,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 77 [2025-03-04 15:28:41,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:42,891 INFO L124 PetriNetUnfolderBase]: 8711/14971 cut-off events. [2025-03-04 15:28:42,892 INFO L125 PetriNetUnfolderBase]: For 44118/44610 co-relation queries the response was YES. [2025-03-04 15:28:42,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46799 conditions, 14971 events. 8711/14971 cut-off events. For 44118/44610 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 104437 event pairs, 2233 based on Foata normal form. 66/14734 useless extension candidates. Maximal degree in co-relation 46760. Up to 6075 conditions per place. [2025-03-04 15:28:42,976 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 295 selfloop transitions, 13 changer transitions 0/331 dead transitions. [2025-03-04 15:28:42,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 331 transitions, 3014 flow [2025-03-04 15:28:42,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:28:42,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:28:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 462 transitions. [2025-03-04 15:28:42,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 15:28:42,977 INFO L175 Difference]: Start difference. First operand has 134 places, 128 transitions, 1000 flow. Second operand 10 states and 462 transitions. [2025-03-04 15:28:42,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 331 transitions, 3014 flow [2025-03-04 15:28:43,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 331 transitions, 2975 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:28:43,024 INFO L231 Difference]: Finished difference. Result has 144 places, 137 transitions, 1060 flow [2025-03-04 15:28:43,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=980, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1060, PETRI_PLACES=144, PETRI_TRANSITIONS=137} [2025-03-04 15:28:43,024 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 68 predicate places. [2025-03-04 15:28:43,024 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 137 transitions, 1060 flow [2025-03-04 15:28:43,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 30.0) internal successors, (360), 12 states have internal predecessors, (360), 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:43,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:43,025 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:43,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 15:28:43,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:43,225 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:43,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:43,226 INFO L85 PathProgramCache]: Analyzing trace with hash -425869786, now seen corresponding path program 1 times [2025-03-04 15:28:43,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:43,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764990248] [2025-03-04 15:28:43,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:43,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:43,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:28:43,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:28:43,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:43,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:43,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:43,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764990248] [2025-03-04 15:28:43,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764990248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:43,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255515400] [2025-03-04 15:28:43,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:43,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:43,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:43,450 INFO L229 MonitoredProcess]: Starting monitored process 16 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:43,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 15:28:43,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:28:43,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:28:43,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:43,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:43,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:28:43,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:43,572 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 23 treesize of output 1 [2025-03-04 15:28:43,831 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:28:43,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:43,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:44,103 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 19 [2025-03-04 15:28:44,107 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 28 treesize of output 22 [2025-03-04 15:28:44,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:44,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255515400] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:44,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:44,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-03-04 15:28:44,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882756605] [2025-03-04 15:28:44,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:44,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:28:44,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:44,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:28:44,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2025-03-04 15:28:44,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 77 [2025-03-04 15:28:44,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 137 transitions, 1060 flow. Second operand has 23 states, 23 states have (on average 21.608695652173914) internal successors, (497), 23 states have internal predecessors, (497), 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:44,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:44,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 77 [2025-03-04 15:28:44,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:47,909 INFO L124 PetriNetUnfolderBase]: 19826/31144 cut-off events. [2025-03-04 15:28:47,910 INFO L125 PetriNetUnfolderBase]: For 90194/91790 co-relation queries the response was YES. [2025-03-04 15:28:48,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109632 conditions, 31144 events. 19826/31144 cut-off events. For 90194/91790 co-relation queries the response was YES. Maximal size of possible extension queue 911. Compared 228845 event pairs, 3458 based on Foata normal form. 0/29808 useless extension candidates. Maximal degree in co-relation 109590. Up to 4259 conditions per place. [2025-03-04 15:28:48,293 INFO L140 encePairwiseOnDemand]: 61/77 looper letters, 363 selfloop transitions, 68 changer transitions 10/462 dead transitions. [2025-03-04 15:28:48,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 462 transitions, 4031 flow [2025-03-04 15:28:48,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 15:28:48,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 15:28:48,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 678 transitions. [2025-03-04 15:28:48,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38283455674760025 [2025-03-04 15:28:48,295 INFO L175 Difference]: Start difference. First operand has 144 places, 137 transitions, 1060 flow. Second operand 23 states and 678 transitions. [2025-03-04 15:28:48,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 462 transitions, 4031 flow [2025-03-04 15:28:48,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 462 transitions, 3824 flow, removed 88 selfloop flow, removed 3 redundant places. [2025-03-04 15:28:48,434 INFO L231 Difference]: Finished difference. Result has 168 places, 157 transitions, 1368 flow [2025-03-04 15:28:48,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1368, PETRI_PLACES=168, PETRI_TRANSITIONS=157} [2025-03-04 15:28:48,434 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 92 predicate places. [2025-03-04 15:28:48,434 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 157 transitions, 1368 flow [2025-03-04 15:28:48,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 21.608695652173914) internal successors, (497), 23 states have internal predecessors, (497), 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:48,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:48,435 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] [2025-03-04 15:28:48,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 15:28:48,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:48,635 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:48,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:48,636 INFO L85 PathProgramCache]: Analyzing trace with hash -587717569, now seen corresponding path program 1 times [2025-03-04 15:28:48,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:48,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542106048] [2025-03-04 15:28:48,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:48,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:48,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:28:48,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:28:48,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:48,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:48,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:48,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542106048] [2025-03-04 15:28:48,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542106048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:48,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877556778] [2025-03-04 15:28:48,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:48,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:48,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:48,759 INFO L229 MonitoredProcess]: Starting monitored process 17 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:48,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 15:28:48,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:28:48,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:28:48,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:48,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:48,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:28:48,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:48,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:49,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:49,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877556778] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:49,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:49,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2025-03-04 15:28:49,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172339275] [2025-03-04 15:28:49,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:49,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 15:28:49,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:49,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 15:28:49,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-04 15:28:49,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 77 [2025-03-04 15:28:49,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 157 transitions, 1368 flow. Second operand has 16 states, 16 states have (on average 29.3125) internal successors, (469), 16 states have internal predecessors, (469), 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:49,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:49,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 77 [2025-03-04 15:28:49,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:51,264 INFO L124 PetriNetUnfolderBase]: 12376/22907 cut-off events. [2025-03-04 15:28:51,265 INFO L125 PetriNetUnfolderBase]: For 63621/64335 co-relation queries the response was YES. [2025-03-04 15:28:51,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78208 conditions, 22907 events. 12376/22907 cut-off events. For 63621/64335 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 189644 event pairs, 4499 based on Foata normal form. 68/22511 useless extension candidates. Maximal degree in co-relation 78160. Up to 15243 conditions per place. [2025-03-04 15:28:51,482 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 122 selfloop transitions, 45 changer transitions 0/199 dead transitions. [2025-03-04 15:28:51,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 199 transitions, 1791 flow [2025-03-04 15:28:51,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:28:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:28:51,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 390 transitions. [2025-03-04 15:28:51,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4604486422668241 [2025-03-04 15:28:51,483 INFO L175 Difference]: Start difference. First operand has 168 places, 157 transitions, 1368 flow. Second operand 11 states and 390 transitions. [2025-03-04 15:28:51,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 199 transitions, 1791 flow [2025-03-04 15:28:51,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 199 transitions, 1690 flow, removed 16 selfloop flow, removed 9 redundant places. [2025-03-04 15:28:51,735 INFO L231 Difference]: Finished difference. Result has 169 places, 150 transitions, 1282 flow [2025-03-04 15:28:51,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1192, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1282, PETRI_PLACES=169, PETRI_TRANSITIONS=150} [2025-03-04 15:28:51,736 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 93 predicate places. [2025-03-04 15:28:51,736 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 150 transitions, 1282 flow [2025-03-04 15:28:51,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 29.3125) internal successors, (469), 16 states have internal predecessors, (469), 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:51,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:51,736 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:51,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 15:28:51,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 15:28:51,937 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:51,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:51,937 INFO L85 PathProgramCache]: Analyzing trace with hash 45137308, now seen corresponding path program 1 times [2025-03-04 15:28:51,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:51,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764826370] [2025-03-04 15:28:51,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:51,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:51,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:28:51,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:51,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:51,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:52,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:52,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:52,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764826370] [2025-03-04 15:28:52,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764826370] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:52,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983518748] [2025-03-04 15:28:52,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:52,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:52,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:52,147 INFO L229 MonitoredProcess]: Starting monitored process 18 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:52,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 15:28:52,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:28:52,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:28:52,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:52,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:52,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 15:28:52,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:52,267 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 23 treesize of output 1 [2025-03-04 15:28:52,519 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:28:52,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:52,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:52,823 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 20 treesize of output 18 [2025-03-04 15:28:52,826 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 26 treesize of output 20 [2025-03-04 15:28:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:52,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983518748] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:52,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:52,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-03-04 15:28:52,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604876236] [2025-03-04 15:28:52,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:52,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:28:52,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:52,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:28:52,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2025-03-04 15:28:53,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 77 [2025-03-04 15:28:53,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 150 transitions, 1282 flow. Second operand has 23 states, 23 states have (on average 22.608695652173914) internal successors, (520), 23 states have internal predecessors, (520), 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:53,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:53,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 77 [2025-03-04 15:28:53,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:56,793 INFO L124 PetriNetUnfolderBase]: 17597/29169 cut-off events. [2025-03-04 15:28:56,793 INFO L125 PetriNetUnfolderBase]: For 76223/77474 co-relation queries the response was YES. [2025-03-04 15:28:56,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101832 conditions, 29169 events. 17597/29169 cut-off events. For 76223/77474 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 225892 event pairs, 5831 based on Foata normal form. 641/29725 useless extension candidates. Maximal degree in co-relation 101785. Up to 5346 conditions per place. [2025-03-04 15:28:56,965 INFO L140 encePairwiseOnDemand]: 61/77 looper letters, 342 selfloop transitions, 64 changer transitions 10/439 dead transitions. [2025-03-04 15:28:56,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 439 transitions, 3785 flow [2025-03-04 15:28:56,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 15:28:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 15:28:56,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 702 transitions. [2025-03-04 15:28:56,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.396386222473179 [2025-03-04 15:28:56,966 INFO L175 Difference]: Start difference. First operand has 169 places, 150 transitions, 1282 flow. Second operand 23 states and 702 transitions. [2025-03-04 15:28:56,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 439 transitions, 3785 flow [2025-03-04 15:28:57,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 439 transitions, 3634 flow, removed 8 selfloop flow, removed 11 redundant places. [2025-03-04 15:28:57,199 INFO L231 Difference]: Finished difference. Result has 185 places, 154 transitions, 1356 flow [2025-03-04 15:28:57,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1356, PETRI_PLACES=185, PETRI_TRANSITIONS=154} [2025-03-04 15:28:57,200 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 109 predicate places. [2025-03-04 15:28:57,200 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 154 transitions, 1356 flow [2025-03-04 15:28:57,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 22.608695652173914) internal successors, (520), 23 states have internal predecessors, (520), 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:57,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:57,200 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, 1] [2025-03-04 15:28:57,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 15:28:57,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:57,401 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:28:57,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:57,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1627147926, now seen corresponding path program 1 times [2025-03-04 15:28:57,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:57,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680923536] [2025-03-04 15:28:57,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:57,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:57,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:28:57,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:28:57,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:57,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:57,448 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:28:57,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:57,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680923536] [2025-03-04 15:28:57,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680923536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:57,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:57,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:28:57,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550103354] [2025-03-04 15:28:57,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:57,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:28:57,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:57,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:28:57,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:28:57,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 77 [2025-03-04 15:28:57,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 154 transitions, 1356 flow. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 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:57,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:57,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 77 [2025-03-04 15:28:57,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:02,280 INFO L124 PetriNetUnfolderBase]: 25746/47983 cut-off events. [2025-03-04 15:29:02,280 INFO L125 PetriNetUnfolderBase]: For 162056/163779 co-relation queries the response was YES. [2025-03-04 15:29:02,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167972 conditions, 47983 events. 25746/47983 cut-off events. For 162056/163779 co-relation queries the response was YES. Maximal size of possible extension queue 1241. Compared 429805 event pairs, 5988 based on Foata normal form. 899/48531 useless extension candidates. Maximal degree in co-relation 167923. Up to 15558 conditions per place. [2025-03-04 15:29:02,806 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 197 selfloop transitions, 19 changer transitions 0/250 dead transitions. [2025-03-04 15:29:02,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 250 transitions, 2518 flow [2025-03-04 15:29:02,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:02,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2025-03-04 15:29:02,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6655844155844156 [2025-03-04 15:29:02,807 INFO L175 Difference]: Start difference. First operand has 185 places, 154 transitions, 1356 flow. Second operand 4 states and 205 transitions. [2025-03-04 15:29:02,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 250 transitions, 2518 flow [2025-03-04 15:29:03,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 250 transitions, 2368 flow, removed 2 selfloop flow, removed 17 redundant places. [2025-03-04 15:29:03,791 INFO L231 Difference]: Finished difference. Result has 173 places, 162 transitions, 1412 flow [2025-03-04 15:29:03,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1412, PETRI_PLACES=173, PETRI_TRANSITIONS=162} [2025-03-04 15:29:03,792 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 97 predicate places. [2025-03-04 15:29:03,792 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 162 transitions, 1412 flow [2025-03-04 15:29:03,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 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:29:03,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:03,792 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, 1, 1, 1] [2025-03-04 15:29:03,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 15:29:03,792 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:29:03,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:03,792 INFO L85 PathProgramCache]: Analyzing trace with hash 932216872, now seen corresponding path program 1 times [2025-03-04 15:29:03,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:03,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958028718] [2025-03-04 15:29:03,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:03,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:03,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:29:03,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:29:03,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:03,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:03,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:03,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:03,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958028718] [2025-03-04 15:29:03,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958028718] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:03,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570965299] [2025-03-04 15:29:03,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:03,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:03,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:03,913 INFO L229 MonitoredProcess]: Starting monitored process 19 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:29:03,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 15:29:03,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:29:03,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:29:03,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:03,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:03,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:29:03,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:04,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:04,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:04,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570965299] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:04,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:04,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2025-03-04 15:29:04,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255445504] [2025-03-04 15:29:04,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:04,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 15:29:04,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:04,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 15:29:04,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-04 15:29:04,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 77 [2025-03-04 15:29:04,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 162 transitions, 1412 flow. Second operand has 16 states, 16 states have (on average 29.25) internal successors, (468), 16 states have internal predecessors, (468), 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:29:04,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:04,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 77 [2025-03-04 15:29:04,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:08,525 INFO L124 PetriNetUnfolderBase]: 25636/46196 cut-off events. [2025-03-04 15:29:08,526 INFO L125 PetriNetUnfolderBase]: For 186182/188059 co-relation queries the response was YES. [2025-03-04 15:29:08,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170456 conditions, 46196 events. 25636/46196 cut-off events. For 186182/188059 co-relation queries the response was YES. Maximal size of possible extension queue 1210. Compared 405279 event pairs, 7737 based on Foata normal form. 1151/46212 useless extension candidates. Maximal degree in co-relation 170406. Up to 21420 conditions per place. [2025-03-04 15:29:09,104 INFO L140 encePairwiseOnDemand]: 66/77 looper letters, 209 selfloop transitions, 51 changer transitions 2/296 dead transitions. [2025-03-04 15:29:09,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 296 transitions, 2782 flow [2025-03-04 15:29:09,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:29:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:29:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 525 transitions. [2025-03-04 15:29:09,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-03-04 15:29:09,105 INFO L175 Difference]: Start difference. First operand has 173 places, 162 transitions, 1412 flow. Second operand 15 states and 525 transitions. [2025-03-04 15:29:09,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 296 transitions, 2782 flow [2025-03-04 15:29:09,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 296 transitions, 2714 flow, removed 34 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:09,981 INFO L231 Difference]: Finished difference. Result has 187 places, 160 transitions, 1492 flow [2025-03-04 15:29:09,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1342, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1492, PETRI_PLACES=187, PETRI_TRANSITIONS=160} [2025-03-04 15:29:09,982 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 111 predicate places. [2025-03-04 15:29:09,982 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 160 transitions, 1492 flow [2025-03-04 15:29:09,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 29.25) internal successors, (468), 16 states have internal predecessors, (468), 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:29:09,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:09,982 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 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:29:09,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 15:29:10,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:10,183 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:29:10,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:10,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1615152196, now seen corresponding path program 2 times [2025-03-04 15:29:10,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:10,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909889572] [2025-03-04 15:29:10,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:10,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:10,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 15:29:10,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 30 statements. [2025-03-04 15:29:10,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:29:10,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 15:29:10,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:10,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909889572] [2025-03-04 15:29:10,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909889572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:10,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:10,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:10,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525381909] [2025-03-04 15:29:10,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:10,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:29:10,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:10,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:29:10,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:29:10,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 77 [2025-03-04 15:29:10,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 160 transitions, 1492 flow. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 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:29:10,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:10,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 77 [2025-03-04 15:29:10,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:15,057 INFO L124 PetriNetUnfolderBase]: 30298/51708 cut-off events. [2025-03-04 15:29:15,057 INFO L125 PetriNetUnfolderBase]: For 221589/224276 co-relation queries the response was YES. [2025-03-04 15:29:15,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195610 conditions, 51708 events. 30298/51708 cut-off events. For 221589/224276 co-relation queries the response was YES. Maximal size of possible extension queue 1286. Compared 434506 event pairs, 5258 based on Foata normal form. 617/52007 useless extension candidates. Maximal degree in co-relation 195557. Up to 18361 conditions per place. [2025-03-04 15:29:15,796 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 205 selfloop transitions, 13 changer transitions 0/241 dead transitions. [2025-03-04 15:29:15,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 241 transitions, 2484 flow [2025-03-04 15:29:15,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:29:15,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:29:15,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 203 transitions. [2025-03-04 15:29:15,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2025-03-04 15:29:15,797 INFO L175 Difference]: Start difference. First operand has 187 places, 160 transitions, 1492 flow. Second operand 5 states and 203 transitions. [2025-03-04 15:29:15,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 241 transitions, 2484 flow [2025-03-04 15:29:17,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 241 transitions, 2411 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-03-04 15:29:17,009 INFO L231 Difference]: Finished difference. Result has 183 places, 160 transitions, 1453 flow [2025-03-04 15:29:17,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1419, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1453, PETRI_PLACES=183, PETRI_TRANSITIONS=160} [2025-03-04 15:29:17,009 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 107 predicate places. [2025-03-04 15:29:17,009 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 160 transitions, 1453 flow [2025-03-04 15:29:17,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 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:29:17,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:17,010 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, 1, 1, 1, 1, 1] [2025-03-04 15:29:17,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 15:29:17,010 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:29:17,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:17,010 INFO L85 PathProgramCache]: Analyzing trace with hash 937355969, now seen corresponding path program 2 times [2025-03-04 15:29:17,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:17,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150279056] [2025-03-04 15:29:17,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:17,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:17,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 15:29:17,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:29:17,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:29:17,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:17,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:29:17,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:17,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150279056] [2025-03-04 15:29:17,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150279056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:17,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:17,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:29:17,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310008607] [2025-03-04 15:29:17,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:17,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:29:17,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:17,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:29:17,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:29:17,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 77 [2025-03-04 15:29:17,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 160 transitions, 1453 flow. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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:29:17,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:17,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 77 [2025-03-04 15:29:17,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:23,834 INFO L124 PetriNetUnfolderBase]: 35778/64753 cut-off events. [2025-03-04 15:29:23,834 INFO L125 PetriNetUnfolderBase]: For 326686/330050 co-relation queries the response was YES. [2025-03-04 15:29:24,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252681 conditions, 64753 events. 35778/64753 cut-off events. For 326686/330050 co-relation queries the response was YES. Maximal size of possible extension queue 1573. Compared 592820 event pairs, 10180 based on Foata normal form. 959/63730 useless extension candidates. Maximal degree in co-relation 252627. Up to 20777 conditions per place. [2025-03-04 15:29:24,561 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 188 selfloop transitions, 16 changer transitions 2/240 dead transitions. [2025-03-04 15:29:24,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 240 transitions, 2483 flow [2025-03-04 15:29:24,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:24,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:24,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2025-03-04 15:29:24,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6461038961038961 [2025-03-04 15:29:24,562 INFO L175 Difference]: Start difference. First operand has 183 places, 160 transitions, 1453 flow. Second operand 4 states and 199 transitions. [2025-03-04 15:29:24,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 240 transitions, 2483 flow [2025-03-04 15:29:26,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 240 transitions, 2428 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-04 15:29:26,447 INFO L231 Difference]: Finished difference. Result has 182 places, 167 transitions, 1571 flow [2025-03-04 15:29:26,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1419, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1571, PETRI_PLACES=182, PETRI_TRANSITIONS=167} [2025-03-04 15:29:26,448 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 106 predicate places. [2025-03-04 15:29:26,448 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 167 transitions, 1571 flow [2025-03-04 15:29:26,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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:29:26,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:26,448 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:26,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 15:29:26,448 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 44 more)] === [2025-03-04 15:29:26,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:26,449 INFO L85 PathProgramCache]: Analyzing trace with hash -482649895, now seen corresponding path program 1 times [2025-03-04 15:29:26,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:26,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129180579] [2025-03-04 15:29:26,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:26,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:26,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:29:26,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:29:26,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:26,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:26,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:29:26,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:26,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129180579] [2025-03-04 15:29:26,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129180579] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:26,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018625420] [2025-03-04 15:29:26,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:26,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:26,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:26,524 INFO L229 MonitoredProcess]: Starting monitored process 20 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:29:26,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 15:29:26,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:29:26,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:29:26,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:26,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:26,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:29:26,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:26,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:29:26,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:26,722 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:29:26,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018625420] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:26,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:26,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 15:29:26,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384853094] [2025-03-04 15:29:26,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:26,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 15:29:26,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:26,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:29:26,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:29:26,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 77 [2025-03-04 15:29:26,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 167 transitions, 1571 flow. Second operand has 15 states, 15 states have (on average 29.333333333333332) internal successors, (440), 15 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:29:26,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:26,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 77 [2025-03-04 15:29:26,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand