./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-word-trans.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/chl-word-trans.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 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:26:06,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:26:06,853 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:26:06,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:26:06,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:26:06,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:26:06,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:26:06,871 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:26:06,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:26:06,873 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:26:06,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:26:06,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:26:06,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:26:06,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:26:06,874 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:26:06,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:26:06,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:26:06,875 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:26:06,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:26:06,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:26:06,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:26:06,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:26:06,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:26:06,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:26:06,875 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:26:06,875 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:26:06,876 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:26:06,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:26:06,876 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:26:06,876 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:26:06,876 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:26:06,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:26:06,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:26:06,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:26:06,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:26:06,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:26:06,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:26:06,876 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:26:06,876 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:26:06,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:26:06,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:26:06,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:26:06,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:26:06,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:26:06,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:26:06,876 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 -> 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 [2025-03-04 15:26:07,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:26:07,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:26:07,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:26:07,112 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:26:07,112 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:26:07,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-03-04 15:26:08,340 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31d482755/c21e9b26270242d3a7bad4e0e166a95d/FLAG8069aa0da [2025-03-04 15:26:08,591 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:26:08,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-03-04 15:26:08,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31d482755/c21e9b26270242d3a7bad4e0e166a95d/FLAG8069aa0da [2025-03-04 15:26:08,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31d482755/c21e9b26270242d3a7bad4e0e166a95d [2025-03-04 15:26:08,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:26:08,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:26:08,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:26:08,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:26:08,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:26:08,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:26:08" (1/1) ... [2025-03-04 15:26:08,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72531e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:08, skipping insertion in model container [2025-03-04 15:26:08,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:26:08" (1/1) ... [2025-03-04 15:26:08,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:26:09,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:26:09,092 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:26:09,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:26:09,134 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:26:09,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:09 WrapperNode [2025-03-04 15:26:09,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:26:09,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:26:09,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:26:09,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:26:09,140 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:26:09" (1/1) ... [2025-03-04 15:26:09,145 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:26:09" (1/1) ... [2025-03-04 15:26:09,163 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 164 [2025-03-04 15:26:09,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:26:09,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:26:09,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:26:09,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:26:09,170 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:09" (1/1) ... [2025-03-04 15:26:09,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:09" (1/1) ... [2025-03-04 15:26:09,173 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:09" (1/1) ... [2025-03-04 15:26:09,184 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-04 15:26:09,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:09" (1/1) ... [2025-03-04 15:26:09,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:09" (1/1) ... [2025-03-04 15:26:09,190 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:09" (1/1) ... [2025-03-04 15:26:09,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:09" (1/1) ... [2025-03-04 15:26:09,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:09" (1/1) ... [2025-03-04 15:26:09,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:09" (1/1) ... [2025-03-04 15:26:09,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:26:09,199 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:26:09,199 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:26:09,199 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:26:09,200 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:09" (1/1) ... [2025-03-04 15:26:09,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:26:09,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:09,224 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:26:09,226 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:26:09,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:26:09,243 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:26:09,243 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:26:09,243 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:26:09,244 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:26:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:26:09,244 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:26:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:26:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:26:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:26:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:26:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:26:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:26:09,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:26:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:26:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:26:09,245 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:26:09,324 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:26:09,326 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:26:09,739 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:26:09,744 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:26:09,977 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:26:09,977 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:26:09,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:26:09 BoogieIcfgContainer [2025-03-04 15:26:09,978 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:26:09,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:26:09,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:26:09,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:26:09,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:26:08" (1/3) ... [2025-03-04 15:26:09,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4b760c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:26:09, skipping insertion in model container [2025-03-04 15:26:09,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:09" (2/3) ... [2025-03-04 15:26:09,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4b760c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:26:09, skipping insertion in model container [2025-03-04 15:26:09,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:26:09" (3/3) ... [2025-03-04 15:26:09,987 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2025-03-04 15:26:10,005 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:26:10,007 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-trans.wvr.c that has 4 procedures, 75 locations, 1 initial locations, 6 loop locations, and 18 error locations. [2025-03-04 15:26:10,007 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:26:10,070 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:26:10,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 89 transitions, 199 flow [2025-03-04 15:26:10,135 INFO L124 PetriNetUnfolderBase]: 15/86 cut-off events. [2025-03-04 15:26:10,136 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:26:10,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 15/86 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 277 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 66. Up to 3 conditions per place. [2025-03-04 15:26:10,139 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 89 transitions, 199 flow [2025-03-04 15:26:10,142 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 84 transitions, 183 flow [2025-03-04 15:26:10,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:26:10,156 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;@380264bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:26:10,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-03-04 15:26:10,160 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:26:10,160 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:26:10,160 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:26:10,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:10,161 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:26:10,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-04 15:26:10,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:10,166 INFO L85 PathProgramCache]: Analyzing trace with hash 675301, now seen corresponding path program 1 times [2025-03-04 15:26:10,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:10,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571373897] [2025-03-04 15:26:10,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:10,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:10,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:26:10,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:26:10,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:10,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:10,391 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:26:10,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:10,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571373897] [2025-03-04 15:26:10,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571373897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:10,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:10,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:26:10,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852750520] [2025-03-04 15:26:10,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:10,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:10,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:10,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:10,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:10,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-03-04 15:26:10,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 84 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:26:10,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:10,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-03-04 15:26:10,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:11,154 INFO L124 PetriNetUnfolderBase]: 3619/6444 cut-off events. [2025-03-04 15:26:11,155 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2025-03-04 15:26:11,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11182 conditions, 6444 events. 3619/6444 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 44950 event pairs, 2208 based on Foata normal form. 3/4781 useless extension candidates. Maximal degree in co-relation 10537. Up to 4530 conditions per place. [2025-03-04 15:26:11,231 INFO L140 encePairwiseOnDemand]: 73/89 looper letters, 50 selfloop transitions, 10 changer transitions 0/93 dead transitions. [2025-03-04 15:26:11,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 93 transitions, 321 flow [2025-03-04 15:26:11,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:11,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2025-03-04 15:26:11,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5898876404494382 [2025-03-04 15:26:11,248 INFO L175 Difference]: Start difference. First operand has 79 places, 84 transitions, 183 flow. Second operand 4 states and 210 transitions. [2025-03-04 15:26:11,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 93 transitions, 321 flow [2025-03-04 15:26:11,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 93 transitions, 312 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:26:11,260 INFO L231 Difference]: Finished difference. Result has 80 places, 93 transitions, 262 flow [2025-03-04 15:26:11,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=80, PETRI_TRANSITIONS=93} [2025-03-04 15:26:11,266 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 1 predicate places. [2025-03-04 15:26:11,266 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 93 transitions, 262 flow [2025-03-04 15:26:11,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:26:11,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:11,266 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:26:11,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:26:11,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-04 15:26:11,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:11,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1356335397, now seen corresponding path program 1 times [2025-03-04 15:26:11,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:11,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316900272] [2025-03-04 15:26:11,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:11,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:11,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:26:11,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:26:11,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:11,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:11,408 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:26:11,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:11,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316900272] [2025-03-04 15:26:11,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316900272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:11,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346874076] [2025-03-04 15:26:11,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:11,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:11,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:11,414 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:26:11,416 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:26:11,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:26:11,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:26:11,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:11,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:11,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:26:11,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:11,536 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:26:11,537 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:11,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346874076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:11,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:26:11,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:26:11,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875240644] [2025-03-04 15:26:11,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:11,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:26:11,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:11,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:26:11,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:26:11,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-03-04 15:26:11,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 93 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 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:26:11,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:11,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-03-04 15:26:11,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:12,180 INFO L124 PetriNetUnfolderBase]: 3619/6441 cut-off events. [2025-03-04 15:26:12,180 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-04 15:26:12,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11136 conditions, 6441 events. 3619/6441 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 44924 event pairs, 2208 based on Foata normal form. 3/4783 useless extension candidates. Maximal degree in co-relation 11063. Up to 4515 conditions per place. [2025-03-04 15:26:12,228 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 40 selfloop transitions, 17 changer transitions 0/90 dead transitions. [2025-03-04 15:26:12,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 90 transitions, 364 flow [2025-03-04 15:26:12,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:26:12,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:26:12,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 276 transitions. [2025-03-04 15:26:12,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5168539325842697 [2025-03-04 15:26:12,232 INFO L175 Difference]: Start difference. First operand has 80 places, 93 transitions, 262 flow. Second operand 6 states and 276 transitions. [2025-03-04 15:26:12,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 90 transitions, 364 flow [2025-03-04 15:26:12,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 90 transitions, 364 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:26:12,236 INFO L231 Difference]: Finished difference. Result has 82 places, 90 transitions, 284 flow [2025-03-04 15:26:12,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=284, PETRI_PLACES=82, PETRI_TRANSITIONS=90} [2025-03-04 15:26:12,237 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 3 predicate places. [2025-03-04 15:26:12,237 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 90 transitions, 284 flow [2025-03-04 15:26:12,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 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:26:12,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:12,237 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:26:12,244 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:26:12,438 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:26:12,438 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-04 15:26:12,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:12,439 INFO L85 PathProgramCache]: Analyzing trace with hash 903276265, now seen corresponding path program 1 times [2025-03-04 15:26:12,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:12,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942454719] [2025-03-04 15:26:12,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:12,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:12,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:26:12,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:26:12,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:12,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:12,537 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:26:12,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:12,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942454719] [2025-03-04 15:26:12,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942454719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:12,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258099658] [2025-03-04 15:26:12,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:12,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:12,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:12,540 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:26:12,542 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:26:12,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:26:12,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:26:12,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:12,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:12,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:26:12,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:12,623 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:26:12,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:12,658 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:26:12,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258099658] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:12,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:12,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:26:12,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510398535] [2025-03-04 15:26:12,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:12,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:26:12,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:12,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:26:12,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:26:12,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-03-04 15:26:12,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 90 transitions, 284 flow. Second operand has 12 states, 12 states have (on average 37.083333333333336) internal successors, (445), 12 states have internal predecessors, (445), 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:26:12,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:12,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-03-04 15:26:12,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:13,256 INFO L124 PetriNetUnfolderBase]: 3628/6477 cut-off events. [2025-03-04 15:26:13,257 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2025-03-04 15:26:13,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11277 conditions, 6477 events. 3628/6477 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 45307 event pairs, 2208 based on Foata normal form. 9/4825 useless extension candidates. Maximal degree in co-relation 11065. Up to 4530 conditions per place. [2025-03-04 15:26:13,287 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 47 selfloop transitions, 37 changer transitions 0/117 dead transitions. [2025-03-04 15:26:13,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 117 transitions, 626 flow [2025-03-04 15:26:13,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:26:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:26:13,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 453 transitions. [2025-03-04 15:26:13,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5089887640449439 [2025-03-04 15:26:13,291 INFO L175 Difference]: Start difference. First operand has 82 places, 90 transitions, 284 flow. Second operand 10 states and 453 transitions. [2025-03-04 15:26:13,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 117 transitions, 626 flow [2025-03-04 15:26:13,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 117 transitions, 543 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-03-04 15:26:13,295 INFO L231 Difference]: Finished difference. Result has 89 places, 117 transitions, 499 flow [2025-03-04 15:26:13,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=499, PETRI_PLACES=89, PETRI_TRANSITIONS=117} [2025-03-04 15:26:13,297 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 10 predicate places. [2025-03-04 15:26:13,297 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 117 transitions, 499 flow [2025-03-04 15:26:13,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 37.083333333333336) internal successors, (445), 12 states have internal predecessors, (445), 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:26:13,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:13,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:13,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:26:13,503 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:26:13,503 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-04 15:26:13,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:13,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2115868396, now seen corresponding path program 1 times [2025-03-04 15:26:13,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:13,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109407212] [2025-03-04 15:26:13,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:13,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:13,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:26:13,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:26:13,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:13,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:13,613 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:26:13,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:13,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109407212] [2025-03-04 15:26:13,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109407212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:13,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:13,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:13,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64905397] [2025-03-04 15:26:13,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:13,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:13,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:13,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:13,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:13,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 89 [2025-03-04 15:26:13,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 117 transitions, 499 flow. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 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:26:13,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:13,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 89 [2025-03-04 15:26:13,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:14,303 INFO L124 PetriNetUnfolderBase]: 6605/10634 cut-off events. [2025-03-04 15:26:14,304 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2025-03-04 15:26:14,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19461 conditions, 10634 events. 6605/10634 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 68519 event pairs, 3248 based on Foata normal form. 146/8256 useless extension candidates. Maximal degree in co-relation 19363. Up to 6583 conditions per place. [2025-03-04 15:26:14,360 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 131 selfloop transitions, 4 changer transitions 0/168 dead transitions. [2025-03-04 15:26:14,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 168 transitions, 877 flow [2025-03-04 15:26:14,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:14,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:14,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2025-03-04 15:26:14,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7219101123595506 [2025-03-04 15:26:14,364 INFO L175 Difference]: Start difference. First operand has 89 places, 117 transitions, 499 flow. Second operand 4 states and 257 transitions. [2025-03-04 15:26:14,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 168 transitions, 877 flow [2025-03-04 15:26:14,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 168 transitions, 840 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:14,372 INFO L231 Difference]: Finished difference. Result has 92 places, 120 transitions, 491 flow [2025-03-04 15:26:14,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=491, PETRI_PLACES=92, PETRI_TRANSITIONS=120} [2025-03-04 15:26:14,373 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 13 predicate places. [2025-03-04 15:26:14,373 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 120 transitions, 491 flow [2025-03-04 15:26:14,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 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:26:14,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:14,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:14,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:26:14,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-04 15:26:14,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:14,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1167441958, now seen corresponding path program 1 times [2025-03-04 15:26:14,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:14,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531262917] [2025-03-04 15:26:14,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:14,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:14,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:26:14,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:26:14,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:14,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:14,519 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:26:14,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:14,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531262917] [2025-03-04 15:26:14,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531262917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:14,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:14,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:14,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872907837] [2025-03-04 15:26:14,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:14,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:26:14,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:14,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:26:14,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:26:14,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 89 [2025-03-04 15:26:14,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 120 transitions, 491 flow. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 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:26:14,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:14,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 89 [2025-03-04 15:26:14,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:15,699 INFO L124 PetriNetUnfolderBase]: 12414/21860 cut-off events. [2025-03-04 15:26:15,699 INFO L125 PetriNetUnfolderBase]: For 2476/2492 co-relation queries the response was YES. [2025-03-04 15:26:15,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40170 conditions, 21860 events. 12414/21860 cut-off events. For 2476/2492 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 179123 event pairs, 7206 based on Foata normal form. 304/17174 useless extension candidates. Maximal degree in co-relation 40046. Up to 7814 conditions per place. [2025-03-04 15:26:15,836 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 127 selfloop transitions, 11 changer transitions 0/173 dead transitions. [2025-03-04 15:26:15,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 173 transitions, 956 flow [2025-03-04 15:26:15,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:26:15,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:26:15,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 333 transitions. [2025-03-04 15:26:15,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6235955056179775 [2025-03-04 15:26:15,838 INFO L175 Difference]: Start difference. First operand has 92 places, 120 transitions, 491 flow. Second operand 6 states and 333 transitions. [2025-03-04 15:26:15,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 173 transitions, 956 flow [2025-03-04 15:26:15,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 173 transitions, 951 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:15,845 INFO L231 Difference]: Finished difference. Result has 99 places, 123 transitions, 541 flow [2025-03-04 15:26:15,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=541, PETRI_PLACES=99, PETRI_TRANSITIONS=123} [2025-03-04 15:26:15,845 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 20 predicate places. [2025-03-04 15:26:15,846 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 123 transitions, 541 flow [2025-03-04 15:26:15,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 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:26:15,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:15,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:15,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:26:15,846 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-04 15:26:15,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:15,846 INFO L85 PathProgramCache]: Analyzing trace with hash -38697291, now seen corresponding path program 1 times [2025-03-04 15:26:15,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:15,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294625884] [2025-03-04 15:26:15,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:15,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:15,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:26:15,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:26:15,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:15,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:15,915 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:26:15,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:15,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294625884] [2025-03-04 15:26:15,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294625884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:15,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:15,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:15,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528050588] [2025-03-04 15:26:15,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:15,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:15,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:15,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:15,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:15,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 89 [2025-03-04 15:26:15,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 123 transitions, 541 flow. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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:26:15,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:15,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 89 [2025-03-04 15:26:15,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:17,679 INFO L124 PetriNetUnfolderBase]: 19844/31572 cut-off events. [2025-03-04 15:26:17,679 INFO L125 PetriNetUnfolderBase]: For 3705/4117 co-relation queries the response was YES. [2025-03-04 15:26:17,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61328 conditions, 31572 events. 19844/31572 cut-off events. For 3705/4117 co-relation queries the response was YES. Maximal size of possible extension queue 1071. Compared 230915 event pairs, 9872 based on Foata normal form. 448/26531 useless extension candidates. Maximal degree in co-relation 61201. Up to 19570 conditions per place. [2025-03-04 15:26:17,832 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 137 selfloop transitions, 4 changer transitions 0/176 dead transitions. [2025-03-04 15:26:17,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 176 transitions, 959 flow [2025-03-04 15:26:17,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:17,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:17,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2025-03-04 15:26:17,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7162921348314607 [2025-03-04 15:26:17,833 INFO L175 Difference]: Start difference. First operand has 99 places, 123 transitions, 541 flow. Second operand 4 states and 255 transitions. [2025-03-04 15:26:17,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 176 transitions, 959 flow [2025-03-04 15:26:17,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 176 transitions, 951 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:17,839 INFO L231 Difference]: Finished difference. Result has 103 places, 126 transitions, 562 flow [2025-03-04 15:26:17,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=562, PETRI_PLACES=103, PETRI_TRANSITIONS=126} [2025-03-04 15:26:17,840 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 24 predicate places. [2025-03-04 15:26:17,840 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 126 transitions, 562 flow [2025-03-04 15:26:17,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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:26:17,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:17,840 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:17,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:26:17,841 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-04 15:26:17,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:17,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1830961674, now seen corresponding path program 1 times [2025-03-04 15:26:17,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:17,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104658603] [2025-03-04 15:26:17,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:17,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:17,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:26:17,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:26:17,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:17,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:17,940 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:26:17,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:17,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104658603] [2025-03-04 15:26:17,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104658603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:17,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:17,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:26:17,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137240947] [2025-03-04 15:26:17,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:17,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:17,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:17,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:17,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:17,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 89 [2025-03-04 15:26:17,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 126 transitions, 562 flow. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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:26:17,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:17,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 89 [2025-03-04 15:26:17,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:21,191 INFO L124 PetriNetUnfolderBase]: 35308/63632 cut-off events. [2025-03-04 15:26:21,191 INFO L125 PetriNetUnfolderBase]: For 18461/18639 co-relation queries the response was YES. [2025-03-04 15:26:21,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125921 conditions, 63632 events. 35308/63632 cut-off events. For 18461/18639 co-relation queries the response was YES. Maximal size of possible extension queue 2501. Compared 609688 event pairs, 20812 based on Foata normal form. 856/55092 useless extension candidates. Maximal degree in co-relation 125706. Up to 21617 conditions per place. [2025-03-04 15:26:21,795 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 158 selfloop transitions, 4 changer transitions 0/198 dead transitions. [2025-03-04 15:26:21,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 198 transitions, 1217 flow [2025-03-04 15:26:21,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:21,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2025-03-04 15:26:21,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7106741573033708 [2025-03-04 15:26:21,797 INFO L175 Difference]: Start difference. First operand has 103 places, 126 transitions, 562 flow. Second operand 4 states and 253 transitions. [2025-03-04 15:26:21,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 198 transitions, 1217 flow [2025-03-04 15:26:21,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 198 transitions, 1212 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:21,840 INFO L231 Difference]: Finished difference. Result has 107 places, 127 transitions, 582 flow [2025-03-04 15:26:21,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=582, PETRI_PLACES=107, PETRI_TRANSITIONS=127} [2025-03-04 15:26:21,840 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 28 predicate places. [2025-03-04 15:26:21,841 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 127 transitions, 582 flow [2025-03-04 15:26:21,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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:26:21,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:21,841 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:21,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:26:21,841 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-04 15:26:21,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:21,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1199647124, now seen corresponding path program 1 times [2025-03-04 15:26:21,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:21,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758504735] [2025-03-04 15:26:21,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:21,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:21,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:26:21,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:26:21,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:21,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:21,923 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:26:21,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:21,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758504735] [2025-03-04 15:26:21,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758504735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:21,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:21,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:26:21,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021227586] [2025-03-04 15:26:21,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:21,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:26:21,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:21,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:26:21,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:26:21,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 89 [2025-03-04 15:26:21,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 127 transitions, 582 flow. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 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:26:21,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:21,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 89 [2025-03-04 15:26:21,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:28,912 INFO L124 PetriNetUnfolderBase]: 74500/131096 cut-off events. [2025-03-04 15:26:28,913 INFO L125 PetriNetUnfolderBase]: For 23354/23714 co-relation queries the response was YES. [2025-03-04 15:26:29,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253279 conditions, 131096 events. 74500/131096 cut-off events. For 23354/23714 co-relation queries the response was YES. Maximal size of possible extension queue 5019. Compared 1335620 event pairs, 43464 based on Foata normal form. 1584/110065 useless extension candidates. Maximal degree in co-relation 253063. Up to 46472 conditions per place. [2025-03-04 15:26:29,915 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 114 selfloop transitions, 15 changer transitions 0/167 dead transitions. [2025-03-04 15:26:29,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 167 transitions, 950 flow [2025-03-04 15:26:30,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:26:30,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:26:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 287 transitions. [2025-03-04 15:26:30,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6449438202247191 [2025-03-04 15:26:30,085 INFO L175 Difference]: Start difference. First operand has 107 places, 127 transitions, 582 flow. Second operand 5 states and 287 transitions. [2025-03-04 15:26:30,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 167 transitions, 950 flow [2025-03-04 15:26:30,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 167 transitions, 948 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 15:26:30,184 INFO L231 Difference]: Finished difference. Result has 113 places, 128 transitions, 632 flow [2025-03-04 15:26:30,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=632, PETRI_PLACES=113, PETRI_TRANSITIONS=128} [2025-03-04 15:26:30,185 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 34 predicate places. [2025-03-04 15:26:30,185 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 128 transitions, 632 flow [2025-03-04 15:26:30,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 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:26:30,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:30,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:30,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:26:30,186 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-04 15:26:30,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:30,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2088074571, now seen corresponding path program 1 times [2025-03-04 15:26:30,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:30,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249579061] [2025-03-04 15:26:30,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:30,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:30,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:26:30,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:26:30,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:30,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:30,334 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:26:30,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:30,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249579061] [2025-03-04 15:26:30,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249579061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:30,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838812899] [2025-03-04 15:26:30,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:30,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:30,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:30,337 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:26:30,339 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:26:30,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:26:30,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:26:30,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:30,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:30,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:26:30,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:30,463 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:26:30,463 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:30,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838812899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:30,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:26:30,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2025-03-04 15:26:30,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345550707] [2025-03-04 15:26:30,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:30,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:26:30,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:30,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:26:30,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:26:30,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-03-04 15:26:30,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 128 transitions, 632 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:30,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:30,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-03-04 15:26:30,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:36,953 INFO L124 PetriNetUnfolderBase]: 65028/118644 cut-off events. [2025-03-04 15:26:36,953 INFO L125 PetriNetUnfolderBase]: For 32675/32835 co-relation queries the response was YES. [2025-03-04 15:26:37,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229894 conditions, 118644 events. 65028/118644 cut-off events. For 32675/32835 co-relation queries the response was YES. Maximal size of possible extension queue 4334. Compared 1235091 event pairs, 39960 based on Foata normal form. 1960/103408 useless extension candidates. Maximal degree in co-relation 229670. Up to 79658 conditions per place. [2025-03-04 15:26:37,820 INFO L140 encePairwiseOnDemand]: 87/89 looper letters, 86 selfloop transitions, 1 changer transitions 0/126 dead transitions. [2025-03-04 15:26:37,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 126 transitions, 792 flow [2025-03-04 15:26:37,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:26:37,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:26:37,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-03-04 15:26:37,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6329588014981273 [2025-03-04 15:26:37,821 INFO L175 Difference]: Start difference. First operand has 113 places, 128 transitions, 632 flow. Second operand 3 states and 169 transitions. [2025-03-04 15:26:37,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 126 transitions, 792 flow [2025-03-04 15:26:37,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 126 transitions, 765 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:26:37,917 INFO L231 Difference]: Finished difference. Result has 109 places, 126 transitions, 593 flow [2025-03-04 15:26:37,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=593, PETRI_PLACES=109, PETRI_TRANSITIONS=126} [2025-03-04 15:26:37,917 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 30 predicate places. [2025-03-04 15:26:37,917 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 126 transitions, 593 flow [2025-03-04 15:26:37,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:37,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:37,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:37,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 15:26:38,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:38,118 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-04 15:26:38,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:38,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1465645495, now seen corresponding path program 1 times [2025-03-04 15:26:38,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:38,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455145418] [2025-03-04 15:26:38,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:38,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:38,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:26:38,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:26:38,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:38,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:38,183 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:26:38,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:38,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455145418] [2025-03-04 15:26:38,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455145418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:38,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:38,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:38,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636657564] [2025-03-04 15:26:38,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:38,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:38,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:38,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:38,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:38,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 89 [2025-03-04 15:26:38,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 126 transitions, 593 flow. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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:26:38,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:38,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 89 [2025-03-04 15:26:38,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:45,220 INFO L124 PetriNetUnfolderBase]: 71357/126981 cut-off events. [2025-03-04 15:26:45,220 INFO L125 PetriNetUnfolderBase]: For 33643/33887 co-relation queries the response was YES. [2025-03-04 15:26:45,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250643 conditions, 126981 events. 71357/126981 cut-off events. For 33643/33887 co-relation queries the response was YES. Maximal size of possible extension queue 4840. Compared 1303255 event pairs, 42190 based on Foata normal form. 1048/109009 useless extension candidates. Maximal degree in co-relation 250620. Up to 44304 conditions per place. [2025-03-04 15:26:46,450 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 133 selfloop transitions, 10 changer transitions 0/179 dead transitions. [2025-03-04 15:26:46,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 179 transitions, 1072 flow [2025-03-04 15:26:46,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:26:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:26:46,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 293 transitions. [2025-03-04 15:26:46,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6584269662921348 [2025-03-04 15:26:46,452 INFO L175 Difference]: Start difference. First operand has 109 places, 126 transitions, 593 flow. Second operand 5 states and 293 transitions. [2025-03-04 15:26:46,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 179 transitions, 1072 flow [2025-03-04 15:26:46,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 179 transitions, 1071 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:46,562 INFO L231 Difference]: Finished difference. Result has 114 places, 127 transitions, 632 flow [2025-03-04 15:26:46,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=632, PETRI_PLACES=114, PETRI_TRANSITIONS=127} [2025-03-04 15:26:46,563 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 35 predicate places. [2025-03-04 15:26:46,563 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 127 transitions, 632 flow [2025-03-04 15:26:46,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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:26:46,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:46,563 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:46,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:26:46,563 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-04 15:26:46,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:46,564 INFO L85 PathProgramCache]: Analyzing trace with hash 972663841, now seen corresponding path program 1 times [2025-03-04 15:26:46,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:46,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863996777] [2025-03-04 15:26:46,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:46,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:46,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:26:46,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:26:46,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:46,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:46,624 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:26:46,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:46,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863996777] [2025-03-04 15:26:46,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863996777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:46,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:46,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:46,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908212762] [2025-03-04 15:26:46,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:46,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:46,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:46,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:46,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:46,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 89 [2025-03-04 15:26:46,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 127 transitions, 632 flow. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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:26:46,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:46,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 89 [2025-03-04 15:26:46,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand