./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-array-int-symm.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-array-int-symm.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 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:23:48,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:23:48,314 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:23:48,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:23:48,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:23:48,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:23:48,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:23:48,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:23:48,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:23:48,340 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:23:48,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:23:48,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:23:48,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:23:48,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:23:48,342 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:23:48,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:23:48,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:23:48,342 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:23:48,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:23:48,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:23:48,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:23:48,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:23:48,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:23:48,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:23:48,342 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:23:48,342 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:23:48,342 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:23:48,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:23:48,342 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:23:48,342 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:23:48,343 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:23:48,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:23:48,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:23:48,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:23:48,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:23:48,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:23:48,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:23:48,343 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:23:48,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:23:48,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:23:48,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:23:48,343 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:23:48,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:23:48,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:23:48,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:23:48,344 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 -> 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 [2025-03-04 15:23:48,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:23:48,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:23:48,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:23:48,570 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:23:48,570 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:23:48,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2025-03-04 15:23:49,715 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e87c1a3c4/272520cd871a44caa2826fdbaf9732bc/FLAGa22225ffa [2025-03-04 15:23:49,949 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:23:49,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2025-03-04 15:23:49,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e87c1a3c4/272520cd871a44caa2826fdbaf9732bc/FLAGa22225ffa [2025-03-04 15:23:49,970 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e87c1a3c4/272520cd871a44caa2826fdbaf9732bc [2025-03-04 15:23:49,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:23:49,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:23:49,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:23:49,974 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:23:49,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:23:49,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:23:49" (1/1) ... [2025-03-04 15:23:49,978 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fe76117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:49, skipping insertion in model container [2025-03-04 15:23:49,978 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:23:49" (1/1) ... [2025-03-04 15:23:49,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:23:50,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:23:50,148 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:23:50,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:23:50,190 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:23:50,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:50 WrapperNode [2025-03-04 15:23:50,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:23:50,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:23:50,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:23:50,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:23:50,197 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:23:50" (1/1) ... [2025-03-04 15:23:50,203 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:23:50" (1/1) ... [2025-03-04 15:23:50,229 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 223 [2025-03-04 15:23:50,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:23:50,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:23:50,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:23:50,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:23:50,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:50" (1/1) ... [2025-03-04 15:23:50,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:50" (1/1) ... [2025-03-04 15:23:50,240 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:50" (1/1) ... [2025-03-04 15:23:50,260 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-04 15:23:50,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:50" (1/1) ... [2025-03-04 15:23:50,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:50" (1/1) ... [2025-03-04 15:23:50,273 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:50" (1/1) ... [2025-03-04 15:23:50,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:50" (1/1) ... [2025-03-04 15:23:50,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:50" (1/1) ... [2025-03-04 15:23:50,280 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:50" (1/1) ... [2025-03-04 15:23:50,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:23:50,282 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:23:50,282 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:23:50,282 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:23:50,283 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:50" (1/1) ... [2025-03-04 15:23:50,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:23:50,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:50,307 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:23:50,314 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:23:50,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:23:50,329 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:23:50,329 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:23:50,329 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:23:50,329 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:23:50,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:23:50,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:23:50,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:23:50,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:23:50,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:23:50,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:23:50,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:23:50,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:23:50,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:23:50,330 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:23:50,408 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:23:50,410 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:23:50,715 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:23:50,716 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:23:50,912 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:23:50,912 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:23:50,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:23:50 BoogieIcfgContainer [2025-03-04 15:23:50,913 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:23:50,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:23:50,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:23:50,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:23:50,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:23:49" (1/3) ... [2025-03-04 15:23:50,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22827a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:23:50, skipping insertion in model container [2025-03-04 15:23:50,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:50" (2/3) ... [2025-03-04 15:23:50,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22827a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:23:50, skipping insertion in model container [2025-03-04 15:23:50,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:23:50" (3/3) ... [2025-03-04 15:23:50,922 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-symm.wvr.c [2025-03-04 15:23:50,935 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:23:50,936 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-symm.wvr.c that has 3 procedures, 77 locations, 1 initial locations, 4 loop locations, and 24 error locations. [2025-03-04 15:23:50,937 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:23:51,007 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:23:51,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 86 transitions, 186 flow [2025-03-04 15:23:51,104 INFO L124 PetriNetUnfolderBase]: 10/84 cut-off events. [2025-03-04 15:23:51,107 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:23:51,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 84 events. 10/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 284 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-03-04 15:23:51,111 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 86 transitions, 186 flow [2025-03-04 15:23:51,114 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 82 transitions, 173 flow [2025-03-04 15:23:51,122 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:23:51,137 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;@bcd87cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:23:51,138 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-03-04 15:23:51,140 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:23:51,140 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:23:51,140 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:23:51,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:51,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:23:51,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:23:51,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:51,146 INFO L85 PathProgramCache]: Analyzing trace with hash 643625, now seen corresponding path program 1 times [2025-03-04 15:23:51,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:51,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512026024] [2025-03-04 15:23:51,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:51,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:51,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:23:51,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:23:51,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:51,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:51,336 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:23:51,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:51,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512026024] [2025-03-04 15:23:51,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512026024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:51,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:51,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:51,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41359710] [2025-03-04 15:23:51,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:51,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:51,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:51,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:51,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:51,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 86 [2025-03-04 15:23:51,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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:23:51,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:51,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 86 [2025-03-04 15:23:51,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:51,647 INFO L124 PetriNetUnfolderBase]: 501/1325 cut-off events. [2025-03-04 15:23:51,647 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-04 15:23:51,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2120 conditions, 1325 events. 501/1325 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9352 event pairs, 311 based on Foata normal form. 2/1039 useless extension candidates. Maximal degree in co-relation 2032. Up to 752 conditions per place. [2025-03-04 15:23:51,657 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 32 selfloop transitions, 6 changer transitions 0/80 dead transitions. [2025-03-04 15:23:51,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 80 transitions, 245 flow [2025-03-04 15:23:51,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2025-03-04 15:23:51,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2025-03-04 15:23:51,671 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 173 flow. Second operand 4 states and 216 transitions. [2025-03-04 15:23:51,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 80 transitions, 245 flow [2025-03-04 15:23:51,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 80 transitions, 240 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:23:51,677 INFO L231 Difference]: Finished difference. Result has 77 places, 80 transitions, 176 flow [2025-03-04 15:23:51,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=77, PETRI_TRANSITIONS=80} [2025-03-04 15:23:51,681 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -2 predicate places. [2025-03-04 15:23:51,682 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 80 transitions, 176 flow [2025-03-04 15:23:51,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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:23:51,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:51,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:23:51,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:23:51,683 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:23:51,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:51,683 INFO L85 PathProgramCache]: Analyzing trace with hash 19952927, now seen corresponding path program 1 times [2025-03-04 15:23:51,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:51,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658274040] [2025-03-04 15:23:51,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:51,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:51,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:23:51,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:23:51,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:51,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:51,752 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:23:51,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:51,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658274040] [2025-03-04 15:23:51,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658274040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:51,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:51,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:51,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724666740] [2025-03-04 15:23:51,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:51,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:51,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:51,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:51,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:51,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 86 [2025-03-04 15:23:51,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 80 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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:23:51,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:51,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 86 [2025-03-04 15:23:51,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:51,969 INFO L124 PetriNetUnfolderBase]: 503/1333 cut-off events. [2025-03-04 15:23:51,969 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 15:23:51,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2133 conditions, 1333 events. 503/1333 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9418 event pairs, 311 based on Foata normal form. 2/1049 useless extension candidates. Maximal degree in co-relation 2085. Up to 761 conditions per place. [2025-03-04 15:23:51,977 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 37 selfloop transitions, 7 changer transitions 0/86 dead transitions. [2025-03-04 15:23:51,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 86 transitions, 286 flow [2025-03-04 15:23:51,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2025-03-04 15:23:51,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6453488372093024 [2025-03-04 15:23:51,979 INFO L175 Difference]: Start difference. First operand has 77 places, 80 transitions, 176 flow. Second operand 4 states and 222 transitions. [2025-03-04 15:23:51,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 86 transitions, 286 flow [2025-03-04 15:23:51,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 86 transitions, 264 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:23:51,983 INFO L231 Difference]: Finished difference. Result has 80 places, 86 transitions, 220 flow [2025-03-04 15:23:51,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=80, PETRI_TRANSITIONS=86} [2025-03-04 15:23:51,984 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 1 predicate places. [2025-03-04 15:23:51,984 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 86 transitions, 220 flow [2025-03-04 15:23:51,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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:23:51,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:51,985 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:23:51,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:23:51,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:23:51,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:51,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1996494061, now seen corresponding path program 1 times [2025-03-04 15:23:51,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:51,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337316252] [2025-03-04 15:23:51,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:51,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:51,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:23:52,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:23:52,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:52,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:52,149 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:23:52,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:52,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337316252] [2025-03-04 15:23:52,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337316252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:52,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:52,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:52,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331653701] [2025-03-04 15:23:52,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:52,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:23:52,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:52,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:23:52,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:23:52,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 86 [2025-03-04 15:23:52,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 86 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 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:23:52,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:52,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 86 [2025-03-04 15:23:52,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:52,514 INFO L124 PetriNetUnfolderBase]: 1197/3047 cut-off events. [2025-03-04 15:23:52,515 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-04 15:23:52,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4921 conditions, 3047 events. 1197/3047 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 25189 event pairs, 742 based on Foata normal form. 23/2404 useless extension candidates. Maximal degree in co-relation 2491. Up to 919 conditions per place. [2025-03-04 15:23:52,536 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 70 selfloop transitions, 7 changer transitions 0/117 dead transitions. [2025-03-04 15:23:52,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 117 transitions, 440 flow [2025-03-04 15:23:52,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:23:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:23:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 296 transitions. [2025-03-04 15:23:52,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6883720930232559 [2025-03-04 15:23:52,539 INFO L175 Difference]: Start difference. First operand has 80 places, 86 transitions, 220 flow. Second operand 5 states and 296 transitions. [2025-03-04 15:23:52,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 117 transitions, 440 flow [2025-03-04 15:23:52,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 117 transitions, 440 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:23:52,542 INFO L231 Difference]: Finished difference. Result has 86 places, 88 transitions, 253 flow [2025-03-04 15:23:52,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=253, PETRI_PLACES=86, PETRI_TRANSITIONS=88} [2025-03-04 15:23:52,543 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 7 predicate places. [2025-03-04 15:23:52,543 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 88 transitions, 253 flow [2025-03-04 15:23:52,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 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:23:52,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:52,544 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:23:52,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:23:52,544 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:23:52,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:52,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1712809768, now seen corresponding path program 1 times [2025-03-04 15:23:52,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:52,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855733375] [2025-03-04 15:23:52,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:52,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:52,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:23:52,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:23:52,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:52,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:52,624 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:23:52,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:52,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855733375] [2025-03-04 15:23:52,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855733375] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:52,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806035481] [2025-03-04 15:23:52,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:52,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:52,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:52,627 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:23:52,629 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:23:52,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:23:52,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:23:52,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:52,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:52,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:23:52,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:52,714 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:23:52,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:23:52,751 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:23:52,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806035481] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:23:52,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:23:52,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 15:23:52,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880087245] [2025-03-04 15:23:52,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:23:52,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:23:52,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:52,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:23:52,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:23:52,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 86 [2025-03-04 15:23:52,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 88 transitions, 253 flow. Second operand has 10 states, 10 states have (on average 45.0) internal successors, (450), 10 states have internal predecessors, (450), 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:23:52,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:52,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 86 [2025-03-04 15:23:52,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:53,082 INFO L124 PetriNetUnfolderBase]: 1014/2672 cut-off events. [2025-03-04 15:23:53,083 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-03-04 15:23:53,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4334 conditions, 2672 events. 1014/2672 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 21942 event pairs, 624 based on Foata normal form. 0/2105 useless extension candidates. Maximal degree in co-relation 2198. Up to 1514 conditions per place. [2025-03-04 15:23:53,094 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 37 selfloop transitions, 25 changer transitions 0/106 dead transitions. [2025-03-04 15:23:53,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 106 transitions, 461 flow [2025-03-04 15:23:53,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:23:53,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:23:53,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 508 transitions. [2025-03-04 15:23:53,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5906976744186047 [2025-03-04 15:23:53,096 INFO L175 Difference]: Start difference. First operand has 86 places, 88 transitions, 253 flow. Second operand 10 states and 508 transitions. [2025-03-04 15:23:53,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 106 transitions, 461 flow [2025-03-04 15:23:53,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 106 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:23:53,098 INFO L231 Difference]: Finished difference. Result has 97 places, 106 transitions, 415 flow [2025-03-04 15:23:53,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=415, PETRI_PLACES=97, PETRI_TRANSITIONS=106} [2025-03-04 15:23:53,099 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 18 predicate places. [2025-03-04 15:23:53,099 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 106 transitions, 415 flow [2025-03-04 15:23:53,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 45.0) internal successors, (450), 10 states have internal predecessors, (450), 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:23:53,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:53,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:53,106 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:23:53,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:53,305 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:23:53,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:53,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1761774360, now seen corresponding path program 1 times [2025-03-04 15:23:53,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:53,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214805871] [2025-03-04 15:23:53,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:53,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:53,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:23:53,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:23:53,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:53,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:53,403 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:23:53,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:53,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214805871] [2025-03-04 15:23:53,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214805871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:53,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:53,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:53,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661683976] [2025-03-04 15:23:53,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:53,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:53,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:53,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:53,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:53,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 86 [2025-03-04 15:23:53,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 106 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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:23:53,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:53,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 86 [2025-03-04 15:23:53,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:53,850 INFO L124 PetriNetUnfolderBase]: 2245/5736 cut-off events. [2025-03-04 15:23:53,851 INFO L125 PetriNetUnfolderBase]: For 535/535 co-relation queries the response was YES. [2025-03-04 15:23:53,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9560 conditions, 5736 events. 2245/5736 cut-off events. For 535/535 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 53434 event pairs, 1365 based on Foata normal form. 86/4682 useless extension candidates. Maximal degree in co-relation 9463. Up to 1691 conditions per place. [2025-03-04 15:23:53,879 INFO L140 encePairwiseOnDemand]: 79/86 looper letters, 107 selfloop transitions, 5 changer transitions 0/152 dead transitions. [2025-03-04 15:23:53,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 152 transitions, 817 flow [2025-03-04 15:23:53,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:53,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:53,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2025-03-04 15:23:53,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7412790697674418 [2025-03-04 15:23:53,881 INFO L175 Difference]: Start difference. First operand has 97 places, 106 transitions, 415 flow. Second operand 4 states and 255 transitions. [2025-03-04 15:23:53,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 152 transitions, 817 flow [2025-03-04 15:23:53,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 152 transitions, 723 flow, removed 29 selfloop flow, removed 4 redundant places. [2025-03-04 15:23:53,888 INFO L231 Difference]: Finished difference. Result has 98 places, 108 transitions, 388 flow [2025-03-04 15:23:53,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=388, PETRI_PLACES=98, PETRI_TRANSITIONS=108} [2025-03-04 15:23:53,888 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 19 predicate places. [2025-03-04 15:23:53,888 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 108 transitions, 388 flow [2025-03-04 15:23:53,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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:23:53,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:53,889 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:53,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:23:53,889 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:23:53,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:53,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1131259844, now seen corresponding path program 1 times [2025-03-04 15:23:53,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:53,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354005788] [2025-03-04 15:23:53,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:53,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:53,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:23:53,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:23:53,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:53,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:54,035 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:23:54,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:54,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354005788] [2025-03-04 15:23:54,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354005788] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:54,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582430011] [2025-03-04 15:23:54,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:54,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:54,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:54,038 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:23:54,039 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:23:54,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:23:54,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:23:54,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:54,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:54,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:23:54,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:54,131 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:23:54,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:23:54,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582430011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:54,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:23:54,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2025-03-04 15:23:54,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712804257] [2025-03-04 15:23:54,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:54,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:23:54,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:54,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:23:54,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:23:54,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 86 [2025-03-04 15:23:54,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 108 transitions, 388 flow. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:54,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:54,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 86 [2025-03-04 15:23:54,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:54,525 INFO L124 PetriNetUnfolderBase]: 2014/5292 cut-off events. [2025-03-04 15:23:54,526 INFO L125 PetriNetUnfolderBase]: For 486/488 co-relation queries the response was YES. [2025-03-04 15:23:54,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8554 conditions, 5292 events. 2014/5292 cut-off events. For 486/488 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 49519 event pairs, 1245 based on Foata normal form. 74/4246 useless extension candidates. Maximal degree in co-relation 8469. Up to 3046 conditions per place. [2025-03-04 15:23:54,554 INFO L140 encePairwiseOnDemand]: 83/86 looper letters, 59 selfloop transitions, 1 changer transitions 0/104 dead transitions. [2025-03-04 15:23:54,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 104 transitions, 480 flow [2025-03-04 15:23:54,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:23:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:23:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2025-03-04 15:23:54,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6821705426356589 [2025-03-04 15:23:54,555 INFO L175 Difference]: Start difference. First operand has 98 places, 108 transitions, 388 flow. Second operand 3 states and 176 transitions. [2025-03-04 15:23:54,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 104 transitions, 480 flow [2025-03-04 15:23:54,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 104 transitions, 463 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 15:23:54,559 INFO L231 Difference]: Finished difference. Result has 94 places, 104 transitions, 345 flow [2025-03-04 15:23:54,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=345, PETRI_PLACES=94, PETRI_TRANSITIONS=104} [2025-03-04 15:23:54,560 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 15 predicate places. [2025-03-04 15:23:54,560 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 104 transitions, 345 flow [2025-03-04 15:23:54,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:54,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:54,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:54,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:23:54,760 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,SelfDestructingSolverStorable5 [2025-03-04 15:23:54,761 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:23:54,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:54,761 INFO L85 PathProgramCache]: Analyzing trace with hash -2141032337, now seen corresponding path program 1 times [2025-03-04 15:23:54,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:54,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934185591] [2025-03-04 15:23:54,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:54,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:54,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:23:54,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:23:54,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:54,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:54,882 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:23:54,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:54,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934185591] [2025-03-04 15:23:54,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934185591] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:54,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396742294] [2025-03-04 15:23:54,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:54,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:54,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:54,885 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:23:54,887 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:23:54,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:23:54,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:23:54,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:54,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:54,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:23:54,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:54,986 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:23:54,987 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:23:54,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396742294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:54,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:23:54,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2025-03-04 15:23:54,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119305198] [2025-03-04 15:23:54,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:54,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:54,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:54,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:54,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:23:55,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 86 [2025-03-04 15:23:55,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 104 transitions, 345 flow. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:55,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:55,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 86 [2025-03-04 15:23:55,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:55,325 INFO L124 PetriNetUnfolderBase]: 2008/5280 cut-off events. [2025-03-04 15:23:55,326 INFO L125 PetriNetUnfolderBase]: For 312/312 co-relation queries the response was YES. [2025-03-04 15:23:55,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8505 conditions, 5280 events. 2008/5280 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 49432 event pairs, 1244 based on Foata normal form. 82/4243 useless extension candidates. Maximal degree in co-relation 8489. Up to 3035 conditions per place. [2025-03-04 15:23:55,350 INFO L140 encePairwiseOnDemand]: 82/86 looper letters, 54 selfloop transitions, 6 changer transitions 0/100 dead transitions. [2025-03-04 15:23:55,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 100 transitions, 439 flow [2025-03-04 15:23:55,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:55,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2025-03-04 15:23:55,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6453488372093024 [2025-03-04 15:23:55,352 INFO L175 Difference]: Start difference. First operand has 94 places, 104 transitions, 345 flow. Second operand 4 states and 222 transitions. [2025-03-04 15:23:55,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 100 transitions, 439 flow [2025-03-04 15:23:55,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 100 transitions, 433 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:23:55,355 INFO L231 Difference]: Finished difference. Result has 91 places, 100 transitions, 325 flow [2025-03-04 15:23:55,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=325, PETRI_PLACES=91, PETRI_TRANSITIONS=100} [2025-03-04 15:23:55,357 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 12 predicate places. [2025-03-04 15:23:55,357 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 100 transitions, 325 flow [2025-03-04 15:23:55,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:55,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:55,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:55,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:23:55,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:55,559 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:23:55,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:55,559 INFO L85 PathProgramCache]: Analyzing trace with hash 520273969, now seen corresponding path program 1 times [2025-03-04 15:23:55,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:55,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406283403] [2025-03-04 15:23:55,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:55,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:55,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:23:55,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:23:55,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:55,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:55,591 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:23:55,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:55,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406283403] [2025-03-04 15:23:55,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406283403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:55,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:55,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:55,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824181390] [2025-03-04 15:23:55,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:55,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:55,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:55,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:55,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:55,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 86 [2025-03-04 15:23:55,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 100 transitions, 325 flow. Second operand has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 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:23:55,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:55,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 86 [2025-03-04 15:23:55,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:56,190 INFO L124 PetriNetUnfolderBase]: 4048/9664 cut-off events. [2025-03-04 15:23:56,191 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-03-04 15:23:56,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16050 conditions, 9664 events. 4048/9664 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 93543 event pairs, 1796 based on Foata normal form. 104/7926 useless extension candidates. Maximal degree in co-relation 16036. Up to 3407 conditions per place. [2025-03-04 15:23:56,227 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 100 selfloop transitions, 3 changer transitions 0/141 dead transitions. [2025-03-04 15:23:56,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 141 transitions, 618 flow [2025-03-04 15:23:56,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2025-03-04 15:23:56,228 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7703488372093024 [2025-03-04 15:23:56,228 INFO L175 Difference]: Start difference. First operand has 91 places, 100 transitions, 325 flow. Second operand 4 states and 265 transitions. [2025-03-04 15:23:56,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 141 transitions, 618 flow [2025-03-04 15:23:56,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 141 transitions, 611 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:56,231 INFO L231 Difference]: Finished difference. Result has 94 places, 102 transitions, 340 flow [2025-03-04 15:23:56,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=340, PETRI_PLACES=94, PETRI_TRANSITIONS=102} [2025-03-04 15:23:56,231 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 15 predicate places. [2025-03-04 15:23:56,231 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 102 transitions, 340 flow [2025-03-04 15:23:56,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 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:23:56,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:56,234 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:56,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:23:56,234 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:23:56,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:56,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1051374463, now seen corresponding path program 1 times [2025-03-04 15:23:56,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:56,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988706379] [2025-03-04 15:23:56,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:56,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:56,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:23:56,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:23:56,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:56,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:56,285 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:23:56,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:56,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988706379] [2025-03-04 15:23:56,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988706379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:56,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:56,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:56,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938307432] [2025-03-04 15:23:56,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:56,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:56,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:56,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:56,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:56,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-04 15:23:56,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 102 transitions, 340 flow. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 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:23:56,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:56,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-04 15:23:56,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:57,274 INFO L124 PetriNetUnfolderBase]: 6552/14644 cut-off events. [2025-03-04 15:23:57,274 INFO L125 PetriNetUnfolderBase]: For 762/794 co-relation queries the response was YES. [2025-03-04 15:23:57,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25799 conditions, 14644 events. 6552/14644 cut-off events. For 762/794 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 146232 event pairs, 2228 based on Foata normal form. 416/12485 useless extension candidates. Maximal degree in co-relation 25784. Up to 5371 conditions per place. [2025-03-04 15:23:57,359 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 96 selfloop transitions, 5 changer transitions 0/135 dead transitions. [2025-03-04 15:23:57,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 135 transitions, 612 flow [2025-03-04 15:23:57,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:57,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:57,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2025-03-04 15:23:57,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7151162790697675 [2025-03-04 15:23:57,362 INFO L175 Difference]: Start difference. First operand has 94 places, 102 transitions, 340 flow. Second operand 4 states and 246 transitions. [2025-03-04 15:23:57,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 135 transitions, 612 flow [2025-03-04 15:23:57,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 135 transitions, 610 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:23:57,365 INFO L231 Difference]: Finished difference. Result has 98 places, 104 transitions, 372 flow [2025-03-04 15:23:57,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=372, PETRI_PLACES=98, PETRI_TRANSITIONS=104} [2025-03-04 15:23:57,366 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 19 predicate places. [2025-03-04 15:23:57,366 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 104 transitions, 372 flow [2025-03-04 15:23:57,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 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:23:57,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:57,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:57,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:23:57,366 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:23:57,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:57,367 INFO L85 PathProgramCache]: Analyzing trace with hash 635663584, now seen corresponding path program 1 times [2025-03-04 15:23:57,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:57,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832711821] [2025-03-04 15:23:57,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:57,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:57,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:23:57,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:23:57,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:57,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:57,402 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:23:57,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:57,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832711821] [2025-03-04 15:23:57,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832711821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:57,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:57,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:57,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943615722] [2025-03-04 15:23:57,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:57,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:57,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:57,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:57,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:57,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 86 [2025-03-04 15:23:57,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 104 transitions, 372 flow. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 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:23:57,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:57,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 86 [2025-03-04 15:23:57,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:58,602 INFO L124 PetriNetUnfolderBase]: 8564/20340 cut-off events. [2025-03-04 15:23:58,602 INFO L125 PetriNetUnfolderBase]: For 4902/5598 co-relation queries the response was YES. [2025-03-04 15:23:58,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37713 conditions, 20340 events. 8564/20340 cut-off events. For 4902/5598 co-relation queries the response was YES. Maximal size of possible extension queue 1014. Compared 220278 event pairs, 3396 based on Foata normal form. 456/17781 useless extension candidates. Maximal degree in co-relation 37696. Up to 7327 conditions per place. [2025-03-04 15:23:58,708 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 109 selfloop transitions, 3 changer transitions 0/150 dead transitions. [2025-03-04 15:23:58,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 150 transitions, 750 flow [2025-03-04 15:23:58,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:58,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:58,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2025-03-04 15:23:58,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7616279069767442 [2025-03-04 15:23:58,709 INFO L175 Difference]: Start difference. First operand has 98 places, 104 transitions, 372 flow. Second operand 4 states and 262 transitions. [2025-03-04 15:23:58,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 150 transitions, 750 flow [2025-03-04 15:23:58,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 150 transitions, 750 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:23:58,730 INFO L231 Difference]: Finished difference. Result has 103 places, 106 transitions, 394 flow [2025-03-04 15:23:58,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=394, PETRI_PLACES=103, PETRI_TRANSITIONS=106} [2025-03-04 15:23:58,731 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 24 predicate places. [2025-03-04 15:23:58,731 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 106 transitions, 394 flow [2025-03-04 15:23:58,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 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:23:58,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:58,731 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:58,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:23:58,731 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:23:58,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:58,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1767130646, now seen corresponding path program 1 times [2025-03-04 15:23:58,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:58,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129262717] [2025-03-04 15:23:58,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:58,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:58,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:23:58,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:23:58,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:58,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:58,815 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:23:58,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:58,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129262717] [2025-03-04 15:23:58,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129262717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:58,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:58,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:23:58,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881431746] [2025-03-04 15:23:58,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:58,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:23:58,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:58,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:23:58,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:23:58,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 86 [2025-03-04 15:23:58,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 106 transitions, 394 flow. Second operand has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 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:23:58,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:58,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 86 [2025-03-04 15:23:58,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:59,666 INFO L124 PetriNetUnfolderBase]: 4512/11654 cut-off events. [2025-03-04 15:23:59,666 INFO L125 PetriNetUnfolderBase]: For 3228/3456 co-relation queries the response was YES. [2025-03-04 15:23:59,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22192 conditions, 11654 events. 4512/11654 cut-off events. For 3228/3456 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 120914 event pairs, 2814 based on Foata normal form. 172/10337 useless extension candidates. Maximal degree in co-relation 22172. Up to 6023 conditions per place. [2025-03-04 15:23:59,753 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 114 selfloop transitions, 4 changer transitions 2/160 dead transitions. [2025-03-04 15:23:59,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 160 transitions, 821 flow [2025-03-04 15:23:59,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:23:59,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:23:59,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 318 transitions. [2025-03-04 15:23:59,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7395348837209302 [2025-03-04 15:23:59,754 INFO L175 Difference]: Start difference. First operand has 103 places, 106 transitions, 394 flow. Second operand 5 states and 318 transitions. [2025-03-04 15:23:59,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 160 transitions, 821 flow [2025-03-04 15:23:59,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 160 transitions, 815 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:23:59,768 INFO L231 Difference]: Finished difference. Result has 108 places, 107 transitions, 411 flow [2025-03-04 15:23:59,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=411, PETRI_PLACES=108, PETRI_TRANSITIONS=107} [2025-03-04 15:23:59,768 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 29 predicate places. [2025-03-04 15:23:59,769 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 107 transitions, 411 flow [2025-03-04 15:23:59,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 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:23:59,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:59,769 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:59,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:23:59,769 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:23:59,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:59,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1769263662, now seen corresponding path program 1 times [2025-03-04 15:23:59,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:59,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365404604] [2025-03-04 15:23:59,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:59,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:59,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:23:59,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:23:59,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:59,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:59,835 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:23:59,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:59,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365404604] [2025-03-04 15:23:59,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365404604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:59,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:59,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:59,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921730576] [2025-03-04 15:23:59,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:59,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:59,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:59,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:59,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:59,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-04 15:23:59,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 107 transitions, 411 flow. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 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:23:59,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:59,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-04 15:23:59,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:00,997 INFO L124 PetriNetUnfolderBase]: 8114/17852 cut-off events. [2025-03-04 15:24:00,997 INFO L125 PetriNetUnfolderBase]: For 6347/6755 co-relation queries the response was YES. [2025-03-04 15:24:01,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36531 conditions, 17852 events. 8114/17852 cut-off events. For 6347/6755 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 178826 event pairs, 3072 based on Foata normal form. 648/16417 useless extension candidates. Maximal degree in co-relation 36508. Up to 6801 conditions per place. [2025-03-04 15:24:01,201 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 109 selfloop transitions, 5 changer transitions 0/148 dead transitions. [2025-03-04 15:24:01,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 148 transitions, 803 flow [2025-03-04 15:24:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2025-03-04 15:24:01,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7093023255813954 [2025-03-04 15:24:01,202 INFO L175 Difference]: Start difference. First operand has 108 places, 107 transitions, 411 flow. Second operand 4 states and 244 transitions. [2025-03-04 15:24:01,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 148 transitions, 803 flow [2025-03-04 15:24:01,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 148 transitions, 798 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:24:01,245 INFO L231 Difference]: Finished difference. Result has 111 places, 109 transitions, 440 flow [2025-03-04 15:24:01,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=440, PETRI_PLACES=111, PETRI_TRANSITIONS=109} [2025-03-04 15:24:01,246 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 32 predicate places. [2025-03-04 15:24:01,246 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 109 transitions, 440 flow [2025-03-04 15:24:01,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 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:24:01,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:01,246 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:01,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:24:01,246 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:01,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:01,246 INFO L85 PathProgramCache]: Analyzing trace with hash 987401989, now seen corresponding path program 1 times [2025-03-04 15:24:01,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:01,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102708275] [2025-03-04 15:24:01,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:01,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:01,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:24:01,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:24:01,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:01,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:01,318 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:24:01,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:01,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102708275] [2025-03-04 15:24:01,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102708275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:01,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:01,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:24:01,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576986961] [2025-03-04 15:24:01,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:01,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:24:01,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:01,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:24:01,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:24:01,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 86 [2025-03-04 15:24:01,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 109 transitions, 440 flow. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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:24:01,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:01,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 86 [2025-03-04 15:24:01,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:02,097 INFO L124 PetriNetUnfolderBase]: 5302/13644 cut-off events. [2025-03-04 15:24:02,097 INFO L125 PetriNetUnfolderBase]: For 6318/6722 co-relation queries the response was YES. [2025-03-04 15:24:02,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28715 conditions, 13644 events. 5302/13644 cut-off events. For 6318/6722 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 145632 event pairs, 3548 based on Foata normal form. 226/12541 useless extension candidates. Maximal degree in co-relation 28691. Up to 7629 conditions per place. [2025-03-04 15:24:02,185 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 75 selfloop transitions, 3 changer transitions 21/139 dead transitions. [2025-03-04 15:24:02,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 139 transitions, 754 flow [2025-03-04 15:24:02,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:24:02,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:24:02,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 299 transitions. [2025-03-04 15:24:02,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6953488372093023 [2025-03-04 15:24:02,186 INFO L175 Difference]: Start difference. First operand has 111 places, 109 transitions, 440 flow. Second operand 5 states and 299 transitions. [2025-03-04 15:24:02,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 139 transitions, 754 flow [2025-03-04 15:24:02,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 139 transitions, 754 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:24:02,234 INFO L231 Difference]: Finished difference. Result has 117 places, 108 transitions, 443 flow [2025-03-04 15:24:02,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=443, PETRI_PLACES=117, PETRI_TRANSITIONS=108} [2025-03-04 15:24:02,234 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 38 predicate places. [2025-03-04 15:24:02,234 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 443 flow [2025-03-04 15:24:02,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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:24:02,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:02,234 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:02,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:24:02,235 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:02,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:02,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1871781663, now seen corresponding path program 1 times [2025-03-04 15:24:02,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:02,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722072494] [2025-03-04 15:24:02,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:02,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:02,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:24:02,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:24:02,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:02,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:02,305 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:24:02,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:02,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722072494] [2025-03-04 15:24:02,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722072494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:02,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:02,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:24:02,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95693244] [2025-03-04 15:24:02,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:02,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:24:02,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:02,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:24:02,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:24:02,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 86 [2025-03-04 15:24:02,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 443 flow. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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:24:02,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:02,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 86 [2025-03-04 15:24:02,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:02,870 INFO L124 PetriNetUnfolderBase]: 2930/7615 cut-off events. [2025-03-04 15:24:02,870 INFO L125 PetriNetUnfolderBase]: For 3701/3909 co-relation queries the response was YES. [2025-03-04 15:24:02,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16215 conditions, 7615 events. 2930/7615 cut-off events. For 3701/3909 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 73375 event pairs, 1882 based on Foata normal form. 148/7038 useless extension candidates. Maximal degree in co-relation 16187. Up to 3835 conditions per place. [2025-03-04 15:24:02,925 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 101 selfloop transitions, 8 changer transitions 2/151 dead transitions. [2025-03-04 15:24:02,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 151 transitions, 829 flow [2025-03-04 15:24:02,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:24:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:24:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 315 transitions. [2025-03-04 15:24:02,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7325581395348837 [2025-03-04 15:24:02,927 INFO L175 Difference]: Start difference. First operand has 117 places, 108 transitions, 443 flow. Second operand 5 states and 315 transitions. [2025-03-04 15:24:02,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 151 transitions, 829 flow [2025-03-04 15:24:02,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 151 transitions, 816 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 15:24:02,948 INFO L231 Difference]: Finished difference. Result has 117 places, 109 transitions, 463 flow [2025-03-04 15:24:02,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=463, PETRI_PLACES=117, PETRI_TRANSITIONS=109} [2025-03-04 15:24:02,949 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 38 predicate places. [2025-03-04 15:24:02,949 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 109 transitions, 463 flow [2025-03-04 15:24:02,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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:24:02,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:02,949 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-04 15:24:02,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:24:02,949 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:02,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:02,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1599544287, now seen corresponding path program 2 times [2025-03-04 15:24:02,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:02,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109338192] [2025-03-04 15:24:02,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:24:02,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:02,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:24:02,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:24:02,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:24:02,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:02,983 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:24:02,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:02,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109338192] [2025-03-04 15:24:02,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109338192] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:02,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984523545] [2025-03-04 15:24:02,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:24:02,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:02,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:02,987 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:24:02,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:24:03,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:24:03,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:24:03,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:24:03,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:03,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:24:03,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:03,065 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:24:03,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:24:03,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984523545] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:03,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:03,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:24:03,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128002670] [2025-03-04 15:24:03,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:03,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:03,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:03,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:03,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:03,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 86 [2025-03-04 15:24:03,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 463 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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:24:03,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:03,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 86 [2025-03-04 15:24:03,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:03,514 INFO L124 PetriNetUnfolderBase]: 2934/7620 cut-off events. [2025-03-04 15:24:03,514 INFO L125 PetriNetUnfolderBase]: For 4036/4246 co-relation queries the response was YES. [2025-03-04 15:24:03,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16255 conditions, 7620 events. 2934/7620 cut-off events. For 4036/4246 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 73246 event pairs, 2005 based on Foata normal form. 103/6987 useless extension candidates. Maximal degree in co-relation 16228. Up to 4356 conditions per place. [2025-03-04 15:24:03,549 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 54 selfloop transitions, 16 changer transitions 0/108 dead transitions. [2025-03-04 15:24:03,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 108 transitions, 593 flow [2025-03-04 15:24:03,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:03,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2025-03-04 15:24:03,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.622093023255814 [2025-03-04 15:24:03,550 INFO L175 Difference]: Start difference. First operand has 117 places, 109 transitions, 463 flow. Second operand 4 states and 214 transitions. [2025-03-04 15:24:03,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 108 transitions, 593 flow [2025-03-04 15:24:03,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 108 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:24:03,566 INFO L231 Difference]: Finished difference. Result has 117 places, 108 transitions, 472 flow [2025-03-04 15:24:03,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=472, PETRI_PLACES=117, PETRI_TRANSITIONS=108} [2025-03-04 15:24:03,566 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 38 predicate places. [2025-03-04 15:24:03,566 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 472 flow [2025-03-04 15:24:03,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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:24:03,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:03,566 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1] [2025-03-04 15:24:03,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:24:03,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 15:24:03,767 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:03,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:03,767 INFO L85 PathProgramCache]: Analyzing trace with hash 893435422, now seen corresponding path program 1 times [2025-03-04 15:24:03,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:03,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030077483] [2025-03-04 15:24:03,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:03,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:03,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:24:03,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:24:03,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:03,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:03,875 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:24:03,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:03,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030077483] [2025-03-04 15:24:03,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030077483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:03,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748150029] [2025-03-04 15:24:03,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:03,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:03,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:03,878 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:24:03,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:24:03,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:24:03,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:24:03,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:03,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:03,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:24:03,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:03,973 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:24:03,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:24:04,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748150029] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:04,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:04,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-04 15:24:04,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150036139] [2025-03-04 15:24:04,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:04,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 15:24:04,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:04,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 15:24:04,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 15:24:04,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 86 [2025-03-04 15:24:04,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 472 flow. Second operand has 24 states, 24 states have (on average 45.083333333333336) internal successors, (1082), 24 states have internal predecessors, (1082), 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:24:04,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:04,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 86 [2025-03-04 15:24:04,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:04,768 INFO L124 PetriNetUnfolderBase]: 2951/7581 cut-off events. [2025-03-04 15:24:04,768 INFO L125 PetriNetUnfolderBase]: For 4302/4522 co-relation queries the response was YES. [2025-03-04 15:24:04,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16330 conditions, 7581 events. 2951/7581 cut-off events. For 4302/4522 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 72434 event pairs, 1996 based on Foata normal form. 114/6956 useless extension candidates. Maximal degree in co-relation 16302. Up to 4361 conditions per place. [2025-03-04 15:24:04,828 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 45 selfloop transitions, 61 changer transitions 0/144 dead transitions. [2025-03-04 15:24:04,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 144 transitions, 900 flow [2025-03-04 15:24:04,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 15:24:04,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 15:24:04,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1071 transitions. [2025-03-04 15:24:04,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5660676532769556 [2025-03-04 15:24:04,831 INFO L175 Difference]: Start difference. First operand has 117 places, 108 transitions, 472 flow. Second operand 22 states and 1071 transitions. [2025-03-04 15:24:04,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 144 transitions, 900 flow [2025-03-04 15:24:04,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 144 transitions, 832 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:24:04,850 INFO L231 Difference]: Finished difference. Result has 141 places, 144 transitions, 788 flow [2025-03-04 15:24:04,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=788, PETRI_PLACES=141, PETRI_TRANSITIONS=144} [2025-03-04 15:24:04,852 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 62 predicate places. [2025-03-04 15:24:04,852 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 144 transitions, 788 flow [2025-03-04 15:24:04,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 45.083333333333336) internal successors, (1082), 24 states have internal predecessors, (1082), 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:24:04,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:04,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:04,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:24:05,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 15:24:05,057 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:05,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:05,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1522185778, now seen corresponding path program 1 times [2025-03-04 15:24:05,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:05,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302301966] [2025-03-04 15:24:05,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:05,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:05,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:24:05,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:24:05,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:05,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:05,127 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:24:05,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:05,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302301966] [2025-03-04 15:24:05,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302301966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:05,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:05,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:24:05,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916888402] [2025-03-04 15:24:05,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:05,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:24:05,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:05,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:24:05,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:24:05,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 86 [2025-03-04 15:24:05,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 144 transitions, 788 flow. Second operand has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 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:24:05,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:05,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 86 [2025-03-04 15:24:05,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:05,716 INFO L124 PetriNetUnfolderBase]: 2671/6902 cut-off events. [2025-03-04 15:24:05,716 INFO L125 PetriNetUnfolderBase]: For 3689/3895 co-relation queries the response was YES. [2025-03-04 15:24:05,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14895 conditions, 6902 events. 2671/6902 cut-off events. For 3689/3895 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 65528 event pairs, 1770 based on Foata normal form. 109/6346 useless extension candidates. Maximal degree in co-relation 14861. Up to 3883 conditions per place. [2025-03-04 15:24:05,767 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 91 selfloop transitions, 12 changer transitions 17/159 dead transitions. [2025-03-04 15:24:05,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 159 transitions, 1075 flow [2025-03-04 15:24:05,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:24:05,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:24:05,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 296 transitions. [2025-03-04 15:24:05,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6883720930232559 [2025-03-04 15:24:05,772 INFO L175 Difference]: Start difference. First operand has 141 places, 144 transitions, 788 flow. Second operand 5 states and 296 transitions. [2025-03-04 15:24:05,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 159 transitions, 1075 flow [2025-03-04 15:24:05,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 159 transitions, 919 flow, removed 47 selfloop flow, removed 9 redundant places. [2025-03-04 15:24:05,792 INFO L231 Difference]: Finished difference. Result has 138 places, 142 transitions, 642 flow [2025-03-04 15:24:05,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=642, PETRI_PLACES=138, PETRI_TRANSITIONS=142} [2025-03-04 15:24:05,792 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 59 predicate places. [2025-03-04 15:24:05,792 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 142 transitions, 642 flow [2025-03-04 15:24:05,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 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:24:05,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:05,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:05,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:24:05,793 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:05,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:05,793 INFO L85 PathProgramCache]: Analyzing trace with hash 236239364, now seen corresponding path program 1 times [2025-03-04 15:24:05,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:05,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861212546] [2025-03-04 15:24:05,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:05,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:05,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:24:05,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:24:05,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:05,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:06,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:24:06,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:06,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861212546] [2025-03-04 15:24:06,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861212546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:06,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330655188] [2025-03-04 15:24:06,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:06,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:06,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:06,091 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:24:06,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:24:06,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:24:06,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:24:06,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:06,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:06,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:24:06,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:06,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:24:06,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 15:24:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:24:06,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:06,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-04 15:24:06,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-04 15:24:06,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:24:06,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330655188] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:06,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:06,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 15:24:06,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546987862] [2025-03-04 15:24:06,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:06,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 15:24:06,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:06,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:24:06,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:24:06,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 86 [2025-03-04 15:24:06,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 142 transitions, 642 flow. Second operand has 15 states, 15 states have (on average 47.06666666666667) internal successors, (706), 15 states have internal predecessors, (706), 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:24:06,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:06,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 86 [2025-03-04 15:24:06,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:07,338 INFO L124 PetriNetUnfolderBase]: 3052/7568 cut-off events. [2025-03-04 15:24:07,339 INFO L125 PetriNetUnfolderBase]: For 4216/4447 co-relation queries the response was YES. [2025-03-04 15:24:07,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16550 conditions, 7568 events. 3052/7568 cut-off events. For 4216/4447 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 71252 event pairs, 918 based on Foata normal form. 100/6926 useless extension candidates. Maximal degree in co-relation 16515. Up to 1638 conditions per place. [2025-03-04 15:24:07,401 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 161 selfloop transitions, 35 changer transitions 0/233 dead transitions. [2025-03-04 15:24:07,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 233 transitions, 1393 flow [2025-03-04 15:24:07,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:24:07,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:24:07,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 571 transitions. [2025-03-04 15:24:07,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.663953488372093 [2025-03-04 15:24:07,403 INFO L175 Difference]: Start difference. First operand has 138 places, 142 transitions, 642 flow. Second operand 10 states and 571 transitions. [2025-03-04 15:24:07,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 233 transitions, 1393 flow [2025-03-04 15:24:07,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 233 transitions, 1343 flow, removed 13 selfloop flow, removed 6 redundant places. [2025-03-04 15:24:07,428 INFO L231 Difference]: Finished difference. Result has 139 places, 149 transitions, 747 flow [2025-03-04 15:24:07,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=747, PETRI_PLACES=139, PETRI_TRANSITIONS=149} [2025-03-04 15:24:07,429 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 60 predicate places. [2025-03-04 15:24:07,429 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 149 transitions, 747 flow [2025-03-04 15:24:07,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 47.06666666666667) internal successors, (706), 15 states have internal predecessors, (706), 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:24:07,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:07,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:07,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:24:07,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 15:24:07,630 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:07,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:07,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1266544425, now seen corresponding path program 1 times [2025-03-04 15:24:07,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:07,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743682407] [2025-03-04 15:24:07,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:07,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:07,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:24:07,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:24:07,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:07,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:24:07,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:07,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743682407] [2025-03-04 15:24:07,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743682407] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:07,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005553210] [2025-03-04 15:24:07,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:07,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:07,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:07,852 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:24:07,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:24:07,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:24:07,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:24:07,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:07,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:07,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:24:07,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:07,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:24:07,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 15:24:07,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:24:07,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:08,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-04 15:24:08,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-04 15:24:08,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:24:08,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005553210] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:08,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:08,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 15:24:08,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836407187] [2025-03-04 15:24:08,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:08,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 15:24:08,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:08,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:24:08,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:24:08,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 86 [2025-03-04 15:24:08,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 149 transitions, 747 flow. Second operand has 15 states, 15 states have (on average 45.2) internal successors, (678), 15 states have internal predecessors, (678), 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:24:08,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:08,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 86 [2025-03-04 15:24:08,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:09,116 INFO L124 PetriNetUnfolderBase]: 3612/8156 cut-off events. [2025-03-04 15:24:09,117 INFO L125 PetriNetUnfolderBase]: For 7005/7302 co-relation queries the response was YES. [2025-03-04 15:24:09,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19289 conditions, 8156 events. 3612/8156 cut-off events. For 7005/7302 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 73190 event pairs, 1162 based on Foata normal form. 178/7640 useless extension candidates. Maximal degree in co-relation 19254. Up to 2076 conditions per place. [2025-03-04 15:24:09,184 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 165 selfloop transitions, 35 changer transitions 0/234 dead transitions. [2025-03-04 15:24:09,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 234 transitions, 1462 flow [2025-03-04 15:24:09,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:24:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:24:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 551 transitions. [2025-03-04 15:24:09,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6406976744186047 [2025-03-04 15:24:09,189 INFO L175 Difference]: Start difference. First operand has 139 places, 149 transitions, 747 flow. Second operand 10 states and 551 transitions. [2025-03-04 15:24:09,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 234 transitions, 1462 flow [2025-03-04 15:24:09,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 234 transitions, 1442 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 15:24:09,212 INFO L231 Difference]: Finished difference. Result has 147 places, 151 transitions, 828 flow [2025-03-04 15:24:09,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=828, PETRI_PLACES=147, PETRI_TRANSITIONS=151} [2025-03-04 15:24:09,213 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 68 predicate places. [2025-03-04 15:24:09,213 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 151 transitions, 828 flow [2025-03-04 15:24:09,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 45.2) internal successors, (678), 15 states have internal predecessors, (678), 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:24:09,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:09,213 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:09,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 15:24:09,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:09,414 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:09,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:09,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1320304781, now seen corresponding path program 1 times [2025-03-04 15:24:09,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:09,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173807989] [2025-03-04 15:24:09,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:09,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:09,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:24:09,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:24:09,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:09,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:09,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:24:09,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:09,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173807989] [2025-03-04 15:24:09,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173807989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:09,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780412064] [2025-03-04 15:24:09,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:09,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:09,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:09,774 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:24:09,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 15:24:09,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:24:09,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:24:09,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:09,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:09,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:24:09,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:09,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:24:09,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:24:09,905 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:24:09,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:24:09,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 15:24:09,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 15:24:09,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:24:09,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:10,029 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_195 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_195) c_~a1~0.base) c_~a1~0.offset) 9223372039002259456)) is different from false [2025-03-04 15:24:10,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:24:10,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-04 15:24:10,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:24:10,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2025-03-04 15:24:10,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-04 15:24:10,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-04 15:24:10,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780412064] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:10,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:10,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2025-03-04 15:24:10,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325360755] [2025-03-04 15:24:10,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:10,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 15:24:10,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:10,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 15:24:10,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=288, Unknown=1, NotChecked=34, Total=380 [2025-03-04 15:24:10,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 86 [2025-03-04 15:24:10,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 151 transitions, 828 flow. Second operand has 20 states, 20 states have (on average 27.75) internal successors, (555), 20 states have internal predecessors, (555), 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:24:10,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:10,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 86 [2025-03-04 15:24:10,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:12,189 INFO L124 PetriNetUnfolderBase]: 11565/20431 cut-off events. [2025-03-04 15:24:12,189 INFO L125 PetriNetUnfolderBase]: For 29383/30759 co-relation queries the response was YES. [2025-03-04 15:24:12,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55599 conditions, 20431 events. 11565/20431 cut-off events. For 29383/30759 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 167293 event pairs, 2686 based on Foata normal form. 600/19027 useless extension candidates. Maximal degree in co-relation 55562. Up to 3021 conditions per place. [2025-03-04 15:24:12,478 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 449 selfloop transitions, 61 changer transitions 14/550 dead transitions. [2025-03-04 15:24:12,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 550 transitions, 4029 flow [2025-03-04 15:24:12,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 15:24:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 15:24:12,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 915 transitions. [2025-03-04 15:24:12,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4433139534883721 [2025-03-04 15:24:12,481 INFO L175 Difference]: Start difference. First operand has 147 places, 151 transitions, 828 flow. Second operand 24 states and 915 transitions. [2025-03-04 15:24:12,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 550 transitions, 4029 flow [2025-03-04 15:24:12,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 550 transitions, 3849 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-04 15:24:12,588 INFO L231 Difference]: Finished difference. Result has 169 places, 183 transitions, 1165 flow [2025-03-04 15:24:12,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1165, PETRI_PLACES=169, PETRI_TRANSITIONS=183} [2025-03-04 15:24:12,590 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 90 predicate places. [2025-03-04 15:24:12,590 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 183 transitions, 1165 flow [2025-03-04 15:24:12,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 27.75) internal successors, (555), 20 states have internal predecessors, (555), 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:24:12,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:12,590 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:12,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 15:24:12,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:12,790 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:12,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:12,791 INFO L85 PathProgramCache]: Analyzing trace with hash -638690824, now seen corresponding path program 1 times [2025-03-04 15:24:12,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:12,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107971448] [2025-03-04 15:24:12,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:12,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:12,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:24:12,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:24:12,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:12,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:12,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:24:12,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:12,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107971448] [2025-03-04 15:24:12,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107971448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:12,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733138839] [2025-03-04 15:24:12,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:12,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:12,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:12,850 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:24:12,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 15:24:12,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:24:12,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:24:12,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:12,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:12,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:24:12,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:24:13,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:13,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:24:13,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733138839] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:13,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:13,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2025-03-04 15:24:13,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050723421] [2025-03-04 15:24:13,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:13,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:24:13,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:13,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:24:13,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:24:13,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-04 15:24:13,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 183 transitions, 1165 flow. Second operand has 19 states, 19 states have (on average 44.21052631578947) internal successors, (840), 19 states have internal predecessors, (840), 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:24:13,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:13,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-04 15:24:13,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:14,847 INFO L124 PetriNetUnfolderBase]: 4512/11362 cut-off events. [2025-03-04 15:24:14,847 INFO L125 PetriNetUnfolderBase]: For 17141/17545 co-relation queries the response was YES. [2025-03-04 15:24:14,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29296 conditions, 11362 events. 4512/11362 cut-off events. For 17141/17545 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 115264 event pairs, 1070 based on Foata normal form. 306/10681 useless extension candidates. Maximal degree in co-relation 29254. Up to 1945 conditions per place. [2025-03-04 15:24:14,901 INFO L140 encePairwiseOnDemand]: 75/86 looper letters, 309 selfloop transitions, 57 changer transitions 12/419 dead transitions. [2025-03-04 15:24:14,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 419 transitions, 3232 flow [2025-03-04 15:24:14,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 15:24:14,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 15:24:14,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 915 transitions. [2025-03-04 15:24:14,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6258549931600548 [2025-03-04 15:24:14,904 INFO L175 Difference]: Start difference. First operand has 169 places, 183 transitions, 1165 flow. Second operand 17 states and 915 transitions. [2025-03-04 15:24:14,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 419 transitions, 3232 flow [2025-03-04 15:24:14,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 419 transitions, 3115 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-04 15:24:14,951 INFO L231 Difference]: Finished difference. Result has 179 places, 206 transitions, 1445 flow [2025-03-04 15:24:14,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1074, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1445, PETRI_PLACES=179, PETRI_TRANSITIONS=206} [2025-03-04 15:24:14,951 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 100 predicate places. [2025-03-04 15:24:14,951 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 206 transitions, 1445 flow [2025-03-04 15:24:14,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 44.21052631578947) internal successors, (840), 19 states have internal predecessors, (840), 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:24:14,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:14,952 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:14,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 15:24:15,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:15,152 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:15,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:15,153 INFO L85 PathProgramCache]: Analyzing trace with hash -608170873, now seen corresponding path program 1 times [2025-03-04 15:24:15,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:15,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93279484] [2025-03-04 15:24:15,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:15,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:15,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:24:15,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:24:15,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:15,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:15,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:24:15,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:15,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93279484] [2025-03-04 15:24:15,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93279484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:15,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:15,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:15,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343350272] [2025-03-04 15:24:15,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:15,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:15,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:15,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:15,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:15,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-04 15:24:15,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 206 transitions, 1445 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 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:24:15,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:15,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-04 15:24:15,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:16,088 INFO L124 PetriNetUnfolderBase]: 5393/13025 cut-off events. [2025-03-04 15:24:16,089 INFO L125 PetriNetUnfolderBase]: For 20896/21234 co-relation queries the response was YES. [2025-03-04 15:24:16,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33912 conditions, 13025 events. 5393/13025 cut-off events. For 20896/21234 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 131617 event pairs, 2470 based on Foata normal form. 300/12139 useless extension candidates. Maximal degree in co-relation 33870. Up to 5356 conditions per place. [2025-03-04 15:24:16,210 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 232 selfloop transitions, 8 changer transitions 0/275 dead transitions. [2025-03-04 15:24:16,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 275 transitions, 2342 flow [2025-03-04 15:24:16,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:16,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2025-03-04 15:24:16,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7063953488372093 [2025-03-04 15:24:16,211 INFO L175 Difference]: Start difference. First operand has 179 places, 206 transitions, 1445 flow. Second operand 4 states and 243 transitions. [2025-03-04 15:24:16,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 275 transitions, 2342 flow [2025-03-04 15:24:16,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 275 transitions, 2311 flow, removed 1 selfloop flow, removed 9 redundant places. [2025-03-04 15:24:16,317 INFO L231 Difference]: Finished difference. Result has 173 places, 204 transitions, 1413 flow [2025-03-04 15:24:16,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1413, PETRI_PLACES=173, PETRI_TRANSITIONS=204} [2025-03-04 15:24:16,317 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 94 predicate places. [2025-03-04 15:24:16,317 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 204 transitions, 1413 flow [2025-03-04 15:24:16,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 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:24:16,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:16,318 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:16,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 15:24:16,318 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:16,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:16,318 INFO L85 PathProgramCache]: Analyzing trace with hash -608171866, now seen corresponding path program 1 times [2025-03-04 15:24:16,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:16,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004764238] [2025-03-04 15:24:16,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:16,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:16,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:24:16,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:24:16,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:16,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:16,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:24:16,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:16,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004764238] [2025-03-04 15:24:16,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004764238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:16,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339456346] [2025-03-04 15:24:16,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:16,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:16,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:16,518 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:24:16,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 15:24:16,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:24:16,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:24:16,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:16,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:16,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:24:16,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:16,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:24:16,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:24:16,619 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:24:16,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:24:16,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 15:24:16,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 15:24:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:24:16,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:16,759 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_239 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_239) c_~a1~0.base) c_~a1~0.offset) 2147483649))) is different from false [2025-03-04 15:24:16,771 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_239 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_124| Int)) (or (< 0 (+ (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_124| v_ArrVal_239) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483649)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_124|) 0)))) is different from false [2025-03-04 15:24:16,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:24:16,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-04 15:24:16,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:24:16,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2025-03-04 15:24:16,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-03-04 15:24:16,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-04 15:24:16,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339456346] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:16,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:16,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-03-04 15:24:16,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888097879] [2025-03-04 15:24:16,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:16,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 15:24:16,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:16,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 15:24:16,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=256, Unknown=2, NotChecked=66, Total=380 [2025-03-04 15:24:16,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2025-03-04 15:24:16,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 204 transitions, 1413 flow. Second operand has 20 states, 20 states have (on average 38.05) internal successors, (761), 20 states have internal predecessors, (761), 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:24:16,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:16,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2025-03-04 15:24:16,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:18,407 INFO L124 PetriNetUnfolderBase]: 7987/14276 cut-off events. [2025-03-04 15:24:18,407 INFO L125 PetriNetUnfolderBase]: For 22106/23331 co-relation queries the response was YES. [2025-03-04 15:24:18,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41316 conditions, 14276 events. 7987/14276 cut-off events. For 22106/23331 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 115088 event pairs, 1581 based on Foata normal form. 414/14048 useless extension candidates. Maximal degree in co-relation 41276. Up to 3211 conditions per place. [2025-03-04 15:24:18,485 INFO L140 encePairwiseOnDemand]: 69/86 looper letters, 418 selfloop transitions, 56 changer transitions 0/502 dead transitions. [2025-03-04 15:24:18,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 502 transitions, 4128 flow [2025-03-04 15:24:18,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 15:24:18,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 15:24:18,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 820 transitions. [2025-03-04 15:24:18,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.560875512995896 [2025-03-04 15:24:18,487 INFO L175 Difference]: Start difference. First operand has 173 places, 204 transitions, 1413 flow. Second operand 17 states and 820 transitions. [2025-03-04 15:24:18,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 502 transitions, 4128 flow [2025-03-04 15:24:18,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 502 transitions, 4115 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:24:18,544 INFO L231 Difference]: Finished difference. Result has 193 places, 209 transitions, 1590 flow [2025-03-04 15:24:18,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1401, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1590, PETRI_PLACES=193, PETRI_TRANSITIONS=209} [2025-03-04 15:24:18,545 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 114 predicate places. [2025-03-04 15:24:18,545 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 209 transitions, 1590 flow [2025-03-04 15:24:18,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 38.05) internal successors, (761), 20 states have internal predecessors, (761), 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:24:18,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:18,545 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:18,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 15:24:18,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 15:24:18,746 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:18,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:18,746 INFO L85 PathProgramCache]: Analyzing trace with hash 2020194664, now seen corresponding path program 1 times [2025-03-04 15:24:18,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:18,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608444041] [2025-03-04 15:24:18,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:18,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:18,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:24:18,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:24:18,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:18,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:24:18,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:18,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608444041] [2025-03-04 15:24:18,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608444041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:18,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348294899] [2025-03-04 15:24:18,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:18,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:18,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:18,926 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:24:18,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 15:24:18,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:24:18,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:24:18,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:18,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:18,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:24:18,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:18,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:24:19,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:24:19,025 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:24:19,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:24:19,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 15:24:19,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 15:24:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:24:19,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:19,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:24:19,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-04 15:24:19,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:24:19,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2025-03-04 15:24:19,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-03-04 15:24:19,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:24:19,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348294899] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:19,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:19,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-03-04 15:24:19,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321270670] [2025-03-04 15:24:19,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:19,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:24:19,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:19,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:24:19,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=278, Unknown=3, NotChecked=0, Total=342 [2025-03-04 15:24:19,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 86 [2025-03-04 15:24:19,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 209 transitions, 1590 flow. Second operand has 19 states, 19 states have (on average 40.421052631578945) internal successors, (768), 19 states have internal predecessors, (768), 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:24:19,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:19,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 86 [2025-03-04 15:24:19,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:20,787 INFO L124 PetriNetUnfolderBase]: 8481/15451 cut-off events. [2025-03-04 15:24:20,787 INFO L125 PetriNetUnfolderBase]: For 38525/39223 co-relation queries the response was YES. [2025-03-04 15:24:20,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46853 conditions, 15451 events. 8481/15451 cut-off events. For 38525/39223 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 128290 event pairs, 2583 based on Foata normal form. 460/14841 useless extension candidates. Maximal degree in co-relation 46806. Up to 5216 conditions per place. [2025-03-04 15:24:21,012 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 273 selfloop transitions, 55 changer transitions 0/360 dead transitions. [2025-03-04 15:24:21,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 360 transitions, 3309 flow [2025-03-04 15:24:21,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:24:21,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:24:21,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 627 transitions. [2025-03-04 15:24:21,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5608228980322003 [2025-03-04 15:24:21,013 INFO L175 Difference]: Start difference. First operand has 193 places, 209 transitions, 1590 flow. Second operand 13 states and 627 transitions. [2025-03-04 15:24:21,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 360 transitions, 3309 flow [2025-03-04 15:24:21,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 360 transitions, 3137 flow, removed 15 selfloop flow, removed 11 redundant places. [2025-03-04 15:24:21,097 INFO L231 Difference]: Finished difference. Result has 196 places, 211 transitions, 1659 flow [2025-03-04 15:24:21,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1659, PETRI_PLACES=196, PETRI_TRANSITIONS=211} [2025-03-04 15:24:21,098 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 117 predicate places. [2025-03-04 15:24:21,098 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 211 transitions, 1659 flow [2025-03-04 15:24:21,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 40.421052631578945) internal successors, (768), 19 states have internal predecessors, (768), 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:24:21,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:21,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:21,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 15:24:21,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 15:24:21,298 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:21,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:21,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1673458022, now seen corresponding path program 1 times [2025-03-04 15:24:21,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:21,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115642492] [2025-03-04 15:24:21,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:21,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:21,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:24:21,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:24:21,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:21,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:24:21,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:21,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115642492] [2025-03-04 15:24:21,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115642492] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:21,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536235108] [2025-03-04 15:24:21,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:21,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:21,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:21,503 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:24:21,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 15:24:21,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:24:21,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:24:21,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:21,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:21,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 15:24:21,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:21,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:24:21,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:24:21,611 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:24:21,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:24:21,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 15:24:21,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 15:24:21,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:24:21,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:21,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:24:21,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-04 15:24:21,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:24:21,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2025-03-04 15:24:21,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-04 15:24:21,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:24:21,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536235108] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:21,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:21,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-04 15:24:21,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880477526] [2025-03-04 15:24:21,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:21,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 15:24:21,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:21,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 15:24:21,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=351, Unknown=5, NotChecked=0, Total=420 [2025-03-04 15:24:21,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2025-03-04 15:24:21,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 211 transitions, 1659 flow. Second operand has 21 states, 21 states have (on average 38.04761904761905) internal successors, (799), 21 states have internal predecessors, (799), 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:24:21,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:21,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2025-03-04 15:24:21,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:23,836 INFO L124 PetriNetUnfolderBase]: 8652/14985 cut-off events. [2025-03-04 15:24:23,836 INFO L125 PetriNetUnfolderBase]: For 31422/32320 co-relation queries the response was YES. [2025-03-04 15:24:24,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47300 conditions, 14985 events. 8652/14985 cut-off events. For 31422/32320 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 118469 event pairs, 1905 based on Foata normal form. 848/15293 useless extension candidates. Maximal degree in co-relation 47252. Up to 3815 conditions per place. [2025-03-04 15:24:24,114 INFO L140 encePairwiseOnDemand]: 67/86 looper letters, 417 selfloop transitions, 58 changer transitions 33/540 dead transitions. [2025-03-04 15:24:24,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 540 transitions, 4910 flow [2025-03-04 15:24:24,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 15:24:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 15:24:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 867 transitions. [2025-03-04 15:24:24,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.560077519379845 [2025-03-04 15:24:24,119 INFO L175 Difference]: Start difference. First operand has 196 places, 211 transitions, 1659 flow. Second operand 18 states and 867 transitions. [2025-03-04 15:24:24,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 540 transitions, 4910 flow [2025-03-04 15:24:24,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 540 transitions, 4650 flow, removed 2 selfloop flow, removed 11 redundant places. [2025-03-04 15:24:24,229 INFO L231 Difference]: Finished difference. Result has 207 places, 218 transitions, 1772 flow [2025-03-04 15:24:24,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1575, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1772, PETRI_PLACES=207, PETRI_TRANSITIONS=218} [2025-03-04 15:24:24,230 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 128 predicate places. [2025-03-04 15:24:24,230 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 218 transitions, 1772 flow [2025-03-04 15:24:24,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 38.04761904761905) internal successors, (799), 21 states have internal predecessors, (799), 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:24:24,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:24,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:24,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 15:24:24,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 15:24:24,431 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:24,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:24,432 INFO L85 PathProgramCache]: Analyzing trace with hash 581098445, now seen corresponding path program 1 times [2025-03-04 15:24:24,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:24,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177733901] [2025-03-04 15:24:24,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:24,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:24,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:24:24,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:24:24,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:24,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:24:24,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:24,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177733901] [2025-03-04 15:24:24,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177733901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:24,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:24,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:24,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625103526] [2025-03-04 15:24:24,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:24,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:24,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:24,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:24,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:24,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-04 15:24:24,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 218 transitions, 1772 flow. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 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:24:24,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:24,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-04 15:24:24,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:25,568 INFO L124 PetriNetUnfolderBase]: 6031/13114 cut-off events. [2025-03-04 15:24:25,568 INFO L125 PetriNetUnfolderBase]: For 33303/33731 co-relation queries the response was YES. [2025-03-04 15:24:25,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41083 conditions, 13114 events. 6031/13114 cut-off events. For 33303/33731 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 123641 event pairs, 2536 based on Foata normal form. 436/12976 useless extension candidates. Maximal degree in co-relation 41032. Up to 5585 conditions per place. [2025-03-04 15:24:25,849 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 235 selfloop transitions, 10 changer transitions 0/286 dead transitions. [2025-03-04 15:24:25,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 286 transitions, 2698 flow [2025-03-04 15:24:25,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:25,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2025-03-04 15:24:25,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7005813953488372 [2025-03-04 15:24:25,850 INFO L175 Difference]: Start difference. First operand has 207 places, 218 transitions, 1772 flow. Second operand 4 states and 241 transitions. [2025-03-04 15:24:25,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 286 transitions, 2698 flow [2025-03-04 15:24:25,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 286 transitions, 2584 flow, removed 4 selfloop flow, removed 12 redundant places. [2025-03-04 15:24:25,945 INFO L231 Difference]: Finished difference. Result has 197 places, 216 transitions, 1662 flow [2025-03-04 15:24:25,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1642, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1662, PETRI_PLACES=197, PETRI_TRANSITIONS=216} [2025-03-04 15:24:25,946 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 118 predicate places. [2025-03-04 15:24:25,946 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 216 transitions, 1662 flow [2025-03-04 15:24:25,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 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:24:25,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:25,946 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:25,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 15:24:25,946 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:25,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:25,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1828994137, now seen corresponding path program 1 times [2025-03-04 15:24:25,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:25,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780247552] [2025-03-04 15:24:25,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:25,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:25,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:24:25,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:24:25,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:25,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:24:26,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:26,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780247552] [2025-03-04 15:24:26,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780247552] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:26,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018510249] [2025-03-04 15:24:26,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:26,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:26,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:26,007 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:24:26,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 15:24:26,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:24:26,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:24:26,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:26,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:26,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:24:26,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:26,163 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:24:26,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:26,265 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:24:26,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018510249] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:26,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:26,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-04 15:24:26,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438763791] [2025-03-04 15:24:26,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:26,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:24:26,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:26,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:24:26,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:24:26,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-04 15:24:26,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 216 transitions, 1662 flow. Second operand has 19 states, 19 states have (on average 44.26315789473684) internal successors, (841), 19 states have internal predecessors, (841), 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:24:26,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:26,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-04 15:24:26,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:28,487 INFO L124 PetriNetUnfolderBase]: 7221/17388 cut-off events. [2025-03-04 15:24:28,487 INFO L125 PetriNetUnfolderBase]: For 43732/44372 co-relation queries the response was YES. [2025-03-04 15:24:28,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50473 conditions, 17388 events. 7221/17388 cut-off events. For 43732/44372 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 182231 event pairs, 314 based on Foata normal form. 548/16650 useless extension candidates. Maximal degree in co-relation 50425. Up to 3115 conditions per place. [2025-03-04 15:24:28,780 INFO L140 encePairwiseOnDemand]: 75/86 looper letters, 335 selfloop transitions, 91 changer transitions 37/507 dead transitions. [2025-03-04 15:24:28,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 507 transitions, 4731 flow [2025-03-04 15:24:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:24:28,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 15:24:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 771 transitions. [2025-03-04 15:24:28,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6403654485049833 [2025-03-04 15:24:28,781 INFO L175 Difference]: Start difference. First operand has 197 places, 216 transitions, 1662 flow. Second operand 14 states and 771 transitions. [2025-03-04 15:24:28,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 507 transitions, 4731 flow [2025-03-04 15:24:28,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 507 transitions, 4639 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:24:28,968 INFO L231 Difference]: Finished difference. Result has 208 places, 219 transitions, 1867 flow [2025-03-04 15:24:28,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1646, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1867, PETRI_PLACES=208, PETRI_TRANSITIONS=219} [2025-03-04 15:24:28,969 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 129 predicate places. [2025-03-04 15:24:28,969 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 219 transitions, 1867 flow [2025-03-04 15:24:28,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 44.26315789473684) internal successors, (841), 19 states have internal predecessors, (841), 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:24:28,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:28,969 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:28,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 15:24:29,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 15:24:29,170 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:29,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:29,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1798475179, now seen corresponding path program 1 times [2025-03-04 15:24:29,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:29,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681346340] [2025-03-04 15:24:29,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:29,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:29,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:24:29,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:24:29,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:29,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:29,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:24:29,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:29,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681346340] [2025-03-04 15:24:29,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681346340] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:29,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826919725] [2025-03-04 15:24:29,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:29,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:29,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:29,304 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:24:29,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 15:24:29,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:24:29,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:24:29,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:29,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:29,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:24:29,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:29,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:24:29,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 15:24:29,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:24:29,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:29,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-04 15:24:29,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-04 15:24:29,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:24:29,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826919725] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:29,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:29,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-04 15:24:29,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845082608] [2025-03-04 15:24:29,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:29,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 15:24:29,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:29,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:24:29,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:24:29,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 86 [2025-03-04 15:24:29,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 219 transitions, 1867 flow. Second operand has 15 states, 15 states have (on average 41.46666666666667) internal successors, (622), 15 states have internal predecessors, (622), 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:24:29,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:29,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 86 [2025-03-04 15:24:29,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:31,672 INFO L124 PetriNetUnfolderBase]: 11151/21096 cut-off events. [2025-03-04 15:24:31,673 INFO L125 PetriNetUnfolderBase]: For 57975/59001 co-relation queries the response was YES. [2025-03-04 15:24:31,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67215 conditions, 21096 events. 11151/21096 cut-off events. For 57975/59001 co-relation queries the response was YES. Maximal size of possible extension queue 844. Compared 189303 event pairs, 2357 based on Foata normal form. 778/21104 useless extension candidates. Maximal degree in co-relation 67166. Up to 4949 conditions per place. [2025-03-04 15:24:32,047 INFO L140 encePairwiseOnDemand]: 68/86 looper letters, 397 selfloop transitions, 65 changer transitions 0/496 dead transitions. [2025-03-04 15:24:32,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 496 transitions, 4735 flow [2025-03-04 15:24:32,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:24:32,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 15:24:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 735 transitions. [2025-03-04 15:24:32,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6104651162790697 [2025-03-04 15:24:32,049 INFO L175 Difference]: Start difference. First operand has 208 places, 219 transitions, 1867 flow. Second operand 14 states and 735 transitions. [2025-03-04 15:24:32,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 496 transitions, 4735 flow [2025-03-04 15:24:32,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 496 transitions, 4696 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-04 15:24:32,229 INFO L231 Difference]: Finished difference. Result has 222 places, 223 transitions, 2039 flow [2025-03-04 15:24:32,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1820, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2039, PETRI_PLACES=222, PETRI_TRANSITIONS=223} [2025-03-04 15:24:32,229 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 143 predicate places. [2025-03-04 15:24:32,229 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 223 transitions, 2039 flow [2025-03-04 15:24:32,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 41.46666666666667) internal successors, (622), 15 states have internal predecessors, (622), 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:24:32,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:32,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:32,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 15:24:32,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:32,430 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:32,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:32,431 INFO L85 PathProgramCache]: Analyzing trace with hash 81844971, now seen corresponding path program 1 times [2025-03-04 15:24:32,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:32,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187569203] [2025-03-04 15:24:32,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:32,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:32,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:24:32,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:24:32,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:32,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:32,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:24:32,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:32,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187569203] [2025-03-04 15:24:32,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187569203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:32,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961107108] [2025-03-04 15:24:32,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:32,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:32,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:32,571 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:24:32,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 15:24:32,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:24:32,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:24:32,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:32,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:32,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:24:32,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:32,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:24:32,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 15:24:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:24:32,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:32,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-04 15:24:32,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-04 15:24:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:24:32,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961107108] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:32,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:32,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-04 15:24:32,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94493476] [2025-03-04 15:24:32,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:32,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 15:24:32,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:32,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 15:24:32,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-04 15:24:32,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 86 [2025-03-04 15:24:32,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 223 transitions, 2039 flow. Second operand has 16 states, 16 states have (on average 42.3125) internal successors, (677), 16 states have internal predecessors, (677), 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:24:32,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:32,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 86 [2025-03-04 15:24:32,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:34,968 INFO L124 PetriNetUnfolderBase]: 10841/20880 cut-off events. [2025-03-04 15:24:34,968 INFO L125 PetriNetUnfolderBase]: For 67283/68273 co-relation queries the response was YES. [2025-03-04 15:24:35,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71740 conditions, 20880 events. 10841/20880 cut-off events. For 67283/68273 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 190562 event pairs, 2492 based on Foata normal form. 1230/21522 useless extension candidates. Maximal degree in co-relation 71684. Up to 5198 conditions per place. [2025-03-04 15:24:35,259 INFO L140 encePairwiseOnDemand]: 67/86 looper letters, 423 selfloop transitions, 66 changer transitions 3/530 dead transitions. [2025-03-04 15:24:35,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 530 transitions, 5218 flow [2025-03-04 15:24:35,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:24:35,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:24:35,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 795 transitions. [2025-03-04 15:24:35,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6162790697674418 [2025-03-04 15:24:35,260 INFO L175 Difference]: Start difference. First operand has 222 places, 223 transitions, 2039 flow. Second operand 15 states and 795 transitions. [2025-03-04 15:24:35,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 530 transitions, 5218 flow [2025-03-04 15:24:35,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 530 transitions, 5123 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-03-04 15:24:35,522 INFO L231 Difference]: Finished difference. Result has 234 places, 231 transitions, 2176 flow [2025-03-04 15:24:35,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1946, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2176, PETRI_PLACES=234, PETRI_TRANSITIONS=231} [2025-03-04 15:24:35,523 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 155 predicate places. [2025-03-04 15:24:35,523 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 231 transitions, 2176 flow [2025-03-04 15:24:35,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 42.3125) internal successors, (677), 16 states have internal predecessors, (677), 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:24:35,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:35,523 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:35,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 15:24:35,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 15:24:35,724 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:35,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:35,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2023303311, now seen corresponding path program 1 times [2025-03-04 15:24:35,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:35,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846932271] [2025-03-04 15:24:35,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:35,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:35,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:24:35,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:24:35,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:35,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:35,801 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 15:24:35,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:35,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846932271] [2025-03-04 15:24:35,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846932271] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:35,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899495124] [2025-03-04 15:24:35,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:35,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:35,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:35,803 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:24:35,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 15:24:35,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:24:35,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:24:35,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:35,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:35,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:24:35,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:35,945 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 15:24:35,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:36,013 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 15:24:36,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899495124] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:36,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:36,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-04 15:24:36,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158874414] [2025-03-04 15:24:36,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:36,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 15:24:36,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:36,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 15:24:36,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-03-04 15:24:36,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-04 15:24:36,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 231 transitions, 2176 flow. Second operand has 20 states, 20 states have (on average 43.75) internal successors, (875), 20 states have internal predecessors, (875), 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:24:36,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:36,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-04 15:24:36,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:38,086 INFO L124 PetriNetUnfolderBase]: 6901/16226 cut-off events. [2025-03-04 15:24:38,087 INFO L125 PetriNetUnfolderBase]: For 55478/55847 co-relation queries the response was YES. [2025-03-04 15:24:38,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57649 conditions, 16226 events. 6901/16226 cut-off events. For 55478/55847 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 165276 event pairs, 3747 based on Foata normal form. 287/16433 useless extension candidates. Maximal degree in co-relation 57589. Up to 7674 conditions per place. [2025-03-04 15:24:38,317 INFO L140 encePairwiseOnDemand]: 76/86 looper letters, 169 selfloop transitions, 86 changer transitions 42/346 dead transitions. [2025-03-04 15:24:38,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 346 transitions, 3728 flow [2025-03-04 15:24:38,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:24:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:24:38,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 540 transitions. [2025-03-04 15:24:38,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2025-03-04 15:24:38,318 INFO L175 Difference]: Start difference. First operand has 234 places, 231 transitions, 2176 flow. Second operand 10 states and 540 transitions. [2025-03-04 15:24:38,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 346 transitions, 3728 flow [2025-03-04 15:24:38,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 346 transitions, 3497 flow, removed 23 selfloop flow, removed 9 redundant places. [2025-03-04 15:24:38,653 INFO L231 Difference]: Finished difference. Result has 238 places, 235 transitions, 2289 flow [2025-03-04 15:24:38,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=2043, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2289, PETRI_PLACES=238, PETRI_TRANSITIONS=235} [2025-03-04 15:24:38,654 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 159 predicate places. [2025-03-04 15:24:38,654 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 235 transitions, 2289 flow [2025-03-04 15:24:38,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 43.75) internal successors, (875), 20 states have internal predecessors, (875), 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:24:38,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:38,654 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:38,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 15:24:38,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:38,856 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:38,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:38,856 INFO L85 PathProgramCache]: Analyzing trace with hash -839083588, now seen corresponding path program 1 times [2025-03-04 15:24:38,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:38,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157144782] [2025-03-04 15:24:38,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:38,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:38,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:24:38,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:24:38,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:38,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:38,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:24:38,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:38,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157144782] [2025-03-04 15:24:38,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157144782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:38,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:38,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:38,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385815076] [2025-03-04 15:24:38,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:38,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:38,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:38,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:38,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:38,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-04 15:24:38,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 235 transitions, 2289 flow. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 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:24:38,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:38,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-04 15:24:38,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:40,566 INFO L124 PetriNetUnfolderBase]: 8590/17518 cut-off events. [2025-03-04 15:24:40,567 INFO L125 PetriNetUnfolderBase]: For 59880/60391 co-relation queries the response was YES. [2025-03-04 15:24:40,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62363 conditions, 17518 events. 8590/17518 cut-off events. For 59880/60391 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 162450 event pairs, 3577 based on Foata normal form. 725/18110 useless extension candidates. Maximal degree in co-relation 62303. Up to 7831 conditions per place. [2025-03-04 15:24:40,749 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 235 selfloop transitions, 12 changer transitions 22/310 dead transitions. [2025-03-04 15:24:40,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 310 transitions, 3493 flow [2025-03-04 15:24:40,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:40,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:40,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-03-04 15:24:40,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6947674418604651 [2025-03-04 15:24:40,750 INFO L175 Difference]: Start difference. First operand has 238 places, 235 transitions, 2289 flow. Second operand 4 states and 239 transitions. [2025-03-04 15:24:40,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 310 transitions, 3493 flow [2025-03-04 15:24:41,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 310 transitions, 3315 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-03-04 15:24:41,017 INFO L231 Difference]: Finished difference. Result has 230 places, 222 transitions, 1953 flow [2025-03-04 15:24:41,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=2091, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1953, PETRI_PLACES=230, PETRI_TRANSITIONS=222} [2025-03-04 15:24:41,018 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 151 predicate places. [2025-03-04 15:24:41,018 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 222 transitions, 1953 flow [2025-03-04 15:24:41,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 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:24:41,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:41,018 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:41,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 15:24:41,018 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:41,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:41,018 INFO L85 PathProgramCache]: Analyzing trace with hash 66951598, now seen corresponding path program 1 times [2025-03-04 15:24:41,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:41,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823647432] [2025-03-04 15:24:41,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:41,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:41,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:24:41,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:24:41,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:41,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:41,058 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 15:24:41,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:41,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823647432] [2025-03-04 15:24:41,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823647432] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:41,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653555752] [2025-03-04 15:24:41,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:41,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:41,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:41,061 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:24:41,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 15:24:41,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:24:41,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:24:41,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:41,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:41,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:24:41,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:24:41,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:24:41,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653555752] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:41,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:41,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2025-03-04 15:24:41,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572297002] [2025-03-04 15:24:41,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:41,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:24:41,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:41,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:24:41,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:24:41,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-04 15:24:41,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 222 transitions, 1953 flow. Second operand has 19 states, 19 states have (on average 44.421052631578945) internal successors, (844), 19 states have internal predecessors, (844), 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:24:41,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:41,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-04 15:24:41,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:42,974 INFO L124 PetriNetUnfolderBase]: 5538/12670 cut-off events. [2025-03-04 15:24:42,974 INFO L125 PetriNetUnfolderBase]: For 40602/41198 co-relation queries the response was YES. [2025-03-04 15:24:43,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44483 conditions, 12670 events. 5538/12670 cut-off events. For 40602/41198 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 119492 event pairs, 1300 based on Foata normal form. 412/13072 useless extension candidates. Maximal degree in co-relation 44425. Up to 2637 conditions per place. [2025-03-04 15:24:43,105 INFO L140 encePairwiseOnDemand]: 75/86 looper letters, 237 selfloop transitions, 54 changer transitions 101/437 dead transitions. [2025-03-04 15:24:43,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 437 transitions, 4217 flow [2025-03-04 15:24:43,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 15:24:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 15:24:43,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 916 transitions. [2025-03-04 15:24:43,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6265389876880985 [2025-03-04 15:24:43,106 INFO L175 Difference]: Start difference. First operand has 230 places, 222 transitions, 1953 flow. Second operand 17 states and 916 transitions. [2025-03-04 15:24:43,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 437 transitions, 4217 flow [2025-03-04 15:24:43,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 437 transitions, 4123 flow, removed 36 selfloop flow, removed 6 redundant places. [2025-03-04 15:24:43,403 INFO L231 Difference]: Finished difference. Result has 235 places, 200 transitions, 1734 flow [2025-03-04 15:24:43,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1873, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1734, PETRI_PLACES=235, PETRI_TRANSITIONS=200} [2025-03-04 15:24:43,403 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 156 predicate places. [2025-03-04 15:24:43,404 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 200 transitions, 1734 flow [2025-03-04 15:24:43,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 44.421052631578945) internal successors, (844), 19 states have internal predecessors, (844), 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:24:43,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:43,404 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:43,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 15:24:43,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:43,604 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:43,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:43,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1525508570, now seen corresponding path program 2 times [2025-03-04 15:24:43,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:43,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113783574] [2025-03-04 15:24:43,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:24:43,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:43,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 15:24:43,616 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:24:43,616 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:24:43,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:43,648 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 15:24:43,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:43,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113783574] [2025-03-04 15:24:43,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113783574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:43,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015792056] [2025-03-04 15:24:43,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:24:43,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:43,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:43,653 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:24:43,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 15:24:43,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 15:24:43,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:24:43,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:24:43,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:43,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:24:43,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 15:24:43,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 15:24:43,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015792056] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:43,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:43,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-04 15:24:43,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655728392] [2025-03-04 15:24:43,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:43,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:24:43,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:43,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:24:43,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:24:43,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-04 15:24:43,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 200 transitions, 1734 flow. Second operand has 6 states, 6 states have (on average 47.0) internal successors, (282), 6 states have internal predecessors, (282), 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:24:43,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:43,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-04 15:24:43,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:44,691 INFO L124 PetriNetUnfolderBase]: 4604/10790 cut-off events. [2025-03-04 15:24:44,692 INFO L125 PetriNetUnfolderBase]: For 31496/31970 co-relation queries the response was YES. [2025-03-04 15:24:44,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37576 conditions, 10790 events. 4604/10790 cut-off events. For 31496/31970 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 103158 event pairs, 1232 based on Foata normal form. 345/11080 useless extension candidates. Maximal degree in co-relation 37518. Up to 5874 conditions per place. [2025-03-04 15:24:44,790 INFO L140 encePairwiseOnDemand]: 80/86 looper letters, 215 selfloop transitions, 7 changer transitions 0/268 dead transitions. [2025-03-04 15:24:44,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 268 transitions, 2659 flow [2025-03-04 15:24:44,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:24:44,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:24:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 280 transitions. [2025-03-04 15:24:44,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745 [2025-03-04 15:24:44,791 INFO L175 Difference]: Start difference. First operand has 235 places, 200 transitions, 1734 flow. Second operand 5 states and 280 transitions. [2025-03-04 15:24:44,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 268 transitions, 2659 flow [2025-03-04 15:24:44,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 268 transitions, 2555 flow, removed 12 selfloop flow, removed 14 redundant places. [2025-03-04 15:24:44,913 INFO L231 Difference]: Finished difference. Result has 216 places, 200 transitions, 1679 flow [2025-03-04 15:24:44,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1656, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1679, PETRI_PLACES=216, PETRI_TRANSITIONS=200} [2025-03-04 15:24:44,914 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 137 predicate places. [2025-03-04 15:24:44,914 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 200 transitions, 1679 flow [2025-03-04 15:24:44,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.0) internal successors, (282), 6 states have internal predecessors, (282), 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:24:44,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:44,914 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:44,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 15:24:45,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:45,115 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:45,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:45,115 INFO L85 PathProgramCache]: Analyzing trace with hash -46091985, now seen corresponding path program 1 times [2025-03-04 15:24:45,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:45,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309591189] [2025-03-04 15:24:45,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:45,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:45,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 15:24:45,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:24:45,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:45,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:24:45,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:45,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309591189] [2025-03-04 15:24:45,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309591189] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:45,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060727346] [2025-03-04 15:24:45,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:45,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:45,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:45,378 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:24:45,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 15:24:45,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 15:24:45,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:24:45,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:45,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:45,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 15:24:45,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:45,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 15:24:45,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-04 15:24:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 15:24:45,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:45,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-04 15:24:45,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-03-04 15:24:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 15:24:45,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060727346] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:45,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:45,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-03-04 15:24:45,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032976767] [2025-03-04 15:24:45,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:45,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 15:24:45,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:45,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 15:24:45,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2025-03-04 15:24:45,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 86 [2025-03-04 15:24:45,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 200 transitions, 1679 flow. Second operand has 26 states, 26 states have (on average 40.88461538461539) internal successors, (1063), 26 states have internal predecessors, (1063), 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:24:45,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:45,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 86 [2025-03-04 15:24:45,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:47,907 INFO L124 PetriNetUnfolderBase]: 7319/16241 cut-off events. [2025-03-04 15:24:47,907 INFO L125 PetriNetUnfolderBase]: For 47291/48382 co-relation queries the response was YES. [2025-03-04 15:24:48,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56290 conditions, 16241 events. 7319/16241 cut-off events. For 47291/48382 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 158573 event pairs, 1791 based on Foata normal form. 663/16813 useless extension candidates. Maximal degree in co-relation 56234. Up to 2826 conditions per place. [2025-03-04 15:24:48,048 INFO L140 encePairwiseOnDemand]: 70/86 looper letters, 387 selfloop transitions, 52 changer transitions 2/484 dead transitions. [2025-03-04 15:24:48,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 484 transitions, 4471 flow [2025-03-04 15:24:48,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 15:24:48,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 15:24:48,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 827 transitions. [2025-03-04 15:24:48,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6010174418604651 [2025-03-04 15:24:48,049 INFO L175 Difference]: Start difference. First operand has 216 places, 200 transitions, 1679 flow. Second operand 16 states and 827 transitions. [2025-03-04 15:24:48,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 484 transitions, 4471 flow [2025-03-04 15:24:48,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 484 transitions, 4458 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:24:48,242 INFO L231 Difference]: Finished difference. Result has 231 places, 208 transitions, 1877 flow [2025-03-04 15:24:48,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1670, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1877, PETRI_PLACES=231, PETRI_TRANSITIONS=208} [2025-03-04 15:24:48,242 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 152 predicate places. [2025-03-04 15:24:48,242 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 208 transitions, 1877 flow [2025-03-04 15:24:48,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 40.88461538461539) internal successors, (1063), 26 states have internal predecessors, (1063), 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:24:48,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:48,243 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:48,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 15:24:48,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:48,443 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:48,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:48,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1428881652, now seen corresponding path program 1 times [2025-03-04 15:24:48,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:48,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264666693] [2025-03-04 15:24:48,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:48,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:48,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 15:24:48,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 15:24:48,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:48,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:48,695 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:24:48,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:48,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264666693] [2025-03-04 15:24:48,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264666693] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:48,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479718961] [2025-03-04 15:24:48,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:48,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:48,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:48,697 INFO L229 MonitoredProcess]: Starting monitored process 21 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:24:48,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 15:24:48,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 15:24:48,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 15:24:48,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:48,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:48,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 15:24:48,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:48,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 15:24:48,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-04 15:24:48,895 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 15:24:48,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:48,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-04 15:24:48,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-04 15:24:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 15:24:48,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479718961] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:48,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:48,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-03-04 15:24:48,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193881185] [2025-03-04 15:24:48,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:48,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 15:24:48,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:48,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 15:24:48,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2025-03-04 15:24:49,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 86 [2025-03-04 15:24:49,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 208 transitions, 1877 flow. Second operand has 26 states, 26 states have (on average 38.96153846153846) internal successors, (1013), 26 states have internal predecessors, (1013), 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:24:49,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:49,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 86 [2025-03-04 15:24:49,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:51,804 INFO L124 PetriNetUnfolderBase]: 7988/16584 cut-off events. [2025-03-04 15:24:51,805 INFO L125 PetriNetUnfolderBase]: For 59344/60754 co-relation queries the response was YES. [2025-03-04 15:24:52,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60026 conditions, 16584 events. 7988/16584 cut-off events. For 59344/60754 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 154865 event pairs, 1746 based on Foata normal form. 777/17292 useless extension candidates. Maximal degree in co-relation 59966. Up to 3496 conditions per place. [2025-03-04 15:24:52,149 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 360 selfloop transitions, 48 changer transitions 0/449 dead transitions. [2025-03-04 15:24:52,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 449 transitions, 4298 flow [2025-03-04 15:24:52,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:24:52,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:24:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 739 transitions. [2025-03-04 15:24:52,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5728682170542636 [2025-03-04 15:24:52,150 INFO L175 Difference]: Start difference. First operand has 231 places, 208 transitions, 1877 flow. Second operand 15 states and 739 transitions. [2025-03-04 15:24:52,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 449 transitions, 4298 flow [2025-03-04 15:24:52,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 449 transitions, 4249 flow, removed 1 selfloop flow, removed 9 redundant places. [2025-03-04 15:24:52,400 INFO L231 Difference]: Finished difference. Result has 237 places, 208 transitions, 1937 flow [2025-03-04 15:24:52,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1820, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1937, PETRI_PLACES=237, PETRI_TRANSITIONS=208} [2025-03-04 15:24:52,401 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 158 predicate places. [2025-03-04 15:24:52,401 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 208 transitions, 1937 flow [2025-03-04 15:24:52,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 38.96153846153846) internal successors, (1013), 26 states have internal predecessors, (1013), 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:24:52,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:52,402 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:52,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 15:24:52,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-04 15:24:52,603 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:52,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:52,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1345658607, now seen corresponding path program 1 times [2025-03-04 15:24:52,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:52,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320206307] [2025-03-04 15:24:52,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:52,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:52,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:24:52,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:24:52,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:52,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:24:52,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:52,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320206307] [2025-03-04 15:24:52,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320206307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:52,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187842676] [2025-03-04 15:24:52,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:52,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:52,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:52,926 INFO L229 MonitoredProcess]: Starting monitored process 22 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:24:52,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 15:24:52,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:24:53,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:24:53,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:53,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:53,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 15:24:53,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:53,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:24:53,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 15:24:53,087 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:24:53,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:24:53,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-04 15:24:53,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-04 15:24:53,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-04 15:24:53,232 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:24:53,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:53,353 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_487 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_142| Int)) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_142| v_ArrVal_487) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_142|) 0)))) is different from false [2025-03-04 15:24:53,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:24:53,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-04 15:24:53,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:24:53,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2025-03-04 15:24:53,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 15:24:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-03-04 15:24:53,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187842676] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:53,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:53,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2025-03-04 15:24:53,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135749313] [2025-03-04 15:24:53,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:53,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 15:24:53,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:53,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 15:24:53,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=829, Unknown=8, NotChecked=58, Total=992 [2025-03-04 15:24:53,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 86 [2025-03-04 15:24:53,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 208 transitions, 1937 flow. Second operand has 32 states, 32 states have (on average 29.375) internal successors, (940), 32 states have internal predecessors, (940), 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:24:53,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:53,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 86 [2025-03-04 15:24:53,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:57,255 INFO L124 PetriNetUnfolderBase]: 12177/21910 cut-off events. [2025-03-04 15:24:57,255 INFO L125 PetriNetUnfolderBase]: For 74536/76308 co-relation queries the response was YES. [2025-03-04 15:24:57,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81314 conditions, 21910 events. 12177/21910 cut-off events. For 74536/76308 co-relation queries the response was YES. Maximal size of possible extension queue 833. Compared 186479 event pairs, 3065 based on Foata normal form. 1027/22821 useless extension candidates. Maximal degree in co-relation 81253. Up to 4650 conditions per place. [2025-03-04 15:24:57,582 INFO L140 encePairwiseOnDemand]: 68/86 looper letters, 554 selfloop transitions, 59 changer transitions 2/642 dead transitions. [2025-03-04 15:24:57,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 642 transitions, 6026 flow [2025-03-04 15:24:57,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 15:24:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 15:24:57,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 981 transitions. [2025-03-04 15:24:57,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45627906976744187 [2025-03-04 15:24:57,583 INFO L175 Difference]: Start difference. First operand has 237 places, 208 transitions, 1937 flow. Second operand 25 states and 981 transitions. [2025-03-04 15:24:57,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 642 transitions, 6026 flow [2025-03-04 15:24:57,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 642 transitions, 5928 flow, removed 2 selfloop flow, removed 11 redundant places. [2025-03-04 15:24:57,842 INFO L231 Difference]: Finished difference. Result has 255 places, 214 transitions, 2041 flow [2025-03-04 15:24:57,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1844, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2041, PETRI_PLACES=255, PETRI_TRANSITIONS=214} [2025-03-04 15:24:57,843 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 176 predicate places. [2025-03-04 15:24:57,843 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 214 transitions, 2041 flow [2025-03-04 15:24:57,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 29.375) internal successors, (940), 32 states have internal predecessors, (940), 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:24:57,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:57,843 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:57,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 15:24:58,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-04 15:24:58,044 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:24:58,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:58,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1227682462, now seen corresponding path program 1 times [2025-03-04 15:24:58,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:58,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427114403] [2025-03-04 15:24:58,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:58,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:58,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:24:58,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:24:58,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:58,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:24:58,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:58,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427114403] [2025-03-04 15:24:58,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427114403] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:58,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412462092] [2025-03-04 15:24:58,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:58,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:58,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:58,313 INFO L229 MonitoredProcess]: Starting monitored process 23 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:24:58,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 15:24:58,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:24:58,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:24:58,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:58,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:58,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 15:24:58,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:58,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:24:58,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 15:24:58,461 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:24:58,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:24:58,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 15:24:58,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 15:24:58,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-04 15:24:58,595 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:24:58,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:58,731 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_516 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_144| Int)) (or (< (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_144| v_ArrVal_516) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_144|) 0)))) is different from false [2025-03-04 15:24:58,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:24:58,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-04 15:24:58,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:24:58,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2025-03-04 15:24:58,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 15:24:58,841 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-03-04 15:24:58,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412462092] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:58,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:58,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2025-03-04 15:24:58,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480042601] [2025-03-04 15:24:58,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:58,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 15:24:58,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:58,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 15:24:58,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=771, Unknown=6, NotChecked=56, Total=930 [2025-03-04 15:24:58,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 86 [2025-03-04 15:24:58,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 214 transitions, 2041 flow. Second operand has 31 states, 31 states have (on average 31.64516129032258) internal successors, (981), 31 states have internal predecessors, (981), 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:24:58,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:58,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 86 [2025-03-04 15:24:58,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:02,187 INFO L124 PetriNetUnfolderBase]: 11891/20967 cut-off events. [2025-03-04 15:25:02,188 INFO L125 PetriNetUnfolderBase]: For 106857/108791 co-relation queries the response was YES. [2025-03-04 15:25:02,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82523 conditions, 20967 events. 11891/20967 cut-off events. For 106857/108791 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 172744 event pairs, 2237 based on Foata normal form. 1211/21869 useless extension candidates. Maximal degree in co-relation 82458. Up to 4541 conditions per place. [2025-03-04 15:25:02,407 INFO L140 encePairwiseOnDemand]: 70/86 looper letters, 453 selfloop transitions, 52 changer transitions 38/578 dead transitions. [2025-03-04 15:25:02,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 578 transitions, 6475 flow [2025-03-04 15:25:02,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 15:25:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 15:25:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 846 transitions. [2025-03-04 15:25:02,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4684385382059801 [2025-03-04 15:25:02,408 INFO L175 Difference]: Start difference. First operand has 255 places, 214 transitions, 2041 flow. Second operand 21 states and 846 transitions. [2025-03-04 15:25:02,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 578 transitions, 6475 flow [2025-03-04 15:25:02,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 578 transitions, 6168 flow, removed 31 selfloop flow, removed 15 redundant places. [2025-03-04 15:25:02,810 INFO L231 Difference]: Finished difference. Result has 263 places, 221 transitions, 2131 flow [2025-03-04 15:25:02,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1934, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2131, PETRI_PLACES=263, PETRI_TRANSITIONS=221} [2025-03-04 15:25:02,811 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 184 predicate places. [2025-03-04 15:25:02,811 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 221 transitions, 2131 flow [2025-03-04 15:25:02,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 31.64516129032258) internal successors, (981), 31 states have internal predecessors, (981), 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:25:02,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:02,811 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:02,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-04 15:25:03,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-04 15:25:03,012 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:25:03,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:03,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1234256783, now seen corresponding path program 1 times [2025-03-04 15:25:03,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:03,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437350649] [2025-03-04 15:25:03,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:03,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:03,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:25:03,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:25:03,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:03,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:25:03,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:03,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437350649] [2025-03-04 15:25:03,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437350649] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:03,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679049473] [2025-03-04 15:25:03,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:03,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:03,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:03,261 INFO L229 MonitoredProcess]: Starting monitored process 24 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:25:03,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 15:25:03,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:25:03,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:25:03,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:03,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:03,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 15:25:03,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:03,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:25:03,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 15:25:03,408 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:25:03,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:25:03,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 15:25:03,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 15:25:03,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-04 15:25:03,549 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:25:03,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:03,626 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_544) c_~a1~0.base) (+ c_~a1~0.offset 4)) 2147483648)) is different from false [2025-03-04 15:25:03,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:25:03,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-04 15:25:03,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:25:03,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2025-03-04 15:25:03,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 15:25:03,749 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-03-04 15:25:03,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679049473] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:03,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:03,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2025-03-04 15:25:03,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575045314] [2025-03-04 15:25:03,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:03,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 15:25:03,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:03,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 15:25:03,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=894, Unknown=1, NotChecked=60, Total=1056 [2025-03-04 15:25:03,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 86 [2025-03-04 15:25:03,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 221 transitions, 2131 flow. Second operand has 33 states, 33 states have (on average 29.363636363636363) internal successors, (969), 33 states have internal predecessors, (969), 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:25:03,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:03,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 86 [2025-03-04 15:25:03,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:07,269 INFO L124 PetriNetUnfolderBase]: 12736/22658 cut-off events. [2025-03-04 15:25:07,269 INFO L125 PetriNetUnfolderBase]: For 96865/98951 co-relation queries the response was YES. [2025-03-04 15:25:07,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90149 conditions, 22658 events. 12736/22658 cut-off events. For 96865/98951 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 190946 event pairs, 3851 based on Foata normal form. 1220/23732 useless extension candidates. Maximal degree in co-relation 90081. Up to 5558 conditions per place. [2025-03-04 15:25:07,635 INFO L140 encePairwiseOnDemand]: 67/86 looper letters, 567 selfloop transitions, 56 changer transitions 104/757 dead transitions. [2025-03-04 15:25:07,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 757 transitions, 7982 flow [2025-03-04 15:25:07,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 15:25:07,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 15:25:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1018 transitions. [2025-03-04 15:25:07,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4552772808586762 [2025-03-04 15:25:07,637 INFO L175 Difference]: Start difference. First operand has 263 places, 221 transitions, 2131 flow. Second operand 26 states and 1018 transitions. [2025-03-04 15:25:07,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 757 transitions, 7982 flow [2025-03-04 15:25:07,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 757 transitions, 7775 flow, removed 15 selfloop flow, removed 16 redundant places. [2025-03-04 15:25:07,983 INFO L231 Difference]: Finished difference. Result has 276 places, 225 transitions, 2217 flow [2025-03-04 15:25:07,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=2054, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2217, PETRI_PLACES=276, PETRI_TRANSITIONS=225} [2025-03-04 15:25:07,984 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 197 predicate places. [2025-03-04 15:25:07,984 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 225 transitions, 2217 flow [2025-03-04 15:25:07,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 29.363636363636363) internal successors, (969), 33 states have internal predecessors, (969), 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:25:07,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:07,989 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:07,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-04 15:25:08,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:08,189 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 15:25:08,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:08,190 INFO L85 PathProgramCache]: Analyzing trace with hash -596579427, now seen corresponding path program 1 times [2025-03-04 15:25:08,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:08,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847911539] [2025-03-04 15:25:08,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:08,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:08,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:25:08,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:25:08,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:08,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:08,497 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:25:08,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:08,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847911539] [2025-03-04 15:25:08,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847911539] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:08,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500780892] [2025-03-04 15:25:08,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:08,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:08,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:08,499 INFO L229 MonitoredProcess]: Starting monitored process 25 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:25:08,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 15:25:08,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:25:08,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:25:08,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:08,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:08,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 15:25:08,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:08,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:25:08,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 15:25:08,652 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:25:08,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:25:08,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-04 15:25:08,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-04 15:25:08,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-04 15:25:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:25:08,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:08,842 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_572 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_572) c_~a1~0.base) (+ c_~a1~0.offset 4)) 4294967296))) is different from false [2025-03-04 15:25:08,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:25:08,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-04 15:25:08,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:25:08,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2025-03-04 15:25:08,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 15:25:09,005 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-03-04 15:25:09,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500780892] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:09,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:09,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2025-03-04 15:25:09,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740117419] [2025-03-04 15:25:09,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:09,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 15:25:09,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:09,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 15:25:09,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=906, Unknown=1, NotChecked=60, Total=1056 [2025-03-04 15:25:09,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 86 [2025-03-04 15:25:09,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 225 transitions, 2217 flow. Second operand has 33 states, 33 states have (on average 24.575757575757574) internal successors, (811), 33 states have internal predecessors, (811), 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:25:09,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:09,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 86 [2025-03-04 15:25:09,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:16,257 INFO L124 PetriNetUnfolderBase]: 25224/44223 cut-off events. [2025-03-04 15:25:16,257 INFO L125 PetriNetUnfolderBase]: For 248166/251444 co-relation queries the response was YES. [2025-03-04 15:25:17,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180319 conditions, 44223 events. 25224/44223 cut-off events. For 248166/251444 co-relation queries the response was YES. Maximal size of possible extension queue 1458. Compared 393030 event pairs, 5910 based on Foata normal form. 2162/45713 useless extension candidates. Maximal degree in co-relation 180248. Up to 6808 conditions per place. [2025-03-04 15:25:17,177 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 865 selfloop transitions, 76 changer transitions 52/1027 dead transitions. [2025-03-04 15:25:17,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 1027 transitions, 11709 flow [2025-03-04 15:25:17,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-04 15:25:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-03-04 15:25:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 1295 transitions. [2025-03-04 15:25:17,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3861061419200954 [2025-03-04 15:25:17,179 INFO L175 Difference]: Start difference. First operand has 276 places, 225 transitions, 2217 flow. Second operand 39 states and 1295 transitions. [2025-03-04 15:25:17,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 1027 transitions, 11709 flow