./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-node-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-node-trans.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:25:22,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:25:22,208 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:25:22,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:25:22,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:25:22,233 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:25:22,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:25:22,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:25:22,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:25:22,235 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:25:22,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:25:22,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:25:22,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:25:22,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:25:22,236 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:25:22,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:25:22,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:25:22,237 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:25:22,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:25:22,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:25:22,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:25:22,237 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:25:22,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:25:22,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:25:22,237 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:25:22,237 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:25:22,237 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:25:22,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:25:22,238 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:25:22,238 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:25:22,238 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:25:22,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:25:22,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:25:22,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:25:22,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:25:22,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:25:22,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:25:22,239 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:25:22,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:25:22,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:25:22,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:25:22,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:25:22,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:25:22,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:25:22,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:25:22,239 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 -> c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf [2025-03-04 15:25:22,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:25:22,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:25:22,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:25:22,516 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:25:22,516 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:25:22,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-03-04 15:25:23,708 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ac59033/f593e174cec04006ae19bc90456bad73/FLAGfdacd8a03 [2025-03-04 15:25:23,962 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:25:23,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-03-04 15:25:23,968 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ac59033/f593e174cec04006ae19bc90456bad73/FLAGfdacd8a03 [2025-03-04 15:25:24,265 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ac59033/f593e174cec04006ae19bc90456bad73 [2025-03-04 15:25:24,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:25:24,268 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:25:24,269 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:25:24,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:25:24,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:25:24,274 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:25:24" (1/1) ... [2025-03-04 15:25:24,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17974794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:24, skipping insertion in model container [2025-03-04 15:25:24,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:25:24" (1/1) ... [2025-03-04 15:25:24,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:25:24,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:25:24,447 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:25:24,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:25:24,494 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:25:24,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:24 WrapperNode [2025-03-04 15:25:24,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:25:24,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:25:24,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:25:24,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:25:24,501 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:25:24" (1/1) ... [2025-03-04 15:25:24,511 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:25:24" (1/1) ... [2025-03-04 15:25:24,547 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 474 [2025-03-04 15:25:24,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:25:24,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:25:24,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:25:24,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:25:24,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:24" (1/1) ... [2025-03-04 15:25:24,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:24" (1/1) ... [2025-03-04 15:25:24,559 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:24" (1/1) ... [2025-03-04 15:25:24,582 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 15, 9]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2025-03-04 15:25:24,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:24" (1/1) ... [2025-03-04 15:25:24,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:24" (1/1) ... [2025-03-04 15:25:24,597 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:24" (1/1) ... [2025-03-04 15:25:24,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:24" (1/1) ... [2025-03-04 15:25:24,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:24" (1/1) ... [2025-03-04 15:25:24,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:24" (1/1) ... [2025-03-04 15:25:24,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:25:24,608 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:25:24,609 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:25:24,609 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:25:24,609 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:24" (1/1) ... [2025-03-04 15:25:24,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:25:24,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:24,639 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:25:24,641 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:25:24,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:25:24,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:25:24,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:25:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:25:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:25:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:25:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:25:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:25:24,660 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:25:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:25:24,660 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:25:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:25:24,660 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:25:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:25:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:25:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:25:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:25:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:25:24,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:25:24,662 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:25:24,768 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:25:24,769 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:25:25,292 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:25:25,293 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:25:25,610 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:25:25,611 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:25:25,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:25:25 BoogieIcfgContainer [2025-03-04 15:25:25,611 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:25:25,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:25:25,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:25:25,617 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:25:25,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:25:24" (1/3) ... [2025-03-04 15:25:25,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385ec1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:25:25, skipping insertion in model container [2025-03-04 15:25:25,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:24" (2/3) ... [2025-03-04 15:25:25,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385ec1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:25:25, skipping insertion in model container [2025-03-04 15:25:25,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:25:25" (3/3) ... [2025-03-04 15:25:25,619 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2025-03-04 15:25:25,630 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:25:25,631 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-trans.wvr.c that has 4 procedures, 126 locations, 1 initial locations, 6 loop locations, and 42 error locations. [2025-03-04 15:25:25,632 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:25:25,705 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:25:25,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 140 transitions, 301 flow [2025-03-04 15:25:25,804 INFO L124 PetriNetUnfolderBase]: 15/137 cut-off events. [2025-03-04 15:25:25,806 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:25:25,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 15/137 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 407 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2025-03-04 15:25:25,810 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 140 transitions, 301 flow [2025-03-04 15:25:25,813 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 135 transitions, 285 flow [2025-03-04 15:25:25,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:25:25,826 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;@3e8bc620, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:25:25,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2025-03-04 15:25:25,830 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:25:25,830 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-03-04 15:25:25,830 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:25:25,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:25,831 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 15:25:25,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:25:25,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:25,836 INFO L85 PathProgramCache]: Analyzing trace with hash 43291, now seen corresponding path program 1 times [2025-03-04 15:25:25,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:25,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599189115] [2025-03-04 15:25:25,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:25,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:25,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:25:25,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:25:25,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:25,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:25,986 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:25:25,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:25,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599189115] [2025-03-04 15:25:25,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599189115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:25,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:25,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:25,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971234187] [2025-03-04 15:25:25,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:25,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:25,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:26,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:26,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:26,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-04 15:25:26,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 135 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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:26,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:26,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-04 15:25:26,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:26,950 INFO L124 PetriNetUnfolderBase]: 4133/8026 cut-off events. [2025-03-04 15:25:26,950 INFO L125 PetriNetUnfolderBase]: For 253/253 co-relation queries the response was YES. [2025-03-04 15:25:26,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13743 conditions, 8026 events. 4133/8026 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 65909 event pairs, 2732 based on Foata normal form. 2/6384 useless extension candidates. Maximal degree in co-relation 13014. Up to 5498 conditions per place. [2025-03-04 15:25:27,013 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 61 selfloop transitions, 1 changer transitions 0/133 dead transitions. [2025-03-04 15:25:27,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 133 transitions, 405 flow [2025-03-04 15:25:27,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:27,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:27,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-03-04 15:25:27,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680952380952381 [2025-03-04 15:25:27,027 INFO L175 Difference]: Start difference. First operand has 130 places, 135 transitions, 285 flow. Second operand 3 states and 286 transitions. [2025-03-04 15:25:27,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 133 transitions, 405 flow [2025-03-04 15:25:27,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 133 transitions, 396 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:25:27,036 INFO L231 Difference]: Finished difference. Result has 125 places, 133 transitions, 274 flow [2025-03-04 15:25:27,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=125, PETRI_TRANSITIONS=133} [2025-03-04 15:25:27,041 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -5 predicate places. [2025-03-04 15:25:27,042 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 133 transitions, 274 flow [2025-03-04 15:25:27,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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:27,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:27,042 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:25:27,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:25:27,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:25:27,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:27,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1343291, now seen corresponding path program 1 times [2025-03-04 15:25:27,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:27,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038583121] [2025-03-04 15:25:27,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:27,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:27,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:25:27,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:25:27,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:27,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:27,118 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:25:27,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:27,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038583121] [2025-03-04 15:25:27,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038583121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:27,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:27,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:27,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396376544] [2025-03-04 15:25:27,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:27,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:27,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:27,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:27,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:27,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-04 15:25:27,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 133 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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:27,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:27,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-04 15:25:27,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:27,745 INFO L124 PetriNetUnfolderBase]: 4133/8024 cut-off events. [2025-03-04 15:25:27,746 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-04 15:25:27,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13658 conditions, 8024 events. 4133/8024 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 66066 event pairs, 2732 based on Foata normal form. 0/6382 useless extension candidates. Maximal degree in co-relation 13652. Up to 5496 conditions per place. [2025-03-04 15:25:27,797 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 59 selfloop transitions, 1 changer transitions 0/131 dead transitions. [2025-03-04 15:25:27,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 131 transitions, 390 flow [2025-03-04 15:25:27,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-03-04 15:25:27,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2025-03-04 15:25:27,802 INFO L175 Difference]: Start difference. First operand has 125 places, 133 transitions, 274 flow. Second operand 3 states and 284 transitions. [2025-03-04 15:25:27,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 131 transitions, 390 flow [2025-03-04 15:25:27,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 131 transitions, 389 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:27,805 INFO L231 Difference]: Finished difference. Result has 124 places, 131 transitions, 271 flow [2025-03-04 15:25:27,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=271, PETRI_PLACES=124, PETRI_TRANSITIONS=131} [2025-03-04 15:25:27,807 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -6 predicate places. [2025-03-04 15:25:27,807 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 131 transitions, 271 flow [2025-03-04 15:25:27,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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:27,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:27,808 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:25:27,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:25:27,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:25:27,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:27,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1290942784, now seen corresponding path program 1 times [2025-03-04 15:25:27,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:27,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357454828] [2025-03-04 15:25:27,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:27,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:27,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:25:27,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:25:27,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:27,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:27,946 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:25:27,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:27,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357454828] [2025-03-04 15:25:27,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357454828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:27,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:27,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:27,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218650104] [2025-03-04 15:25:27,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:27,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:27,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:27,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:27,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:27,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-04 15:25:27,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 131 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 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:27,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:27,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-04 15:25:27,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:28,757 INFO L124 PetriNetUnfolderBase]: 4136/8036 cut-off events. [2025-03-04 15:25:28,757 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-04 15:25:28,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13686 conditions, 8036 events. 4136/8036 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66136 event pairs, 2732 based on Foata normal form. 3/6394 useless extension candidates. Maximal degree in co-relation 13679. Up to 5506 conditions per place. [2025-03-04 15:25:28,793 INFO L140 encePairwiseOnDemand]: 122/140 looper letters, 63 selfloop transitions, 12 changer transitions 0/140 dead transitions. [2025-03-04 15:25:28,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 140 transitions, 439 flow [2025-03-04 15:25:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:28,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2025-03-04 15:25:28,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6589285714285714 [2025-03-04 15:25:28,796 INFO L175 Difference]: Start difference. First operand has 124 places, 131 transitions, 271 flow. Second operand 4 states and 369 transitions. [2025-03-04 15:25:28,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 140 transitions, 439 flow [2025-03-04 15:25:28,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 140 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:28,800 INFO L231 Difference]: Finished difference. Result has 128 places, 140 transitions, 357 flow [2025-03-04 15:25:28,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=357, PETRI_PLACES=128, PETRI_TRANSITIONS=140} [2025-03-04 15:25:28,801 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -2 predicate places. [2025-03-04 15:25:28,801 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 140 transitions, 357 flow [2025-03-04 15:25:28,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 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:28,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:28,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:25:28,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:25:28,804 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:25:28,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:28,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1290942774, now seen corresponding path program 1 times [2025-03-04 15:25:28,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:28,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281975505] [2025-03-04 15:25:28,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:28,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:28,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:25:28,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:25:28,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:28,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:28,874 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:25:28,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:28,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281975505] [2025-03-04 15:25:28,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281975505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:28,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:28,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:28,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543460061] [2025-03-04 15:25:28,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:28,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:28,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:28,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:28,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:28,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-04 15:25:28,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 140 transitions, 357 flow. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 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:25:28,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:28,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-04 15:25:28,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:29,483 INFO L124 PetriNetUnfolderBase]: 4136/8034 cut-off events. [2025-03-04 15:25:29,483 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-04 15:25:29,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13718 conditions, 8034 events. 4136/8034 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66143 event pairs, 2732 based on Foata normal form. 2/6398 useless extension candidates. Maximal degree in co-relation 13709. Up to 5507 conditions per place. [2025-03-04 15:25:29,525 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 70 selfloop transitions, 1 changer transitions 0/138 dead transitions. [2025-03-04 15:25:29,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 138 transitions, 495 flow [2025-03-04 15:25:29,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-03-04 15:25:29,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680952380952381 [2025-03-04 15:25:29,526 INFO L175 Difference]: Start difference. First operand has 128 places, 140 transitions, 357 flow. Second operand 3 states and 286 transitions. [2025-03-04 15:25:29,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 138 transitions, 495 flow [2025-03-04 15:25:29,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 138 transitions, 486 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:29,529 INFO L231 Difference]: Finished difference. Result has 127 places, 138 transitions, 346 flow [2025-03-04 15:25:29,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=127, PETRI_TRANSITIONS=138} [2025-03-04 15:25:29,529 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -3 predicate places. [2025-03-04 15:25:29,529 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 138 transitions, 346 flow [2025-03-04 15:25:29,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 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:25:29,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:29,530 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:25:29,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:25:29,530 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:25:29,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:29,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1364521629, now seen corresponding path program 1 times [2025-03-04 15:25:29,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:29,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281259746] [2025-03-04 15:25:29,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:29,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:29,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:25:29,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:25:29,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:29,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:29,581 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:25:29,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:29,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281259746] [2025-03-04 15:25:29,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281259746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:29,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:29,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:29,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951537974] [2025-03-04 15:25:29,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:29,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:29,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:29,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:29,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:29,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-04 15:25:29,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 138 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 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:25:29,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:29,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-04 15:25:29,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:30,146 INFO L124 PetriNetUnfolderBase]: 4136/8032 cut-off events. [2025-03-04 15:25:30,146 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-04 15:25:30,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13709 conditions, 8032 events. 4136/8032 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66095 event pairs, 2732 based on Foata normal form. 1/6396 useless extension candidates. Maximal degree in co-relation 13699. Up to 5505 conditions per place. [2025-03-04 15:25:30,178 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 68 selfloop transitions, 1 changer transitions 0/136 dead transitions. [2025-03-04 15:25:30,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 136 transitions, 480 flow [2025-03-04 15:25:30,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:30,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:30,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-03-04 15:25:30,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2025-03-04 15:25:30,183 INFO L175 Difference]: Start difference. First operand has 127 places, 138 transitions, 346 flow. Second operand 3 states and 284 transitions. [2025-03-04 15:25:30,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 136 transitions, 480 flow [2025-03-04 15:25:30,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 136 transitions, 479 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:30,185 INFO L231 Difference]: Finished difference. Result has 126 places, 136 transitions, 343 flow [2025-03-04 15:25:30,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=343, PETRI_PLACES=126, PETRI_TRANSITIONS=136} [2025-03-04 15:25:30,187 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -4 predicate places. [2025-03-04 15:25:30,188 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 136 transitions, 343 flow [2025-03-04 15:25:30,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 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:25:30,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:30,188 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:30,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:25:30,188 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:25:30,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:30,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1340302992, now seen corresponding path program 1 times [2025-03-04 15:25:30,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:30,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642597181] [2025-03-04 15:25:30,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:30,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:30,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:25:30,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:25:30,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:30,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:30,257 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:25:30,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:30,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642597181] [2025-03-04 15:25:30,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642597181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:30,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:30,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:30,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130005656] [2025-03-04 15:25:30,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:30,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:30,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:30,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:30,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:30,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-04 15:25:30,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 136 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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:30,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:30,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-04 15:25:30,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:30,853 INFO L124 PetriNetUnfolderBase]: 4136/8030 cut-off events. [2025-03-04 15:25:30,853 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-04 15:25:30,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13710 conditions, 8030 events. 4136/8030 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66083 event pairs, 2732 based on Foata normal form. 2/6396 useless extension candidates. Maximal degree in co-relation 13699. Up to 5507 conditions per place. [2025-03-04 15:25:30,899 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 70 selfloop transitions, 1 changer transitions 0/134 dead transitions. [2025-03-04 15:25:30,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 134 transitions, 481 flow [2025-03-04 15:25:30,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-03-04 15:25:30,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680952380952381 [2025-03-04 15:25:30,900 INFO L175 Difference]: Start difference. First operand has 126 places, 136 transitions, 343 flow. Second operand 3 states and 286 transitions. [2025-03-04 15:25:30,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 134 transitions, 481 flow [2025-03-04 15:25:30,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 134 transitions, 480 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:30,903 INFO L231 Difference]: Finished difference. Result has 125 places, 134 transitions, 340 flow [2025-03-04 15:25:30,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=125, PETRI_TRANSITIONS=134} [2025-03-04 15:25:30,904 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -5 predicate places. [2025-03-04 15:25:30,904 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 134 transitions, 340 flow [2025-03-04 15:25:30,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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:30,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:30,905 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:30,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:25:30,905 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:25:30,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:30,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1340505976, now seen corresponding path program 1 times [2025-03-04 15:25:30,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:30,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588131109] [2025-03-04 15:25:30,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:30,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:30,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:25:30,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:25:30,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:30,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:30,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:30,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:30,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588131109] [2025-03-04 15:25:30,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588131109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:30,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126814426] [2025-03-04 15:25:30,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:30,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:30,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:31,002 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:25:31,004 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:25:31,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:25:31,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:25:31,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:31,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:31,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:25:31,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:31,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:31,121 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:25:31,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126814426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:31,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:25:31,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:25:31,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760729417] [2025-03-04 15:25:31,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:31,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:25:31,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:31,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:25:31,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:25:31,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-04 15:25:31,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 134 transitions, 340 flow. Second operand has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 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:31,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:31,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-04 15:25:31,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:31,630 INFO L124 PetriNetUnfolderBase]: 4136/8027 cut-off events. [2025-03-04 15:25:31,631 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-04 15:25:31,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13706 conditions, 8027 events. 4136/8027 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66012 event pairs, 2732 based on Foata normal form. 3/6392 useless extension candidates. Maximal degree in co-relation 13694. Up to 5491 conditions per place. [2025-03-04 15:25:31,670 INFO L140 encePairwiseOnDemand]: 125/140 looper letters, 51 selfloop transitions, 21 changer transitions 0/131 dead transitions. [2025-03-04 15:25:31,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 131 transitions, 472 flow [2025-03-04 15:25:31,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:25:31,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:25:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions. [2025-03-04 15:25:31,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6035714285714285 [2025-03-04 15:25:31,672 INFO L175 Difference]: Start difference. First operand has 125 places, 134 transitions, 340 flow. Second operand 6 states and 507 transitions. [2025-03-04 15:25:31,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 131 transitions, 472 flow [2025-03-04 15:25:31,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 131 transitions, 471 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:31,674 INFO L231 Difference]: Finished difference. Result has 126 places, 131 transitions, 369 flow [2025-03-04 15:25:31,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=369, PETRI_PLACES=126, PETRI_TRANSITIONS=131} [2025-03-04 15:25:31,675 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -4 predicate places. [2025-03-04 15:25:31,675 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 131 transitions, 369 flow [2025-03-04 15:25:31,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 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:31,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:31,676 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:31,683 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:25:31,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:31,880 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:25:31,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:31,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1400278975, now seen corresponding path program 1 times [2025-03-04 15:25:31,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:31,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405278462] [2025-03-04 15:25:31,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:31,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:31,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:25:31,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:25:31,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:31,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:31,932 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:25:31,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:31,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405278462] [2025-03-04 15:25:31,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405278462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:31,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:31,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:31,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283008462] [2025-03-04 15:25:31,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:31,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:31,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:31,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:31,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:31,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-04 15:25:31,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 131 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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:31,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:31,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-04 15:25:31,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:32,366 INFO L124 PetriNetUnfolderBase]: 4136/8025 cut-off events. [2025-03-04 15:25:32,367 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-03-04 15:25:32,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13722 conditions, 8025 events. 4136/8025 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 65997 event pairs, 2732 based on Foata normal form. 1/6391 useless extension candidates. Maximal degree in co-relation 13710. Up to 5505 conditions per place. [2025-03-04 15:25:32,411 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 68 selfloop transitions, 1 changer transitions 0/129 dead transitions. [2025-03-04 15:25:32,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 129 transitions, 503 flow [2025-03-04 15:25:32,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-03-04 15:25:32,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2025-03-04 15:25:32,413 INFO L175 Difference]: Start difference. First operand has 126 places, 131 transitions, 369 flow. Second operand 3 states and 284 transitions. [2025-03-04 15:25:32,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 129 transitions, 503 flow [2025-03-04 15:25:32,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 129 transitions, 458 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 15:25:32,416 INFO L231 Difference]: Finished difference. Result has 122 places, 129 transitions, 322 flow [2025-03-04 15:25:32,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=122, PETRI_TRANSITIONS=129} [2025-03-04 15:25:32,417 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -8 predicate places. [2025-03-04 15:25:32,417 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 129 transitions, 322 flow [2025-03-04 15:25:32,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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:32,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:32,418 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:25:32,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:25:32,418 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:25:32,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:32,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1393986501, now seen corresponding path program 1 times [2025-03-04 15:25:32,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:32,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355704334] [2025-03-04 15:25:32,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:32,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:32,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:25:32,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:25:32,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:32,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:32,486 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:25:32,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:32,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355704334] [2025-03-04 15:25:32,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355704334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:32,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788215997] [2025-03-04 15:25:32,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:32,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:32,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:32,490 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:25:32,492 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:25:32,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:25:32,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:25:32,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:32,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:32,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:25:32,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:32,588 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:25:32,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:32,627 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:25:32,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788215997] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:32,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:32,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:25:32,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884493858] [2025-03-04 15:25:32,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:32,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:25:32,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:32,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:25:32,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:25:32,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-04 15:25:32,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 129 transitions, 322 flow. Second operand has 12 states, 12 states have (on average 73.16666666666667) internal successors, (878), 12 states have internal predecessors, (878), 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:32,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:32,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-04 15:25:32,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:33,236 INFO L124 PetriNetUnfolderBase]: 4145/8061 cut-off events. [2025-03-04 15:25:33,236 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-04 15:25:33,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13791 conditions, 8061 events. 4145/8061 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 66194 event pairs, 2732 based on Foata normal form. 9/6426 useless extension candidates. Maximal degree in co-relation 13779. Up to 5512 conditions per place. [2025-03-04 15:25:33,260 INFO L140 encePairwiseOnDemand]: 125/140 looper letters, 60 selfloop transitions, 39 changer transitions 0/156 dead transitions. [2025-03-04 15:25:33,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 156 transitions, 637 flow [2025-03-04 15:25:33,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:25:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:25:33,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 828 transitions. [2025-03-04 15:25:33,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5914285714285714 [2025-03-04 15:25:33,263 INFO L175 Difference]: Start difference. First operand has 122 places, 129 transitions, 322 flow. Second operand 10 states and 828 transitions. [2025-03-04 15:25:33,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 156 transitions, 637 flow [2025-03-04 15:25:33,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 156 transitions, 636 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:33,266 INFO L231 Difference]: Finished difference. Result has 133 places, 156 transitions, 570 flow [2025-03-04 15:25:33,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=570, PETRI_PLACES=133, PETRI_TRANSITIONS=156} [2025-03-04 15:25:33,266 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-03-04 15:25:33,267 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 156 transitions, 570 flow [2025-03-04 15:25:33,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 73.16666666666667) internal successors, (878), 12 states have internal predecessors, (878), 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:33,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:33,267 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:33,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:25:33,472 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,SelfDestructingSolverStorable8 [2025-03-04 15:25:33,472 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:25:33,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:33,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1679102714, now seen corresponding path program 1 times [2025-03-04 15:25:33,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:33,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304809044] [2025-03-04 15:25:33,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:33,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:33,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:25:33,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:25:33,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:33,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:33,553 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:25:33,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:33,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304809044] [2025-03-04 15:25:33,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304809044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:33,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:33,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:33,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718202367] [2025-03-04 15:25:33,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:33,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:33,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:33,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:33,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:33,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-04 15:25:33,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 156 transitions, 570 flow. Second operand has 4 states, 4 states have (on average 74.5) internal successors, (298), 4 states have internal predecessors, (298), 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:33,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:33,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-04 15:25:33,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:34,008 INFO L124 PetriNetUnfolderBase]: 4148/8073 cut-off events. [2025-03-04 15:25:34,008 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-04 15:25:34,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13884 conditions, 8073 events. 4148/8073 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 66257 event pairs, 2732 based on Foata normal form. 3/6438 useless extension candidates. Maximal degree in co-relation 13869. Up to 5542 conditions per place. [2025-03-04 15:25:34,038 INFO L140 encePairwiseOnDemand]: 122/140 looper letters, 99 selfloop transitions, 12 changer transitions 0/165 dead transitions. [2025-03-04 15:25:34,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 165 transitions, 810 flow [2025-03-04 15:25:34,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2025-03-04 15:25:34,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6589285714285714 [2025-03-04 15:25:34,040 INFO L175 Difference]: Start difference. First operand has 133 places, 156 transitions, 570 flow. Second operand 4 states and 369 transitions. [2025-03-04 15:25:34,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 165 transitions, 810 flow [2025-03-04 15:25:34,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 165 transitions, 777 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:34,043 INFO L231 Difference]: Finished difference. Result has 136 places, 165 transitions, 624 flow [2025-03-04 15:25:34,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=624, PETRI_PLACES=136, PETRI_TRANSITIONS=165} [2025-03-04 15:25:34,043 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 6 predicate places. [2025-03-04 15:25:34,043 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 165 transitions, 624 flow [2025-03-04 15:25:34,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.5) internal successors, (298), 4 states have internal predecessors, (298), 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:34,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:34,044 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:34,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:25:34,044 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:25:34,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:34,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1336431265, now seen corresponding path program 1 times [2025-03-04 15:25:34,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:34,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7716621] [2025-03-04 15:25:34,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:34,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:34,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:25:34,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:25:34,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:34,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:25:34,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:34,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7716621] [2025-03-04 15:25:34,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7716621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:34,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:34,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:34,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389918854] [2025-03-04 15:25:34,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:34,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:34,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:34,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:34,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:34,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-04 15:25:34,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 165 transitions, 624 flow. Second operand has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 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:34,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:34,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-04 15:25:34,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:34,637 INFO L124 PetriNetUnfolderBase]: 4147/8072 cut-off events. [2025-03-04 15:25:34,638 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2025-03-04 15:25:34,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13899 conditions, 8072 events. 4147/8072 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 66224 event pairs, 2732 based on Foata normal form. 1/6441 useless extension candidates. Maximal degree in co-relation 13881. Up to 5538 conditions per place. [2025-03-04 15:25:34,680 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 101 selfloop transitions, 3 changer transitions 0/164 dead transitions. [2025-03-04 15:25:34,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 164 transitions, 828 flow [2025-03-04 15:25:34,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:34,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-03-04 15:25:34,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-03-04 15:25:34,682 INFO L175 Difference]: Start difference. First operand has 136 places, 165 transitions, 624 flow. Second operand 4 states and 359 transitions. [2025-03-04 15:25:34,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 164 transitions, 828 flow [2025-03-04 15:25:34,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 164 transitions, 819 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:34,685 INFO L231 Difference]: Finished difference. Result has 138 places, 164 transitions, 617 flow [2025-03-04 15:25:34,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=617, PETRI_PLACES=138, PETRI_TRANSITIONS=164} [2025-03-04 15:25:34,686 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 8 predicate places. [2025-03-04 15:25:34,686 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 164 transitions, 617 flow [2025-03-04 15:25:34,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 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:34,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:34,686 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-03-04 15:25:34,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:25:34,686 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:25:34,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:34,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1102149261, now seen corresponding path program 2 times [2025-03-04 15:25:34,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:34,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482018588] [2025-03-04 15:25:34,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:25:34,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:34,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 15:25:34,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-04 15:25:34,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:25:34,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:34,742 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:25:34,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:34,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482018588] [2025-03-04 15:25:34,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482018588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:34,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311160061] [2025-03-04 15:25:34,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:25:34,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:34,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:34,745 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:25:34,746 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:25:34,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 15:25:34,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-04 15:25:34,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:25:34,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:34,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:25:34,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:34,828 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:25:34,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:34,854 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:25:34,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311160061] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:34,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:34,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-04 15:25:34,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734446745] [2025-03-04 15:25:34,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:34,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:25:34,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:34,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:25:34,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:25:34,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 140 [2025-03-04 15:25:34,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 164 transitions, 617 flow. Second operand has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 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:34,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:34,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 140 [2025-03-04 15:25:34,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:35,337 INFO L124 PetriNetUnfolderBase]: 4147/8069 cut-off events. [2025-03-04 15:25:35,338 INFO L125 PetriNetUnfolderBase]: For 153/153 co-relation queries the response was YES. [2025-03-04 15:25:35,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13881 conditions, 8069 events. 4147/8069 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 66145 event pairs, 2732 based on Foata normal form. 3/6440 useless extension candidates. Maximal degree in co-relation 13862. Up to 5507 conditions per place. [2025-03-04 15:25:35,374 INFO L140 encePairwiseOnDemand]: 124/140 looper letters, 56 selfloop transitions, 48 changer transitions 0/161 dead transitions. [2025-03-04 15:25:35,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 161 transitions, 795 flow [2025-03-04 15:25:35,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:25:35,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:25:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 403 transitions. [2025-03-04 15:25:35,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757142857142857 [2025-03-04 15:25:35,376 INFO L175 Difference]: Start difference. First operand has 138 places, 164 transitions, 617 flow. Second operand 5 states and 403 transitions. [2025-03-04 15:25:35,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 161 transitions, 795 flow [2025-03-04 15:25:35,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 161 transitions, 761 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:25:35,379 INFO L231 Difference]: Finished difference. Result has 133 places, 161 transitions, 649 flow [2025-03-04 15:25:35,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=649, PETRI_PLACES=133, PETRI_TRANSITIONS=161} [2025-03-04 15:25:35,380 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-03-04 15:25:35,380 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 161 transitions, 649 flow [2025-03-04 15:25:35,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 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:35,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:35,380 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:35,389 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:25:35,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:35,581 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:25:35,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:35,581 INFO L85 PathProgramCache]: Analyzing trace with hash -2062744359, now seen corresponding path program 1 times [2025-03-04 15:25:35,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:35,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839426309] [2025-03-04 15:25:35,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:35,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:35,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:25:35,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:25:35,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:35,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:25:35,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:35,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839426309] [2025-03-04 15:25:35,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839426309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:35,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:35,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:35,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767564646] [2025-03-04 15:25:35,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:35,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:35,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:35,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:35,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:35,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-04 15:25:35,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 161 transitions, 649 flow. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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:35,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:35,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-04 15:25:35,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:36,222 INFO L124 PetriNetUnfolderBase]: 4146/8068 cut-off events. [2025-03-04 15:25:36,223 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-04 15:25:36,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13904 conditions, 8068 events. 4146/8068 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66190 event pairs, 2732 based on Foata normal form. 0/6426 useless extension candidates. Maximal degree in co-relation 13889. Up to 5537 conditions per place. [2025-03-04 15:25:36,255 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 100 selfloop transitions, 3 changer transitions 0/160 dead transitions. [2025-03-04 15:25:36,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 160 transitions, 849 flow [2025-03-04 15:25:36,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:36,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:36,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-03-04 15:25:36,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-03-04 15:25:36,257 INFO L175 Difference]: Start difference. First operand has 133 places, 161 transitions, 649 flow. Second operand 4 states and 359 transitions. [2025-03-04 15:25:36,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 160 transitions, 849 flow [2025-03-04 15:25:36,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 160 transitions, 755 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:25:36,260 INFO L231 Difference]: Finished difference. Result has 132 places, 160 transitions, 555 flow [2025-03-04 15:25:36,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=555, PETRI_PLACES=132, PETRI_TRANSITIONS=160} [2025-03-04 15:25:36,260 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2025-03-04 15:25:36,260 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 160 transitions, 555 flow [2025-03-04 15:25:36,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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:36,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:36,261 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:36,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:25:36,261 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:25:36,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:36,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1586243387, now seen corresponding path program 1 times [2025-03-04 15:25:36,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:36,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978548893] [2025-03-04 15:25:36,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:36,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:36,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:25:36,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:25:36,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:36,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:36,359 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:25:36,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:36,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978548893] [2025-03-04 15:25:36,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978548893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:36,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:36,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:36,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170186543] [2025-03-04 15:25:36,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:36,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:36,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:36,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:36,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:36,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-04 15:25:36,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 160 transitions, 555 flow. Second operand has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 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:36,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:36,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-04 15:25:36,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:36,890 INFO L124 PetriNetUnfolderBase]: 4145/8067 cut-off events. [2025-03-04 15:25:36,891 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2025-03-04 15:25:36,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13857 conditions, 8067 events. 4145/8067 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66136 event pairs, 2732 based on Foata normal form. 0/6426 useless extension candidates. Maximal degree in co-relation 13842. Up to 5536 conditions per place. [2025-03-04 15:25:36,923 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 99 selfloop transitions, 3 changer transitions 0/159 dead transitions. [2025-03-04 15:25:36,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 159 transitions, 755 flow [2025-03-04 15:25:36,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:36,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-03-04 15:25:36,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-03-04 15:25:36,925 INFO L175 Difference]: Start difference. First operand has 132 places, 160 transitions, 555 flow. Second operand 4 states and 359 transitions. [2025-03-04 15:25:36,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 159 transitions, 755 flow [2025-03-04 15:25:36,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 159 transitions, 751 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:36,927 INFO L231 Difference]: Finished difference. Result has 133 places, 159 transitions, 553 flow [2025-03-04 15:25:36,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=553, PETRI_PLACES=133, PETRI_TRANSITIONS=159} [2025-03-04 15:25:36,928 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-03-04 15:25:36,928 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 159 transitions, 553 flow [2025-03-04 15:25:36,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 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:36,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:36,928 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:36,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:25:36,929 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:25:36,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:36,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1630588568, now seen corresponding path program 1 times [2025-03-04 15:25:36,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:36,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517959924] [2025-03-04 15:25:36,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:36,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:36,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:25:36,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:25:36,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:36,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:37,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:25:37,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:37,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517959924] [2025-03-04 15:25:37,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517959924] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:37,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601066200] [2025-03-04 15:25:37,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:37,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:37,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:37,016 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:25:37,018 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:25:37,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:25:37,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:25:37,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:37,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:37,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:25:37,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:25:37,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:37,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:25:37,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601066200] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:37,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:37,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-04 15:25:37,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005688715] [2025-03-04 15:25:37,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:37,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:25:37,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:37,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:25:37,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:25:37,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 140 [2025-03-04 15:25:37,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 159 transitions, 553 flow. Second operand has 19 states, 19 states have (on average 64.26315789473684) internal successors, (1221), 19 states have internal predecessors, (1221), 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:37,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:37,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 140 [2025-03-04 15:25:37,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:38,978 INFO L124 PetriNetUnfolderBase]: 8284/16102 cut-off events. [2025-03-04 15:25:38,978 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2025-03-04 15:25:39,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27624 conditions, 16102 events. 8284/16102 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 1008. Compared 146499 event pairs, 5464 based on Foata normal form. 5/12948 useless extension candidates. Maximal degree in co-relation 27609. Up to 5508 conditions per place. [2025-03-04 15:25:39,040 INFO L140 encePairwiseOnDemand]: 117/140 looper letters, 120 selfloop transitions, 71 changer transitions 0/242 dead transitions. [2025-03-04 15:25:39,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 242 transitions, 1257 flow [2025-03-04 15:25:39,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 15:25:39,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 15:25:39,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1263 transitions. [2025-03-04 15:25:39,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5011904761904762 [2025-03-04 15:25:39,044 INFO L175 Difference]: Start difference. First operand has 133 places, 159 transitions, 553 flow. Second operand 18 states and 1263 transitions. [2025-03-04 15:25:39,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 242 transitions, 1257 flow [2025-03-04 15:25:39,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 242 transitions, 1251 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:39,047 INFO L231 Difference]: Finished difference. Result has 147 places, 195 transitions, 980 flow [2025-03-04 15:25:39,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=980, PETRI_PLACES=147, PETRI_TRANSITIONS=195} [2025-03-04 15:25:39,048 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 17 predicate places. [2025-03-04 15:25:39,048 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 195 transitions, 980 flow [2025-03-04 15:25:39,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 64.26315789473684) internal successors, (1221), 19 states have internal predecessors, (1221), 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:39,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:39,049 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:39,055 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:25:39,253 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:25:39,253 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:25:39,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:39,253 INFO L85 PathProgramCache]: Analyzing trace with hash 597579185, now seen corresponding path program 1 times [2025-03-04 15:25:39,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:39,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594470143] [2025-03-04 15:25:39,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:39,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:39,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:25:39,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:25:39,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:39,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:25:39,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:39,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594470143] [2025-03-04 15:25:39,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594470143] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:39,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445226267] [2025-03-04 15:25:39,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:39,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:39,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:39,350 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:25:39,352 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:25:39,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:25:39,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:25:39,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:39,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:39,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:25:39,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:25:39,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:39,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:25:39,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445226267] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:39,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:39,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:25:39,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803865678] [2025-03-04 15:25:39,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:39,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:25:39,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:39,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:25:39,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:25:39,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-04 15:25:39,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 195 transitions, 980 flow. Second operand has 12 states, 12 states have (on average 74.16666666666667) internal successors, (890), 12 states have internal predecessors, (890), 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:39,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:39,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-04 15:25:39,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:40,542 INFO L124 PetriNetUnfolderBase]: 8299/16162 cut-off events. [2025-03-04 15:25:40,542 INFO L125 PetriNetUnfolderBase]: For 461/461 co-relation queries the response was YES. [2025-03-04 15:25:40,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27938 conditions, 16162 events. 8299/16162 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 147460 event pairs, 5464 based on Foata normal form. 15/12917 useless extension candidates. Maximal degree in co-relation 27923. Up to 11066 conditions per place. [2025-03-04 15:25:40,607 INFO L140 encePairwiseOnDemand]: 125/140 looper letters, 119 selfloop transitions, 70 changer transitions 0/240 dead transitions. [2025-03-04 15:25:40,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 240 transitions, 1637 flow [2025-03-04 15:25:40,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:25:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:25:40,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 828 transitions. [2025-03-04 15:25:40,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5914285714285714 [2025-03-04 15:25:40,609 INFO L175 Difference]: Start difference. First operand has 147 places, 195 transitions, 980 flow. Second operand 10 states and 828 transitions. [2025-03-04 15:25:40,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 240 transitions, 1637 flow [2025-03-04 15:25:40,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 240 transitions, 1505 flow, removed 41 selfloop flow, removed 4 redundant places. [2025-03-04 15:25:40,613 INFO L231 Difference]: Finished difference. Result has 155 places, 240 transitions, 1345 flow [2025-03-04 15:25:40,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1345, PETRI_PLACES=155, PETRI_TRANSITIONS=240} [2025-03-04 15:25:40,614 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 25 predicate places. [2025-03-04 15:25:40,614 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 240 transitions, 1345 flow [2025-03-04 15:25:40,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 74.16666666666667) internal successors, (890), 12 states have internal predecessors, (890), 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:40,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:40,615 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:40,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 15:25:40,815 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:25:40,816 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:25:40,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:40,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2069066906, now seen corresponding path program 1 times [2025-03-04 15:25:40,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:40,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372296876] [2025-03-04 15:25:40,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:40,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:40,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:25:40,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:25:40,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:40,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:40,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:25:40,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:40,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372296876] [2025-03-04 15:25:40,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372296876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:40,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:40,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:40,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476259084] [2025-03-04 15:25:40,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:40,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:40,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:40,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:40,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:40,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-04 15:25:40,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 240 transitions, 1345 flow. Second operand has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 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:40,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:40,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-04 15:25:40,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:42,616 INFO L124 PetriNetUnfolderBase]: 16161/28622 cut-off events. [2025-03-04 15:25:42,616 INFO L125 PetriNetUnfolderBase]: For 516/516 co-relation queries the response was YES. [2025-03-04 15:25:42,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51221 conditions, 28622 events. 16161/28622 cut-off events. For 516/516 co-relation queries the response was YES. Maximal size of possible extension queue 1709. Compared 259243 event pairs, 4946 based on Foata normal form. 728/24000 useless extension candidates. Maximal degree in co-relation 51203. Up to 10192 conditions per place. [2025-03-04 15:25:42,787 INFO L140 encePairwiseOnDemand]: 132/140 looper letters, 236 selfloop transitions, 5 changer transitions 0/289 dead transitions. [2025-03-04 15:25:42,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 289 transitions, 1931 flow [2025-03-04 15:25:42,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:42,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:42,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2025-03-04 15:25:42,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.725 [2025-03-04 15:25:42,788 INFO L175 Difference]: Start difference. First operand has 155 places, 240 transitions, 1345 flow. Second operand 4 states and 406 transitions. [2025-03-04 15:25:42,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 289 transitions, 1931 flow [2025-03-04 15:25:42,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 289 transitions, 1871 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:42,794 INFO L231 Difference]: Finished difference. Result has 158 places, 242 transitions, 1319 flow [2025-03-04 15:25:42,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1319, PETRI_PLACES=158, PETRI_TRANSITIONS=242} [2025-03-04 15:25:42,794 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 28 predicate places. [2025-03-04 15:25:42,794 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 242 transitions, 1319 flow [2025-03-04 15:25:42,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 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:42,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:42,795 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:42,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:25:42,795 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:25:42,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:42,795 INFO L85 PathProgramCache]: Analyzing trace with hash 283436674, now seen corresponding path program 1 times [2025-03-04 15:25:42,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:42,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396316168] [2025-03-04 15:25:42,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:42,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:42,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:25:42,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:25:42,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:42,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:42,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:25:42,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:42,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396316168] [2025-03-04 15:25:42,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396316168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:42,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:42,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:42,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409898530] [2025-03-04 15:25:42,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:42,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:42,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:42,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:42,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:42,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-04 15:25:42,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 242 transitions, 1319 flow. Second operand has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 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:42,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:42,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-04 15:25:42,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:44,398 INFO L124 PetriNetUnfolderBase]: 10387/20680 cut-off events. [2025-03-04 15:25:44,398 INFO L125 PetriNetUnfolderBase]: For 4063/4595 co-relation queries the response was YES. [2025-03-04 15:25:44,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38331 conditions, 20680 events. 10387/20680 cut-off events. For 4063/4595 co-relation queries the response was YES. Maximal size of possible extension queue 1263. Compared 199695 event pairs, 7008 based on Foata normal form. 272/17108 useless extension candidates. Maximal degree in co-relation 38310. Up to 13915 conditions per place. [2025-03-04 15:25:44,490 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 181 selfloop transitions, 5 changer transitions 0/240 dead transitions. [2025-03-04 15:25:44,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 240 transitions, 1680 flow [2025-03-04 15:25:44,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:44,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:44,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-03-04 15:25:44,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-03-04 15:25:44,491 INFO L175 Difference]: Start difference. First operand has 158 places, 242 transitions, 1319 flow. Second operand 4 states and 359 transitions. [2025-03-04 15:25:44,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 240 transitions, 1680 flow [2025-03-04 15:25:44,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 240 transitions, 1680 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:25:44,500 INFO L231 Difference]: Finished difference. Result has 161 places, 240 transitions, 1318 flow [2025-03-04 15:25:44,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1318, PETRI_PLACES=161, PETRI_TRANSITIONS=240} [2025-03-04 15:25:44,500 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 31 predicate places. [2025-03-04 15:25:44,500 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 240 transitions, 1318 flow [2025-03-04 15:25:44,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 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:44,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:44,501 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:44,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:25:44,501 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:25:44,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:44,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1262756025, now seen corresponding path program 1 times [2025-03-04 15:25:44,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:44,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132047478] [2025-03-04 15:25:44,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:44,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:44,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 15:25:44,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:25:44,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:44,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:44,613 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:25:44,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:44,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132047478] [2025-03-04 15:25:44,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132047478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:44,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:44,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:44,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069994143] [2025-03-04 15:25:44,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:44,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:44,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:44,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:44,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:44,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-04 15:25:44,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 240 transitions, 1318 flow. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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:44,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:44,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-04 15:25:44,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:46,124 INFO L124 PetriNetUnfolderBase]: 10385/20678 cut-off events. [2025-03-04 15:25:46,124 INFO L125 PetriNetUnfolderBase]: For 4073/4605 co-relation queries the response was YES. [2025-03-04 15:25:46,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38329 conditions, 20678 events. 10385/20678 cut-off events. For 4073/4605 co-relation queries the response was YES. Maximal size of possible extension queue 1263. Compared 199470 event pairs, 7008 based on Foata normal form. 272/17106 useless extension candidates. Maximal degree in co-relation 38306. Up to 13913 conditions per place. [2025-03-04 15:25:46,202 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 179 selfloop transitions, 5 changer transitions 0/238 dead transitions. [2025-03-04 15:25:46,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 238 transitions, 1675 flow [2025-03-04 15:25:46,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:46,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:46,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-03-04 15:25:46,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-03-04 15:25:46,204 INFO L175 Difference]: Start difference. First operand has 161 places, 240 transitions, 1318 flow. Second operand 4 states and 359 transitions. [2025-03-04 15:25:46,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 238 transitions, 1675 flow [2025-03-04 15:25:46,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 238 transitions, 1669 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:46,213 INFO L231 Difference]: Finished difference. Result has 162 places, 238 transitions, 1311 flow [2025-03-04 15:25:46,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1311, PETRI_PLACES=162, PETRI_TRANSITIONS=238} [2025-03-04 15:25:46,213 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 32 predicate places. [2025-03-04 15:25:46,213 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 238 transitions, 1311 flow [2025-03-04 15:25:46,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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:46,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:46,214 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:46,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:25:46,214 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:25:46,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:46,214 INFO L85 PathProgramCache]: Analyzing trace with hash -851848566, now seen corresponding path program 2 times [2025-03-04 15:25:46,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:46,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65712696] [2025-03-04 15:25:46,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:25:46,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:46,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-04 15:25:46,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 39 statements. [2025-03-04 15:25:46,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:25:46,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-04 15:25:46,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:46,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65712696] [2025-03-04 15:25:46,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65712696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:46,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551052009] [2025-03-04 15:25:46,276 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:25:46,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:46,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:46,279 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:25:46,280 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:25:46,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-04 15:25:46,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 39 statements. [2025-03-04 15:25:46,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:25:46,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:46,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:25:46,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:46,407 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-04 15:25:46,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-04 15:25:46,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551052009] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:46,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:46,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 4 [2025-03-04 15:25:46,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454535304] [2025-03-04 15:25:46,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:46,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:25:46,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:46,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:25:46,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:25:46,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 140 [2025-03-04 15:25:46,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 238 transitions, 1311 flow. Second operand has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:25:46,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:46,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 140 [2025-03-04 15:25:46,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:48,189 INFO L124 PetriNetUnfolderBase]: 10385/20673 cut-off events. [2025-03-04 15:25:48,189 INFO L125 PetriNetUnfolderBase]: For 4097/4629 co-relation queries the response was YES. [2025-03-04 15:25:48,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38306 conditions, 20673 events. 10385/20673 cut-off events. For 4097/4629 co-relation queries the response was YES. Maximal size of possible extension queue 1264. Compared 199464 event pairs, 7008 based on Foata normal form. 275/17104 useless extension candidates. Maximal degree in co-relation 38283. Up to 13859 conditions per place. [2025-03-04 15:25:48,316 INFO L140 encePairwiseOnDemand]: 124/140 looper letters, 102 selfloop transitions, 82 changer transitions 0/235 dead transitions. [2025-03-04 15:25:48,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 235 transitions, 1649 flow [2025-03-04 15:25:48,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:25:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:25:48,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 403 transitions. [2025-03-04 15:25:48,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757142857142857 [2025-03-04 15:25:48,317 INFO L175 Difference]: Start difference. First operand has 162 places, 238 transitions, 1311 flow. Second operand 5 states and 403 transitions. [2025-03-04 15:25:48,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 235 transitions, 1649 flow [2025-03-04 15:25:48,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 235 transitions, 1591 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-04 15:25:48,331 INFO L231 Difference]: Finished difference. Result has 157 places, 235 transitions, 1387 flow [2025-03-04 15:25:48,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1223, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1387, PETRI_PLACES=157, PETRI_TRANSITIONS=235} [2025-03-04 15:25:48,331 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 27 predicate places. [2025-03-04 15:25:48,331 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 235 transitions, 1387 flow [2025-03-04 15:25:48,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:25:48,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:48,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:48,338 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:25:48,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:48,532 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:25:48,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:48,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1534183395, now seen corresponding path program 1 times [2025-03-04 15:25:48,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:48,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744761652] [2025-03-04 15:25:48,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:48,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:48,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 15:25:48,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 15:25:48,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:48,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:25:48,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:48,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744761652] [2025-03-04 15:25:48,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744761652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:48,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32331774] [2025-03-04 15:25:48,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:48,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:48,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:48,723 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:25:48,725 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:25:48,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 15:25:48,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 15:25:48,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:48,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:48,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:25:48,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:48,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:25:48,895 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:25:48,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32331774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:48,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:25:48,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-04 15:25:48,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914938084] [2025-03-04 15:25:48,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:48,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:48,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:48,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:48,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:25:48,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-04 15:25:48,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 235 transitions, 1387 flow. Second operand has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 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:48,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:48,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-04 15:25:48,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:50,683 INFO L124 PetriNetUnfolderBase]: 10383/20671 cut-off events. [2025-03-04 15:25:50,683 INFO L125 PetriNetUnfolderBase]: For 4120/4652 co-relation queries the response was YES. [2025-03-04 15:25:50,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38345 conditions, 20671 events. 10383/20671 cut-off events. For 4120/4652 co-relation queries the response was YES. Maximal size of possible extension queue 1264. Compared 199257 event pairs, 7008 based on Foata normal form. 271/17092 useless extension candidates. Maximal degree in co-relation 38326. Up to 13911 conditions per place. [2025-03-04 15:25:50,813 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 177 selfloop transitions, 5 changer transitions 0/233 dead transitions. [2025-03-04 15:25:50,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 233 transitions, 1736 flow [2025-03-04 15:25:50,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:50,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:50,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-03-04 15:25:50,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-03-04 15:25:50,815 INFO L175 Difference]: Start difference. First operand has 157 places, 235 transitions, 1387 flow. Second operand 4 states and 359 transitions. [2025-03-04 15:25:50,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 233 transitions, 1736 flow [2025-03-04 15:25:50,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 233 transitions, 1576 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:25:50,833 INFO L231 Difference]: Finished difference. Result has 156 places, 233 transitions, 1222 flow [2025-03-04 15:25:50,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1212, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1222, PETRI_PLACES=156, PETRI_TRANSITIONS=233} [2025-03-04 15:25:50,834 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 26 predicate places. [2025-03-04 15:25:50,834 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 233 transitions, 1222 flow [2025-03-04 15:25:50,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 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:50,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:50,834 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:50,841 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:25:51,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:51,035 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:25:51,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:51,036 INFO L85 PathProgramCache]: Analyzing trace with hash -276783272, now seen corresponding path program 1 times [2025-03-04 15:25:51,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:51,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342621236] [2025-03-04 15:25:51,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:51,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:51,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 15:25:51,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:25:51,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:51,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:51,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:25:51,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:51,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342621236] [2025-03-04 15:25:51,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342621236] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:51,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680994798] [2025-03-04 15:25:51,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:51,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:51,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:51,636 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:25:51,638 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:25:51,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 15:25:51,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:25:51,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:51,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:51,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 15:25:51,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:51,776 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:51,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 15:25:51,951 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:25:51,952 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:51,991 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:52,190 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:25:52,190 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 23 treesize of output 10 [2025-03-04 15:25:52,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:25:52,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:52,261 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_395 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_395) c_~get_5~0.base) (+ (* c_~id_3~0 4) c_~get_5~0.offset)) 9223372039002259456)) is different from false [2025-03-04 15:25:52,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:25:52,390 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:52,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:25:52,400 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 41 treesize of output 33 [2025-03-04 15:25:52,405 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 7 [2025-03-04 15:25:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2025-03-04 15:25:52,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680994798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:52,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:52,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-04 15:25:52,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194562404] [2025-03-04 15:25:52,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:52,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:25:52,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:52,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:25:52,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=382, Unknown=1, NotChecked=40, Total=506 [2025-03-04 15:25:52,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 140 [2025-03-04 15:25:52,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 233 transitions, 1222 flow. Second operand has 23 states, 23 states have (on average 57.869565217391305) internal successors, (1331), 23 states have internal predecessors, (1331), 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:52,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:52,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 140 [2025-03-04 15:25:52,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:06,540 INFO L124 PetriNetUnfolderBase]: 105379/159362 cut-off events. [2025-03-04 15:26:06,540 INFO L125 PetriNetUnfolderBase]: For 15768/16294 co-relation queries the response was YES. [2025-03-04 15:26:07,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326100 conditions, 159362 events. 105379/159362 cut-off events. For 15768/16294 co-relation queries the response was YES. Maximal size of possible extension queue 6875. Compared 1400316 event pairs, 21172 based on Foata normal form. 526/140610 useless extension candidates. Maximal degree in co-relation 326081. Up to 24786 conditions per place. [2025-03-04 15:26:07,676 INFO L140 encePairwiseOnDemand]: 123/140 looper letters, 692 selfloop transitions, 116 changer transitions 0/845 dead transitions. [2025-03-04 15:26:07,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 845 transitions, 5456 flow [2025-03-04 15:26:07,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 15:26:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 15:26:07,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1858 transitions. [2025-03-04 15:26:07,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5104395604395604 [2025-03-04 15:26:07,678 INFO L175 Difference]: Start difference. First operand has 156 places, 233 transitions, 1222 flow. Second operand 26 states and 1858 transitions. [2025-03-04 15:26:07,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 845 transitions, 5456 flow [2025-03-04 15:26:08,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 845 transitions, 5438 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:08,613 INFO L231 Difference]: Finished difference. Result has 185 places, 298 transitions, 2040 flow [2025-03-04 15:26:08,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1216, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2040, PETRI_PLACES=185, PETRI_TRANSITIONS=298} [2025-03-04 15:26:08,613 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 55 predicate places. [2025-03-04 15:26:08,613 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 298 transitions, 2040 flow [2025-03-04 15:26:08,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 57.869565217391305) internal successors, (1331), 23 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:08,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:08,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:08,621 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:26:08,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 15:26:08,815 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-04 15:26:08,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:08,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1015563304, now seen corresponding path program 1 times [2025-03-04 15:26:08,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:08,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528586439] [2025-03-04 15:26:08,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:08,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:08,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 15:26:08,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:26:08,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:08,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:26:09,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:09,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528586439] [2025-03-04 15:26:09,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528586439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:09,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:09,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:09,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720270059] [2025-03-04 15:26:09,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:09,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:09,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:09,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:09,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:09,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-04 15:26:09,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 298 transitions, 2040 flow. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:09,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:09,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-04 15:26:09,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand