./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/stack_longer-2.i --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/pthread/stack_longer-2.i -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 402cb3c5f3290109e83e598d96446a87fac59fa4aaa0b6234366e7da005f5688 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:08:08,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:08:08,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:08:08,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:08:08,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:08:08,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:08:08,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:08:08,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:08:08,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:08:08,466 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:08:08,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:08:08,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:08:08,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:08:08,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:08:08,467 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:08:08,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:08:08,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:08:08,467 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:08:08,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:08:08,467 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:08:08,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:08:08,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:08:08,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:08:08,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:08:08,468 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:08:08,468 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:08:08,468 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:08:08,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:08:08,468 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:08:08,468 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:08:08,468 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:08:08,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:08:08,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:08:08,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:08:08,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:08:08,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:08:08,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:08:08,469 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:08:08,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:08:08,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:08:08,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:08:08,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:08:08,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:08:08,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:08:08,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:08:08,470 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 -> 402cb3c5f3290109e83e598d96446a87fac59fa4aaa0b6234366e7da005f5688 [2025-03-04 15:08:08,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:08:08,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:08:08,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:08:08,701 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:08:08,701 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:08:08,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longer-2.i [2025-03-04 15:08:09,844 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad3ec7dc/23bcd7af4c70473785e12ac7acda2376/FLAG33b633b11 [2025-03-04 15:08:10,132 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:08:10,135 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-2.i [2025-03-04 15:08:10,152 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad3ec7dc/23bcd7af4c70473785e12ac7acda2376/FLAG33b633b11 [2025-03-04 15:08:10,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad3ec7dc/23bcd7af4c70473785e12ac7acda2376 [2025-03-04 15:08:10,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:08:10,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:08:10,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:08:10,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:08:10,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:08:10,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:08:10" (1/1) ... [2025-03-04 15:08:10,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6875d5a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:10, skipping insertion in model container [2025-03-04 15:08:10,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:08:10" (1/1) ... [2025-03-04 15:08:10,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:08:10,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:08:10,718 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:08:10,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:08:10,817 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:08:10,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:10 WrapperNode [2025-03-04 15:08:10,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:08:10,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:08:10,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:08:10,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:08:10,824 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:08:10" (1/1) ... [2025-03-04 15:08:10,846 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:08:10" (1/1) ... [2025-03-04 15:08:10,878 INFO L138 Inliner]: procedures = 277, calls = 431, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 551 [2025-03-04 15:08:10,879 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:08:10,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:08:10,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:08:10,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:08:10,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:10" (1/1) ... [2025-03-04 15:08:10,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:10" (1/1) ... [2025-03-04 15:08:10,895 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:10" (1/1) ... [2025-03-04 15:08:10,923 INFO L175 MemorySlicer]: Split 409 memory accesses to 3 slices as follows [2, 402, 5]. 98 percent of accesses are in the largest equivalence class. The 407 initializations are split as follows [2, 400, 5]. The 1 writes are split as follows [0, 1, 0]. [2025-03-04 15:08:10,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:10" (1/1) ... [2025-03-04 15:08:10,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:10" (1/1) ... [2025-03-04 15:08:10,943 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:10" (1/1) ... [2025-03-04 15:08:10,948 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:10" (1/1) ... [2025-03-04 15:08:10,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:10" (1/1) ... [2025-03-04 15:08:10,955 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:10" (1/1) ... [2025-03-04 15:08:10,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:08:10,964 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:08:10,964 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:08:10,964 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:08:10,965 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:10" (1/1) ... [2025-03-04 15:08:10,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:08:10,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:10,991 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:08:10,993 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:08:11,007 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 15:08:11,008 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 15:08:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 15:08:11,008 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 15:08:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:08:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:08:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:08:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:08:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:08:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:08:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:08:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:08:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:08:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:08:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:08:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:08:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:08:11,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:08:11,009 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:08:11,103 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:08:11,104 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:08:11,715 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L985-1: pop_#res#1 := 0; [2025-03-04 15:08:11,715 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L983: havoc pop_#t~mem37#1; [2025-03-04 15:08:11,715 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-1: havoc pop_#t~ret36#1; [2025-03-04 15:08:11,716 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:08:11,716 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:08:15,064 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:08:15,066 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:08:15,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:08:15 BoogieIcfgContainer [2025-03-04 15:08:15,067 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:08:15,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:08:15,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:08:15,072 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:08:15,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:08:10" (1/3) ... [2025-03-04 15:08:15,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461c5b02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:08:15, skipping insertion in model container [2025-03-04 15:08:15,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:10" (2/3) ... [2025-03-04 15:08:15,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461c5b02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:08:15, skipping insertion in model container [2025-03-04 15:08:15,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:08:15" (3/3) ... [2025-03-04 15:08:15,074 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2025-03-04 15:08:15,085 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:08:15,086 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longer-2.i that has 3 procedures, 44 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-04 15:08:15,087 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:08:15,149 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:08:15,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 48 transitions, 110 flow [2025-03-04 15:08:15,227 INFO L124 PetriNetUnfolderBase]: 5/46 cut-off events. [2025-03-04 15:08:15,229 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:08:15,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 46 events. 5/46 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 125 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2025-03-04 15:08:15,233 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 48 transitions, 110 flow [2025-03-04 15:08:15,237 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 44 transitions, 97 flow [2025-03-04 15:08:15,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:08:15,254 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;@13e2e850, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:08:15,255 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 15:08:15,277 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:08:15,278 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2025-03-04 15:08:15,278 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:08:15,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:15,279 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:15,279 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:15,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:15,283 INFO L85 PathProgramCache]: Analyzing trace with hash 580903627, now seen corresponding path program 1 times [2025-03-04 15:08:15,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:15,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438004981] [2025-03-04 15:08:15,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:15,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:15,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:08:15,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:08:15,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:15,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:15,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:15,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438004981] [2025-03-04 15:08:15,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438004981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:15,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:15,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:08:15,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988737434] [2025-03-04 15:08:15,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:15,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:15,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:15,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:15,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:15,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-04 15:08:15,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:15,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:15,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-04 15:08:15,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:16,220 INFO L124 PetriNetUnfolderBase]: 730/1442 cut-off events. [2025-03-04 15:08:16,221 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-04 15:08:16,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2676 conditions, 1442 events. 730/1442 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 7596 event pairs, 224 based on Foata normal form. 40/1333 useless extension candidates. Maximal degree in co-relation 2569. Up to 692 conditions per place. [2025-03-04 15:08:16,235 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 58 selfloop transitions, 5 changer transitions 0/77 dead transitions. [2025-03-04 15:08:16,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 77 transitions, 298 flow [2025-03-04 15:08:16,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:16,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2025-03-04 15:08:16,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-03-04 15:08:16,249 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 97 flow. Second operand 4 states and 132 transitions. [2025-03-04 15:08:16,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 77 transitions, 298 flow [2025-03-04 15:08:16,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 77 transitions, 289 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:16,258 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 128 flow [2025-03-04 15:08:16,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2025-03-04 15:08:16,264 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2025-03-04 15:08:16,264 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 128 flow [2025-03-04 15:08:16,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:16,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:16,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:16,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:08:16,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:16,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:16,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1931161696, now seen corresponding path program 1 times [2025-03-04 15:08:16,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:16,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299078181] [2025-03-04 15:08:16,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:16,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:16,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:08:16,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:08:16,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:16,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:16,423 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:08:16,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:16,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299078181] [2025-03-04 15:08:16,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299078181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:16,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:16,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:16,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943654746] [2025-03-04 15:08:16,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:16,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:16,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:16,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:16,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:16,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-04 15:08:16,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:16,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:16,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-04 15:08:16,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:16,728 INFO L124 PetriNetUnfolderBase]: 1180/2391 cut-off events. [2025-03-04 15:08:16,728 INFO L125 PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES. [2025-03-04 15:08:16,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4818 conditions, 2391 events. 1180/2391 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 13806 event pairs, 613 based on Foata normal form. 74/2301 useless extension candidates. Maximal degree in co-relation 4166. Up to 1299 conditions per place. [2025-03-04 15:08:16,745 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 71 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2025-03-04 15:08:16,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 88 transitions, 399 flow [2025-03-04 15:08:16,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:16,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:16,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2025-03-04 15:08:16,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-03-04 15:08:16,748 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 128 flow. Second operand 4 states and 132 transitions. [2025-03-04 15:08:16,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 88 transitions, 399 flow [2025-03-04 15:08:16,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 88 transitions, 399 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:08:16,750 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 152 flow [2025-03-04 15:08:16,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2025-03-04 15:08:16,752 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2025-03-04 15:08:16,753 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 152 flow [2025-03-04 15:08:16,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:16,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:16,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:16,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:08:16,754 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:16,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:16,754 INFO L85 PathProgramCache]: Analyzing trace with hash -335002789, now seen corresponding path program 1 times [2025-03-04 15:08:16,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:16,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793569079] [2025-03-04 15:08:16,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:16,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:16,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:08:16,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:08:16,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:16,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:16,876 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:08:16,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:16,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793569079] [2025-03-04 15:08:16,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793569079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:16,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:16,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:16,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572374469] [2025-03-04 15:08:16,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:16,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:16,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:16,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:16,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:16,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-04 15:08:16,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:16,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:16,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-04 15:08:16,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:17,207 INFO L124 PetriNetUnfolderBase]: 1703/3326 cut-off events. [2025-03-04 15:08:17,208 INFO L125 PetriNetUnfolderBase]: For 993/1035 co-relation queries the response was YES. [2025-03-04 15:08:17,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7360 conditions, 3326 events. 1703/3326 cut-off events. For 993/1035 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 21132 event pairs, 837 based on Foata normal form. 82/3289 useless extension candidates. Maximal degree in co-relation 5256. Up to 1936 conditions per place. [2025-03-04 15:08:17,232 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 72 selfloop transitions, 3 changer transitions 0/89 dead transitions. [2025-03-04 15:08:17,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 89 transitions, 439 flow [2025-03-04 15:08:17,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:17,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2025-03-04 15:08:17,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6927083333333334 [2025-03-04 15:08:17,236 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 152 flow. Second operand 4 states and 133 transitions. [2025-03-04 15:08:17,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 89 transitions, 439 flow [2025-03-04 15:08:17,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:08:17,240 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 174 flow [2025-03-04 15:08:17,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2025-03-04 15:08:17,241 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2025-03-04 15:08:17,241 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 174 flow [2025-03-04 15:08:17,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:17,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:17,241 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:17,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:08:17,241 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:17,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:17,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2028034704, now seen corresponding path program 1 times [2025-03-04 15:08:17,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:17,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879553657] [2025-03-04 15:08:17,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:17,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:17,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:08:17,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:08:17,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:17,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:17,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:17,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879553657] [2025-03-04 15:08:17,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879553657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:17,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:17,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:17,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124141681] [2025-03-04 15:08:17,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:17,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:08:17,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:17,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:08:17,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:08:17,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-04 15:08:17,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:17,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:17,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-04 15:08:17,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:17,570 INFO L124 PetriNetUnfolderBase]: 898/2001 cut-off events. [2025-03-04 15:08:17,570 INFO L125 PetriNetUnfolderBase]: For 983/1079 co-relation queries the response was YES. [2025-03-04 15:08:17,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4745 conditions, 2001 events. 898/2001 cut-off events. For 983/1079 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 11998 event pairs, 285 based on Foata normal form. 76/2025 useless extension candidates. Maximal degree in co-relation 3692. Up to 946 conditions per place. [2025-03-04 15:08:17,581 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 46 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2025-03-04 15:08:17,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 334 flow [2025-03-04 15:08:17,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:08:17,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:08:17,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-03-04 15:08:17,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 15:08:17,582 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 174 flow. Second operand 3 states and 96 transitions. [2025-03-04 15:08:17,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 334 flow [2025-03-04 15:08:17,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 66 transitions, 328 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 15:08:17,589 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 173 flow [2025-03-04 15:08:17,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2025-03-04 15:08:17,590 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 12 predicate places. [2025-03-04 15:08:17,590 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 173 flow [2025-03-04 15:08:17,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:17,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:17,590 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:17,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:08:17,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:17,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:17,591 INFO L85 PathProgramCache]: Analyzing trace with hash -773194098, now seen corresponding path program 1 times [2025-03-04 15:08:17,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:17,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007234352] [2025-03-04 15:08:17,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:17,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:17,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:08:17,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:08:17,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:17,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:17,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:17,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007234352] [2025-03-04 15:08:17,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007234352] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:17,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313354855] [2025-03-04 15:08:17,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:17,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:17,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:17,728 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:08:17,791 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:08:17,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:08:17,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:08:17,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:17,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:17,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:08:17,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:17,989 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:08:17,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313354855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:17,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:08:17,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:08:17,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582179024] [2025-03-04 15:08:17,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:17,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:08:17,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:17,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:08:17,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:08:17,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-04 15:08:17,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:17,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:17,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-04 15:08:17,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:18,254 INFO L124 PetriNetUnfolderBase]: 931/2009 cut-off events. [2025-03-04 15:08:18,254 INFO L125 PetriNetUnfolderBase]: For 1022/1128 co-relation queries the response was YES. [2025-03-04 15:08:18,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4977 conditions, 2009 events. 931/2009 cut-off events. For 1022/1128 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 11458 event pairs, 189 based on Foata normal form. 70/2022 useless extension candidates. Maximal degree in co-relation 2701. Up to 735 conditions per place. [2025-03-04 15:08:18,265 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 87 selfloop transitions, 9 changer transitions 0/109 dead transitions. [2025-03-04 15:08:18,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 109 transitions, 587 flow [2025-03-04 15:08:18,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:08:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:08:18,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2025-03-04 15:08:18,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5595238095238095 [2025-03-04 15:08:18,266 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 173 flow. Second operand 7 states and 188 transitions. [2025-03-04 15:08:18,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 109 transitions, 587 flow [2025-03-04 15:08:18,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 109 transitions, 577 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:08:18,270 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 229 flow [2025-03-04 15:08:18,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=229, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2025-03-04 15:08:18,271 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 20 predicate places. [2025-03-04 15:08:18,271 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 229 flow [2025-03-04 15:08:18,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:18,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:18,271 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:18,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:18,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:18,472 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:18,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:18,473 INFO L85 PathProgramCache]: Analyzing trace with hash 493927573, now seen corresponding path program 1 times [2025-03-04 15:08:18,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:18,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810888377] [2025-03-04 15:08:18,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:18,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:18,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:08:18,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:08:18,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:18,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:18,555 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:08:18,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:18,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810888377] [2025-03-04 15:08:18,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810888377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:18,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:18,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:18,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668910377] [2025-03-04 15:08:18,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:18,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:18,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:18,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:18,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:18,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-04 15:08:18,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 229 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:18,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:18,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-04 15:08:18,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:18,795 INFO L124 PetriNetUnfolderBase]: 1173/2608 cut-off events. [2025-03-04 15:08:18,795 INFO L125 PetriNetUnfolderBase]: For 2099/2217 co-relation queries the response was YES. [2025-03-04 15:08:18,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6746 conditions, 2608 events. 1173/2608 cut-off events. For 2099/2217 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 16518 event pairs, 646 based on Foata normal form. 26/2627 useless extension candidates. Maximal degree in co-relation 5213. Up to 1363 conditions per place. [2025-03-04 15:08:18,812 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 63 selfloop transitions, 7 changer transitions 0/84 dead transitions. [2025-03-04 15:08:18,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 84 transitions, 494 flow [2025-03-04 15:08:18,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:18,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:18,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-03-04 15:08:18,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2025-03-04 15:08:18,814 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 229 flow. Second operand 4 states and 115 transitions. [2025-03-04 15:08:18,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 84 transitions, 494 flow [2025-03-04 15:08:18,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 84 transitions, 486 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:18,820 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 271 flow [2025-03-04 15:08:18,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2025-03-04 15:08:18,821 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2025-03-04 15:08:18,821 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 271 flow [2025-03-04 15:08:18,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:18,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:18,821 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:18,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:08:18,821 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:18,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:18,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1800787890, now seen corresponding path program 1 times [2025-03-04 15:08:18,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:18,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820886008] [2025-03-04 15:08:18,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:18,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:18,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:08:18,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:08:18,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:18,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:18,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:18,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820886008] [2025-03-04 15:08:18,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820886008] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:18,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880983397] [2025-03-04 15:08:18,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:18,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:18,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:18,969 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:08:18,971 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:08:19,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:08:19,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:08:19,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:19,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:19,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:08:19,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:19,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:19,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:19,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:19,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880983397] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:19,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:19,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:08:19,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201130480] [2025-03-04 15:08:19,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:19,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:08:19,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:19,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:08:19,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:08:19,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-04 15:08:19,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 271 flow. Second operand has 12 states, 12 states have (on average 18.083333333333332) internal successors, (217), 12 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:19,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:19,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-04 15:08:19,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:19,947 INFO L124 PetriNetUnfolderBase]: 2547/5481 cut-off events. [2025-03-04 15:08:19,947 INFO L125 PetriNetUnfolderBase]: For 7148/7564 co-relation queries the response was YES. [2025-03-04 15:08:19,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14866 conditions, 5481 events. 2547/5481 cut-off events. For 7148/7564 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 35571 event pairs, 407 based on Foata normal form. 151/5625 useless extension candidates. Maximal degree in co-relation 7920. Up to 1167 conditions per place. [2025-03-04 15:08:19,973 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 191 selfloop transitions, 33 changer transitions 0/236 dead transitions. [2025-03-04 15:08:19,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 236 transitions, 1518 flow [2025-03-04 15:08:19,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 15:08:19,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 15:08:19,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 426 transitions. [2025-03-04 15:08:19,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5546875 [2025-03-04 15:08:19,975 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 271 flow. Second operand 16 states and 426 transitions. [2025-03-04 15:08:19,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 236 transitions, 1518 flow [2025-03-04 15:08:19,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 236 transitions, 1506 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 15:08:19,984 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 598 flow [2025-03-04 15:08:19,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=598, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2025-03-04 15:08:19,985 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 41 predicate places. [2025-03-04 15:08:19,985 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 598 flow [2025-03-04 15:08:19,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.083333333333332) internal successors, (217), 12 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:19,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:19,985 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:19,993 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:08:20,185 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,SelfDestructingSolverStorable6 [2025-03-04 15:08:20,186 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:20,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:20,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1978253835, now seen corresponding path program 1 times [2025-03-04 15:08:20,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:20,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494710305] [2025-03-04 15:08:20,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:20,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:20,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:08:20,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:08:20,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:20,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:20,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:20,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494710305] [2025-03-04 15:08:20,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494710305] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:20,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417079767] [2025-03-04 15:08:20,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:20,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:20,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:20,299 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:08:20,300 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:08:20,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:08:20,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:08:20,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:20,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:20,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:08:20,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:20,461 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:08:20,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417079767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:20,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:08:20,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 15:08:20,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263080148] [2025-03-04 15:08:20,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:20,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:08:20,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:20,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:08:20,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:08:20,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-04 15:08:20,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 598 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:20,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:20,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-04 15:08:20,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:20,967 INFO L124 PetriNetUnfolderBase]: 3236/6478 cut-off events. [2025-03-04 15:08:20,968 INFO L125 PetriNetUnfolderBase]: For 10477/10667 co-relation queries the response was YES. [2025-03-04 15:08:20,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18440 conditions, 6478 events. 3236/6478 cut-off events. For 10477/10667 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 41499 event pairs, 624 based on Foata normal form. 204/6476 useless extension candidates. Maximal degree in co-relation 15532. Up to 2915 conditions per place. [2025-03-04 15:08:21,012 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 125 selfloop transitions, 5 changer transitions 0/152 dead transitions. [2025-03-04 15:08:21,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 152 transitions, 1383 flow [2025-03-04 15:08:21,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:21,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:21,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-03-04 15:08:21,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-03-04 15:08:21,015 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 598 flow. Second operand 4 states and 116 transitions. [2025-03-04 15:08:21,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 152 transitions, 1383 flow [2025-03-04 15:08:21,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 152 transitions, 1311 flow, removed 29 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:21,031 INFO L231 Difference]: Finished difference. Result has 86 places, 85 transitions, 564 flow [2025-03-04 15:08:21,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=564, PETRI_PLACES=86, PETRI_TRANSITIONS=85} [2025-03-04 15:08:21,032 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 40 predicate places. [2025-03-04 15:08:21,033 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 85 transitions, 564 flow [2025-03-04 15:08:21,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:21,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:21,033 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:21,040 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:08:21,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:21,234 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:21,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:21,234 INFO L85 PathProgramCache]: Analyzing trace with hash -880777165, now seen corresponding path program 1 times [2025-03-04 15:08:21,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:21,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761396093] [2025-03-04 15:08:21,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:21,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:21,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:08:21,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:08:21,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:21,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:21,343 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:08:21,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:21,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761396093] [2025-03-04 15:08:21,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761396093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:21,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:21,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:08:21,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934363545] [2025-03-04 15:08:21,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:21,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:08:21,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:21,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:08:21,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:08:21,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-04 15:08:21,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 85 transitions, 564 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:21,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:21,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-04 15:08:21,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:22,009 INFO L124 PetriNetUnfolderBase]: 2796/5801 cut-off events. [2025-03-04 15:08:22,009 INFO L125 PetriNetUnfolderBase]: For 11448/11785 co-relation queries the response was YES. [2025-03-04 15:08:22,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17390 conditions, 5801 events. 2796/5801 cut-off events. For 11448/11785 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 37128 event pairs, 564 based on Foata normal form. 39/5835 useless extension candidates. Maximal degree in co-relation 14496. Up to 3403 conditions per place. [2025-03-04 15:08:22,041 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 119 selfloop transitions, 13 changer transitions 0/142 dead transitions. [2025-03-04 15:08:22,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 142 transitions, 1115 flow [2025-03-04 15:08:22,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:08:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:08:22,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2025-03-04 15:08:22,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5659722222222222 [2025-03-04 15:08:22,042 INFO L175 Difference]: Start difference. First operand has 86 places, 85 transitions, 564 flow. Second operand 6 states and 163 transitions. [2025-03-04 15:08:22,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 142 transitions, 1115 flow [2025-03-04 15:08:22,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 142 transitions, 1075 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:22,058 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 653 flow [2025-03-04 15:08:22,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=653, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2025-03-04 15:08:22,058 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 45 predicate places. [2025-03-04 15:08:22,058 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 653 flow [2025-03-04 15:08:22,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:22,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:22,059 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:22,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:08:22,059 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:22,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:22,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1196325563, now seen corresponding path program 1 times [2025-03-04 15:08:22,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:22,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109745776] [2025-03-04 15:08:22,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:22,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:22,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:08:22,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:08:22,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:22,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:08:22,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:22,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109745776] [2025-03-04 15:08:22,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109745776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:22,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:22,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:22,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750831598] [2025-03-04 15:08:22,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:22,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:22,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:22,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:22,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:22,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-04 15:08:22,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 653 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:22,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:22,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-04 15:08:22,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:22,723 INFO L124 PetriNetUnfolderBase]: 3062/6446 cut-off events. [2025-03-04 15:08:22,724 INFO L125 PetriNetUnfolderBase]: For 11345/11483 co-relation queries the response was YES. [2025-03-04 15:08:22,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18211 conditions, 6446 events. 3062/6446 cut-off events. For 11345/11483 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 42695 event pairs, 581 based on Foata normal form. 0/6445 useless extension candidates. Maximal degree in co-relation 15403. Up to 2690 conditions per place. [2025-03-04 15:08:22,763 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 143 selfloop transitions, 6 changer transitions 0/172 dead transitions. [2025-03-04 15:08:22,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 172 transitions, 1615 flow [2025-03-04 15:08:22,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:22,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-03-04 15:08:22,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-03-04 15:08:22,765 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 653 flow. Second operand 4 states and 116 transitions. [2025-03-04 15:08:22,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 172 transitions, 1615 flow [2025-03-04 15:08:22,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 172 transitions, 1605 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:22,787 INFO L231 Difference]: Finished difference. Result has 92 places, 90 transitions, 665 flow [2025-03-04 15:08:22,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=665, PETRI_PLACES=92, PETRI_TRANSITIONS=90} [2025-03-04 15:08:22,787 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 46 predicate places. [2025-03-04 15:08:22,787 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 90 transitions, 665 flow [2025-03-04 15:08:22,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:22,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:22,788 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:22,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:08:22,788 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:22,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:22,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1701312136, now seen corresponding path program 1 times [2025-03-04 15:08:22,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:22,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23356505] [2025-03-04 15:08:22,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:22,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:22,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:08:22,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:08:22,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:22,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:22,915 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:22,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:22,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23356505] [2025-03-04 15:08:22,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23356505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:22,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733253951] [2025-03-04 15:08:22,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:22,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:22,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:22,918 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:08:22,919 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:08:22,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:08:23,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:08:23,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:23,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:23,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 984 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:08:23,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:23,108 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:08:23,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733253951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:23,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:08:23,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 15:08:23,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399142132] [2025-03-04 15:08:23,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:23,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:08:23,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:23,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:08:23,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:08:23,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-04 15:08:23,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 90 transitions, 665 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:23,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:23,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-04 15:08:23,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:23,681 INFO L124 PetriNetUnfolderBase]: 3167/6171 cut-off events. [2025-03-04 15:08:23,681 INFO L125 PetriNetUnfolderBase]: For 14460/14472 co-relation queries the response was YES. [2025-03-04 15:08:23,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19486 conditions, 6171 events. 3167/6171 cut-off events. For 14460/14472 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 38767 event pairs, 544 based on Foata normal form. 178/6171 useless extension candidates. Maximal degree in co-relation 18624. Up to 3741 conditions per place. [2025-03-04 15:08:23,717 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 96 selfloop transitions, 5 changer transitions 0/123 dead transitions. [2025-03-04 15:08:23,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 123 transitions, 1087 flow [2025-03-04 15:08:23,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:23,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-03-04 15:08:23,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-04 15:08:23,719 INFO L175 Difference]: Start difference. First operand has 92 places, 90 transitions, 665 flow. Second operand 4 states and 112 transitions. [2025-03-04 15:08:23,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 123 transitions, 1087 flow [2025-03-04 15:08:23,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 123 transitions, 1065 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:23,742 INFO L231 Difference]: Finished difference. Result has 92 places, 89 transitions, 663 flow [2025-03-04 15:08:23,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=663, PETRI_PLACES=92, PETRI_TRANSITIONS=89} [2025-03-04 15:08:23,742 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 46 predicate places. [2025-03-04 15:08:23,743 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 89 transitions, 663 flow [2025-03-04 15:08:23,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:23,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:23,743 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:08:23,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:23,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:23,944 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:23,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:23,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1201067506, now seen corresponding path program 1 times [2025-03-04 15:08:23,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:23,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843298923] [2025-03-04 15:08:23,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:23,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:23,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:08:23,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:08:23,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:23,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:08:24,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:24,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843298923] [2025-03-04 15:08:24,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843298923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:24,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:24,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:24,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263537577] [2025-03-04 15:08:24,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:24,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:24,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:24,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:24,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:24,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-04 15:08:24,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 663 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:24,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:24,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-04 15:08:24,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:24,476 INFO L124 PetriNetUnfolderBase]: 2926/5856 cut-off events. [2025-03-04 15:08:24,476 INFO L125 PetriNetUnfolderBase]: For 12713/12738 co-relation queries the response was YES. [2025-03-04 15:08:24,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18210 conditions, 5856 events. 2926/5856 cut-off events. For 12713/12738 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 36717 event pairs, 615 based on Foata normal form. 178/6034 useless extension candidates. Maximal degree in co-relation 15487. Up to 2981 conditions per place. [2025-03-04 15:08:24,503 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 107 selfloop transitions, 6 changer transitions 0/135 dead transitions. [2025-03-04 15:08:24,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 135 transitions, 1215 flow [2025-03-04 15:08:24,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-03-04 15:08:24,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-03-04 15:08:24,505 INFO L175 Difference]: Start difference. First operand has 92 places, 89 transitions, 663 flow. Second operand 4 states and 116 transitions. [2025-03-04 15:08:24,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 135 transitions, 1215 flow [2025-03-04 15:08:24,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 135 transitions, 1205 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:24,521 INFO L231 Difference]: Finished difference. Result has 92 places, 89 transitions, 669 flow [2025-03-04 15:08:24,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=669, PETRI_PLACES=92, PETRI_TRANSITIONS=89} [2025-03-04 15:08:24,522 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 46 predicate places. [2025-03-04 15:08:24,522 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 89 transitions, 669 flow [2025-03-04 15:08:24,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:24,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:24,522 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:24,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:08:24,522 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:24,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:24,523 INFO L85 PathProgramCache]: Analyzing trace with hash -978825969, now seen corresponding path program 1 times [2025-03-04 15:08:24,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:24,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684622211] [2025-03-04 15:08:24,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:24,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:24,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:08:24,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:08:24,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:24,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:24,623 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:08:24,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:24,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684622211] [2025-03-04 15:08:24,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684622211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:24,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:24,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:08:24,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839052684] [2025-03-04 15:08:24,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:24,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:08:24,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:24,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:08:24,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:08:24,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-04 15:08:24,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 669 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:24,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:24,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-04 15:08:24,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:25,106 INFO L124 PetriNetUnfolderBase]: 2862/5768 cut-off events. [2025-03-04 15:08:25,106 INFO L125 PetriNetUnfolderBase]: For 14681/14681 co-relation queries the response was YES. [2025-03-04 15:08:25,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18445 conditions, 5768 events. 2862/5768 cut-off events. For 14681/14681 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 36392 event pairs, 455 based on Foata normal form. 104/5871 useless extension candidates. Maximal degree in co-relation 15453. Up to 3054 conditions per place. [2025-03-04 15:08:25,145 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 85 selfloop transitions, 35 changer transitions 0/129 dead transitions. [2025-03-04 15:08:25,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 129 transitions, 1104 flow [2025-03-04 15:08:25,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:08:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:08:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2025-03-04 15:08:25,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2025-03-04 15:08:25,146 INFO L175 Difference]: Start difference. First operand has 92 places, 89 transitions, 669 flow. Second operand 7 states and 162 transitions. [2025-03-04 15:08:25,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 129 transitions, 1104 flow [2025-03-04 15:08:25,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 129 transitions, 1080 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:25,168 INFO L231 Difference]: Finished difference. Result has 93 places, 85 transitions, 752 flow [2025-03-04 15:08:25,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=752, PETRI_PLACES=93, PETRI_TRANSITIONS=85} [2025-03-04 15:08:25,168 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 47 predicate places. [2025-03-04 15:08:25,168 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 85 transitions, 752 flow [2025-03-04 15:08:25,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:25,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:25,169 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, 1, 1] [2025-03-04 15:08:25,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:08:25,169 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:25,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:25,169 INFO L85 PathProgramCache]: Analyzing trace with hash -205350321, now seen corresponding path program 1 times [2025-03-04 15:08:25,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:25,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793251580] [2025-03-04 15:08:25,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:25,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:25,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:08:25,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:08:25,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:25,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:25,317 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:08:25,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:25,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793251580] [2025-03-04 15:08:25,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793251580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:25,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:25,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:08:25,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827249238] [2025-03-04 15:08:25,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:25,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:08:25,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:25,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:08:25,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:08:25,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-04 15:08:25,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 85 transitions, 752 flow. Second operand has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:25,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:25,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-04 15:08:25,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:25,838 INFO L124 PetriNetUnfolderBase]: 3126/6320 cut-off events. [2025-03-04 15:08:25,838 INFO L125 PetriNetUnfolderBase]: For 19709/19709 co-relation queries the response was YES. [2025-03-04 15:08:25,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20404 conditions, 6320 events. 3126/6320 cut-off events. For 19709/19709 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 40381 event pairs, 622 based on Foata normal form. 76/6395 useless extension candidates. Maximal degree in co-relation 17376. Up to 3339 conditions per place. [2025-03-04 15:08:25,871 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 132 selfloop transitions, 17 changer transitions 6/164 dead transitions. [2025-03-04 15:08:25,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 164 transitions, 1455 flow [2025-03-04 15:08:25,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:08:25,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:08:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2025-03-04 15:08:25,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5390625 [2025-03-04 15:08:25,872 INFO L175 Difference]: Start difference. First operand has 93 places, 85 transitions, 752 flow. Second operand 8 states and 207 transitions. [2025-03-04 15:08:25,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 164 transitions, 1455 flow [2025-03-04 15:08:25,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 164 transitions, 1435 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:25,895 INFO L231 Difference]: Finished difference. Result has 103 places, 90 transitions, 873 flow [2025-03-04 15:08:25,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=873, PETRI_PLACES=103, PETRI_TRANSITIONS=90} [2025-03-04 15:08:25,895 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 57 predicate places. [2025-03-04 15:08:25,895 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 90 transitions, 873 flow [2025-03-04 15:08:25,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:25,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:25,895 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:25,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:08:25,896 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:25,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:25,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2113833740, now seen corresponding path program 1 times [2025-03-04 15:08:25,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:25,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630432783] [2025-03-04 15:08:25,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:25,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:25,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:08:25,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:08:25,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:25,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:26,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:26,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630432783] [2025-03-04 15:08:26,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630432783] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:26,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888277169] [2025-03-04 15:08:26,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:26,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:26,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:26,035 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:08:26,037 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:08:26,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:08:26,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:08:26,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:26,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:26,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:08:26,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:26,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:26,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:26,286 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:26,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888277169] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:26,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:26,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 15:08:26,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31640765] [2025-03-04 15:08:26,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:26,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 15:08:26,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:26,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 15:08:26,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-04 15:08:26,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-04 15:08:26,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 90 transitions, 873 flow. Second operand has 16 states, 16 states have (on average 16.625) internal successors, (266), 16 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:26,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:26,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-04 15:08:26,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:27,105 INFO L124 PetriNetUnfolderBase]: 3465/7039 cut-off events. [2025-03-04 15:08:27,105 INFO L125 PetriNetUnfolderBase]: For 25302/25302 co-relation queries the response was YES. [2025-03-04 15:08:27,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23120 conditions, 7039 events. 3465/7039 cut-off events. For 25302/25302 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 46552 event pairs, 609 based on Foata normal form. 176/7214 useless extension candidates. Maximal degree in co-relation 20228. Up to 1682 conditions per place. [2025-03-04 15:08:27,143 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 174 selfloop transitions, 58 changer transitions 18/259 dead transitions. [2025-03-04 15:08:27,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 259 transitions, 2200 flow [2025-03-04 15:08:27,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 15:08:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 15:08:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 426 transitions. [2025-03-04 15:08:27,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2025-03-04 15:08:27,145 INFO L175 Difference]: Start difference. First operand has 103 places, 90 transitions, 873 flow. Second operand 18 states and 426 transitions. [2025-03-04 15:08:27,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 259 transitions, 2200 flow [2025-03-04 15:08:27,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 259 transitions, 2178 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:27,172 INFO L231 Difference]: Finished difference. Result has 118 places, 98 transitions, 1115 flow [2025-03-04 15:08:27,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1115, PETRI_PLACES=118, PETRI_TRANSITIONS=98} [2025-03-04 15:08:27,173 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 72 predicate places. [2025-03-04 15:08:27,173 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 98 transitions, 1115 flow [2025-03-04 15:08:27,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.625) internal successors, (266), 16 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:27,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:27,173 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-03-04 15:08:27,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:27,374 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,SelfDestructingSolverStorable14 [2025-03-04 15:08:27,374 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:27,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:27,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1743923925, now seen corresponding path program 2 times [2025-03-04 15:08:27,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:27,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19023250] [2025-03-04 15:08:27,375 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:08:27,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:27,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-04 15:08:27,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 15:08:27,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:08:27,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:27,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:27,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19023250] [2025-03-04 15:08:27,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19023250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:27,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262201260] [2025-03-04 15:08:27,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:08:27,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:27,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:27,615 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:08:27,616 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:08:27,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-04 15:08:27,761 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 15:08:27,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:08:27,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:27,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 1138 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:08:27,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:27,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:27,944 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:27,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262201260] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:27,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:27,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-04 15:08:27,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985488228] [2025-03-04 15:08:27,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:27,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 15:08:27,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:27,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 15:08:27,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 15:08:27,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-04 15:08:27,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 98 transitions, 1115 flow. Second operand has 24 states, 24 states have (on average 18.541666666666668) internal successors, (445), 24 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:27,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:27,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-04 15:08:27,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:29,254 INFO L124 PetriNetUnfolderBase]: 5099/10509 cut-off events. [2025-03-04 15:08:29,254 INFO L125 PetriNetUnfolderBase]: For 45598/45598 co-relation queries the response was YES. [2025-03-04 15:08:29,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36069 conditions, 10509 events. 5099/10509 cut-off events. For 45598/45598 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 64376 event pairs, 929 based on Foata normal form. 208/10716 useless extension candidates. Maximal degree in co-relation 29041. Up to 2336 conditions per place. [2025-03-04 15:08:29,331 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 349 selfloop transitions, 73 changer transitions 0/431 dead transitions. [2025-03-04 15:08:29,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 431 transitions, 4018 flow [2025-03-04 15:08:29,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 15:08:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 15:08:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 672 transitions. [2025-03-04 15:08:29,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-04 15:08:29,332 INFO L175 Difference]: Start difference. First operand has 118 places, 98 transitions, 1115 flow. Second operand 24 states and 672 transitions. [2025-03-04 15:08:29,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 431 transitions, 4018 flow [2025-03-04 15:08:29,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 431 transitions, 3818 flow, removed 66 selfloop flow, removed 7 redundant places. [2025-03-04 15:08:29,392 INFO L231 Difference]: Finished difference. Result has 138 places, 140 transitions, 1835 flow [2025-03-04 15:08:29,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1835, PETRI_PLACES=138, PETRI_TRANSITIONS=140} [2025-03-04 15:08:29,392 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 92 predicate places. [2025-03-04 15:08:29,392 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 140 transitions, 1835 flow [2025-03-04 15:08:29,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 18.541666666666668) internal successors, (445), 24 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:29,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:29,393 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:29,400 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:08:29,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 15:08:29,593 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:29,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:29,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2080286061, now seen corresponding path program 2 times [2025-03-04 15:08:29,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:29,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57142505] [2025-03-04 15:08:29,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:08:29,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:29,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-04 15:08:29,626 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 15:08:29,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:08:29,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:29,927 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:29,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:29,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57142505] [2025-03-04 15:08:29,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57142505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:29,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093334515] [2025-03-04 15:08:29,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:08:29,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:29,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:29,930 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:08:29,931 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:08:29,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-04 15:08:30,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 15:08:30,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:08:30,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:30,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:08:30,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:30,179 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:30,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:30,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093334515] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:30,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:30,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2025-03-04 15:08:30,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185298277] [2025-03-04 15:08:30,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:30,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:08:30,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:30,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:08:30,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:08:30,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-04 15:08:30,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 140 transitions, 1835 flow. Second operand has 18 states, 18 states have (on average 17.11111111111111) internal successors, (308), 18 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:08:30,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:30,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-04 15:08:30,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:31,557 INFO L124 PetriNetUnfolderBase]: 6158/12602 cut-off events. [2025-03-04 15:08:31,558 INFO L125 PetriNetUnfolderBase]: For 62164/62164 co-relation queries the response was YES. [2025-03-04 15:08:31,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43578 conditions, 12602 events. 6158/12602 cut-off events. For 62164/62164 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 80701 event pairs, 735 based on Foata normal form. 72/12673 useless extension candidates. Maximal degree in co-relation 40539. Up to 3367 conditions per place. [2025-03-04 15:08:31,632 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 259 selfloop transitions, 96 changer transitions 0/364 dead transitions. [2025-03-04 15:08:31,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 364 transitions, 3851 flow [2025-03-04 15:08:31,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 15:08:31,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 15:08:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 479 transitions. [2025-03-04 15:08:31,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49895833333333334 [2025-03-04 15:08:31,634 INFO L175 Difference]: Start difference. First operand has 138 places, 140 transitions, 1835 flow. Second operand 20 states and 479 transitions. [2025-03-04 15:08:31,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 364 transitions, 3851 flow [2025-03-04 15:08:31,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 364 transitions, 3705 flow, removed 23 selfloop flow, removed 9 redundant places. [2025-03-04 15:08:31,703 INFO L231 Difference]: Finished difference. Result has 155 places, 169 transitions, 2454 flow [2025-03-04 15:08:31,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1722, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2454, PETRI_PLACES=155, PETRI_TRANSITIONS=169} [2025-03-04 15:08:31,704 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 109 predicate places. [2025-03-04 15:08:31,704 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 169 transitions, 2454 flow [2025-03-04 15:08:31,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 17.11111111111111) internal successors, (308), 18 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:08:31,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:31,704 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:31,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:31,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:31,904 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:31,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:31,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1144317193, now seen corresponding path program 3 times [2025-03-04 15:08:31,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:31,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817592573] [2025-03-04 15:08:31,905 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:08:31,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:31,920 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 76 statements into 4 equivalence classes. [2025-03-04 15:08:32,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 15:08:32,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 15:08:32,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:32,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:32,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817592573] [2025-03-04 15:08:32,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817592573] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:32,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658069640] [2025-03-04 15:08:32,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:08:32,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:32,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:32,434 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:08:32,436 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:08:32,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 76 statements into 4 equivalence classes. [2025-03-04 15:08:32,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 15:08:32,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 15:08:32,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:32,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 15:08:32,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:32,911 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:32,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:33,048 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:33,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658069640] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:33,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:33,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2025-03-04 15:08:33,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240202324] [2025-03-04 15:08:33,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:33,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 15:08:33,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:33,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 15:08:33,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2025-03-04 15:08:33,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-04 15:08:33,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 169 transitions, 2454 flow. Second operand has 26 states, 26 states have (on average 17.076923076923077) internal successors, (444), 26 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:33,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:33,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-04 15:08:33,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:35,039 INFO L124 PetriNetUnfolderBase]: 7794/15854 cut-off events. [2025-03-04 15:08:35,039 INFO L125 PetriNetUnfolderBase]: For 97346/97346 co-relation queries the response was YES. [2025-03-04 15:08:35,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56389 conditions, 15854 events. 7794/15854 cut-off events. For 97346/97346 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 107329 event pairs, 785 based on Foata normal form. 120/15973 useless extension candidates. Maximal degree in co-relation 53274. Up to 2703 conditions per place. [2025-03-04 15:08:35,161 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 356 selfloop transitions, 167 changer transitions 0/532 dead transitions. [2025-03-04 15:08:35,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 532 transitions, 5711 flow [2025-03-04 15:08:35,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 15:08:35,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-04 15:08:35,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 742 transitions. [2025-03-04 15:08:35,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4986559139784946 [2025-03-04 15:08:35,162 INFO L175 Difference]: Start difference. First operand has 155 places, 169 transitions, 2454 flow. Second operand 31 states and 742 transitions. [2025-03-04 15:08:35,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 532 transitions, 5711 flow [2025-03-04 15:08:35,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 532 transitions, 5605 flow, removed 24 selfloop flow, removed 9 redundant places. [2025-03-04 15:08:35,285 INFO L231 Difference]: Finished difference. Result has 184 places, 222 transitions, 3646 flow [2025-03-04 15:08:35,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2343, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=3646, PETRI_PLACES=184, PETRI_TRANSITIONS=222} [2025-03-04 15:08:35,286 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 138 predicate places. [2025-03-04 15:08:35,286 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 222 transitions, 3646 flow [2025-03-04 15:08:35,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 17.076923076923077) internal successors, (444), 26 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:35,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:35,286 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:35,296 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:08:35,486 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,SelfDestructingSolverStorable17 [2025-03-04 15:08:35,486 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:35,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:35,487 INFO L85 PathProgramCache]: Analyzing trace with hash 2010737082, now seen corresponding path program 1 times [2025-03-04 15:08:35,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:35,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672726829] [2025-03-04 15:08:35,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:35,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:35,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 15:08:35,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 15:08:35,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:35,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:35,812 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 1 proven. 105 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:08:35,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:35,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672726829] [2025-03-04 15:08:35,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672726829] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:35,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115459212] [2025-03-04 15:08:35,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:35,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:35,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:35,815 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:35,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 15:08:35,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 15:08:35,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 15:08:35,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:35,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:36,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 1314 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 15:08:36,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:36,093 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 1 proven. 105 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:08:36,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:36,275 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 1 proven. 105 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:08:36,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115459212] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:36,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:36,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2025-03-04 15:08:36,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024750380] [2025-03-04 15:08:36,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:36,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 15:08:36,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:36,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 15:08:36,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2025-03-04 15:08:36,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-04 15:08:36,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 222 transitions, 3646 flow. Second operand has 26 states, 26 states have (on average 17.46153846153846) internal successors, (454), 26 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:36,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:36,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-04 15:08:36,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:39,665 INFO L124 PetriNetUnfolderBase]: 11256/22942 cut-off events. [2025-03-04 15:08:39,666 INFO L125 PetriNetUnfolderBase]: For 177176/177176 co-relation queries the response was YES. [2025-03-04 15:08:39,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84601 conditions, 22942 events. 11256/22942 cut-off events. For 177176/177176 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 169340 event pairs, 1201 based on Foata normal form. 220/23161 useless extension candidates. Maximal degree in co-relation 81590. Up to 3933 conditions per place. [2025-03-04 15:08:39,850 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 343 selfloop transitions, 277 changer transitions 0/629 dead transitions. [2025-03-04 15:08:39,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 629 transitions, 8284 flow [2025-03-04 15:08:39,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 15:08:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-04 15:08:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 738 transitions. [2025-03-04 15:08:39,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48046875 [2025-03-04 15:08:39,852 INFO L175 Difference]: Start difference. First operand has 184 places, 222 transitions, 3646 flow. Second operand 32 states and 738 transitions. [2025-03-04 15:08:39,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 629 transitions, 8284 flow [2025-03-04 15:08:40,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 629 transitions, 8030 flow, removed 87 selfloop flow, removed 10 redundant places. [2025-03-04 15:08:40,147 INFO L231 Difference]: Finished difference. Result has 212 places, 337 transitions, 6221 flow [2025-03-04 15:08:40,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3520, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=6221, PETRI_PLACES=212, PETRI_TRANSITIONS=337} [2025-03-04 15:08:40,147 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 166 predicate places. [2025-03-04 15:08:40,147 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 337 transitions, 6221 flow [2025-03-04 15:08:40,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 17.46153846153846) internal successors, (454), 26 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:40,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:40,148 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1] [2025-03-04 15:08:40,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 15:08:40,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:40,352 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:40,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:40,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1123255925, now seen corresponding path program 3 times [2025-03-04 15:08:40,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:40,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892042671] [2025-03-04 15:08:40,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:08:40,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:40,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 119 statements into 11 equivalence classes. [2025-03-04 15:08:40,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 15:08:40,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 15:08:40,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:41,400 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:41,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:41,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892042671] [2025-03-04 15:08:41,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892042671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:41,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320037463] [2025-03-04 15:08:41,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:08:41,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:41,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:41,403 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:41,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 15:08:41,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 119 statements into 11 equivalence classes. [2025-03-04 15:08:42,830 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 15:08:42,830 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 15:08:42,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:42,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 1486 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 15:08:42,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:42,943 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:42,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:43,308 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:43,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320037463] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:43,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:43,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 46 [2025-03-04 15:08:43,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123396286] [2025-03-04 15:08:43,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:43,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 15:08:43,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:43,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 15:08:43,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 15:08:43,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-04 15:08:43,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 337 transitions, 6221 flow. Second operand has 48 states, 48 states have (on average 18.770833333333332) internal successors, (901), 48 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:43,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:43,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-04 15:08:43,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:49,937 INFO L124 PetriNetUnfolderBase]: 15536/31942 cut-off events. [2025-03-04 15:08:49,937 INFO L125 PetriNetUnfolderBase]: For 280382/280382 co-relation queries the response was YES. [2025-03-04 15:08:50,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118601 conditions, 31942 events. 15536/31942 cut-off events. For 280382/280382 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 222756 event pairs, 4023 based on Foata normal form. 468/32409 useless extension candidates. Maximal degree in co-relation 89070. Up to 11871 conditions per place. [2025-03-04 15:08:50,284 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 840 selfloop transitions, 188 changer transitions 0/1037 dead transitions. [2025-03-04 15:08:50,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 1037 transitions, 12625 flow [2025-03-04 15:08:50,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 15:08:50,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-03-04 15:08:50,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 1360 transitions. [2025-03-04 15:08:50,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5902777777777778 [2025-03-04 15:08:50,286 INFO L175 Difference]: Start difference. First operand has 212 places, 337 transitions, 6221 flow. Second operand 48 states and 1360 transitions. [2025-03-04 15:08:50,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 1037 transitions, 12625 flow [2025-03-04 15:08:50,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 1037 transitions, 12421 flow, removed 58 selfloop flow, removed 10 redundant places. [2025-03-04 15:08:50,848 INFO L231 Difference]: Finished difference. Result has 261 places, 413 transitions, 7931 flow [2025-03-04 15:08:50,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5852, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=7931, PETRI_PLACES=261, PETRI_TRANSITIONS=413} [2025-03-04 15:08:50,849 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 215 predicate places. [2025-03-04 15:08:50,849 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 413 transitions, 7931 flow [2025-03-04 15:08:50,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 18.770833333333332) internal successors, (901), 48 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:50,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:50,849 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:50,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 15:08:51,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:51,050 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:51,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:51,051 INFO L85 PathProgramCache]: Analyzing trace with hash -915120133, now seen corresponding path program 4 times [2025-03-04 15:08:51,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:51,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531843406] [2025-03-04 15:08:51,051 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:08:51,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:51,071 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 120 statements into 2 equivalence classes. [2025-03-04 15:08:51,095 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 15:08:51,096 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:08:51,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:51,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:51,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531843406] [2025-03-04 15:08:51,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531843406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:51,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085052069] [2025-03-04 15:08:51,740 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:08:51,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:51,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:51,742 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:51,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 15:08:51,834 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 120 statements into 2 equivalence classes. [2025-03-04 15:08:51,958 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 15:08:51,959 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:08:51,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:51,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 15:08:51,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:52,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:52,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085052069] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:52,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:52,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 40 [2025-03-04 15:08:52,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519515423] [2025-03-04 15:08:52,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:52,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-04 15:08:52,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:52,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-04 15:08:52,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=1298, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 15:08:52,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-04 15:08:52,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 413 transitions, 7931 flow. Second operand has 42 states, 42 states have (on average 17.047619047619047) internal successors, (716), 42 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:52,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:52,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-04 15:08:52,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:01,846 INFO L124 PetriNetUnfolderBase]: 20947/42687 cut-off events. [2025-03-04 15:09:01,846 INFO L125 PetriNetUnfolderBase]: For 428780/428780 co-relation queries the response was YES. [2025-03-04 15:09:02,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160571 conditions, 42687 events. 20947/42687 cut-off events. For 428780/428780 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 312289 event pairs, 2343 based on Foata normal form. 228/42914 useless extension candidates. Maximal degree in co-relation 156996. Up to 7338 conditions per place. [2025-03-04 15:09:02,457 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 654 selfloop transitions, 469 changer transitions 0/1132 dead transitions. [2025-03-04 15:09:02,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 1132 transitions, 15850 flow [2025-03-04 15:09:02,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-04 15:09:02,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2025-03-04 15:09:02,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 1248 transitions. [2025-03-04 15:09:02,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 15:09:02,459 INFO L175 Difference]: Start difference. First operand has 261 places, 413 transitions, 7931 flow. Second operand 52 states and 1248 transitions. [2025-03-04 15:09:02,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 1132 transitions, 15850 flow [2025-03-04 15:09:03,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 1132 transitions, 15313 flow, removed 115 selfloop flow, removed 17 redundant places. [2025-03-04 15:09:03,453 INFO L231 Difference]: Finished difference. Result has 318 places, 576 transitions, 12132 flow [2025-03-04 15:09:03,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7403, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=321, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=12132, PETRI_PLACES=318, PETRI_TRANSITIONS=576} [2025-03-04 15:09:03,453 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 272 predicate places. [2025-03-04 15:09:03,453 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 576 transitions, 12132 flow [2025-03-04 15:09:03,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 17.047619047619047) internal successors, (716), 42 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:03,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:03,454 INFO L206 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:03,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 15:09:03,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 15:09:03,654 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:09:03,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:03,655 INFO L85 PathProgramCache]: Analyzing trace with hash -522131667, now seen corresponding path program 2 times [2025-03-04 15:09:03,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:03,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425986642] [2025-03-04 15:09:03,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:09:03,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:03,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 121 statements into 2 equivalence classes. [2025-03-04 15:09:03,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 15:09:03,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:09:03,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:09:04,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:04,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425986642] [2025-03-04 15:09:04,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425986642] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:04,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673666056] [2025-03-04 15:09:04,077 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:09:04,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:04,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:04,079 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:09:04,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 15:09:04,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 121 statements into 2 equivalence classes. [2025-03-04 15:09:04,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 15:09:04,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:09:04,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:04,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 1488 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 15:09:04,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:09:04,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:09:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:09:04,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673666056] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:09:04,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:09:04,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2025-03-04 15:09:04,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671041067] [2025-03-04 15:09:04,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:09:04,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 15:09:04,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:04,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 15:09:04,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=975, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 15:09:04,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-04 15:09:04,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 576 transitions, 12132 flow. Second operand has 36 states, 36 states have (on average 17.27777777777778) internal successors, (622), 36 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:04,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:04,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-04 15:09:04,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:17,996 INFO L124 PetriNetUnfolderBase]: 27341/55797 cut-off events. [2025-03-04 15:09:17,996 INFO L125 PetriNetUnfolderBase]: For 649068/649068 co-relation queries the response was YES. [2025-03-04 15:09:18,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217790 conditions, 55797 events. 27341/55797 cut-off events. For 649068/649068 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 436612 event pairs, 2999 based on Foata normal form. 284/56080 useless extension candidates. Maximal degree in co-relation 214158. Up to 9620 conditions per place. [2025-03-04 15:09:19,148 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 576 selfloop transitions, 652 changer transitions 0/1237 dead transitions. [2025-03-04 15:09:19,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 1237 transitions, 21363 flow [2025-03-04 15:09:19,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-04 15:09:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-04 15:09:19,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 1043 transitions. [2025-03-04 15:09:19,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49384469696969696 [2025-03-04 15:09:19,150 INFO L175 Difference]: Start difference. First operand has 318 places, 576 transitions, 12132 flow. Second operand 44 states and 1043 transitions. [2025-03-04 15:09:19,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 1237 transitions, 21363 flow [2025-03-04 15:09:21,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 1237 transitions, 20943 flow, removed 184 selfloop flow, removed 7 redundant places. [2025-03-04 15:09:21,953 INFO L231 Difference]: Finished difference. Result has 371 places, 795 transitions, 18508 flow [2025-03-04 15:09:21,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=11692, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=464, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=18508, PETRI_PLACES=371, PETRI_TRANSITIONS=795} [2025-03-04 15:09:21,953 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 325 predicate places. [2025-03-04 15:09:21,953 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 795 transitions, 18508 flow [2025-03-04 15:09:21,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 17.27777777777778) internal successors, (622), 36 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:21,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:21,954 INFO L206 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:21,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 15:09:22,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 15:09:22,154 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:09:22,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:22,155 INFO L85 PathProgramCache]: Analyzing trace with hash 587303802, now seen corresponding path program 3 times [2025-03-04 15:09:22,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:22,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184881949] [2025-03-04 15:09:22,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:09:22,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:22,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 133 statements into 8 equivalence classes. [2025-03-04 15:09:22,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 15:09:22,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 15:09:22,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:22,995 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 2 proven. 244 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 15:09:22,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:22,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184881949] [2025-03-04 15:09:22,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184881949] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:22,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597790764] [2025-03-04 15:09:22,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:09:22,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:22,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:22,998 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:09:22,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 15:09:23,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 133 statements into 8 equivalence classes. [2025-03-04 15:09:23,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 15:09:23,971 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 15:09:23,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:23,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 1539 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 15:09:23,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:24,087 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 2 proven. 240 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:09:24,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:09:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 2 proven. 240 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:09:24,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597790764] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:09:24,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:09:24,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 32 [2025-03-04 15:09:24,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766849872] [2025-03-04 15:09:24,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:09:24,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 15:09:24,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:24,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 15:09:24,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=886, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 15:09:24,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-04 15:09:24,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 795 transitions, 18508 flow. Second operand has 34 states, 34 states have (on average 17.529411764705884) internal successors, (596), 34 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:24,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:24,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-04 15:09:24,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand