./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/triangular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/triangular-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:33:44,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:33:44,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:33:44,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:33:44,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:33:44,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:33:44,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:33:44,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:33:44,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:33:44,890 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:33:44,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:33:44,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:33:44,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:33:44,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:33:44,891 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:33:44,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:33:44,891 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:33:44,891 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:33:44,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:33:44,891 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:33:44,891 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:33:44,892 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:33:44,892 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:33:44,892 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:33:44,892 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:33:44,892 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:33:44,892 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:33:44,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:33:44,892 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:33:44,892 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:33:44,892 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:33:44,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:33:44,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:33:44,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:33:44,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:33:44,893 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:33:44,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:33:44,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:33:44,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:33:44,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:33:44,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:33:44,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:33:44,893 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:33:44,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:33:44,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:33:44,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:33:44,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:33:44,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:33:44,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:33:44,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:33:44,894 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-jdk21/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 -> 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 [2025-01-10 06:33:45,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:33:45,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:33:45,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:33:45,148 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:33:45,148 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:33:45,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-2.i [2025-01-10 06:33:46,476 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a5cd0d6f/93490ba6c2d24fc2a06b3687541a5a34/FLAG7bc5063b1 [2025-01-10 06:33:46,870 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:33:46,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2025-01-10 06:33:46,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a5cd0d6f/93490ba6c2d24fc2a06b3687541a5a34/FLAG7bc5063b1 [2025-01-10 06:33:46,897 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a5cd0d6f/93490ba6c2d24fc2a06b3687541a5a34 [2025-01-10 06:33:46,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:33:46,900 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:33:46,901 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:33:46,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:33:46,904 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:33:46,905 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:33:46" (1/1) ... [2025-01-10 06:33:46,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed7dbbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:46, skipping insertion in model container [2025-01-10 06:33:46,906 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:33:46" (1/1) ... [2025-01-10 06:33:46,927 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:33:47,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:33:47,101 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:33:47,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:33:47,151 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:33:47,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:47 WrapperNode [2025-01-10 06:33:47,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:33:47,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:33:47,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:33:47,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:33:47,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:47" (1/1) ... [2025-01-10 06:33:47,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:47" (1/1) ... [2025-01-10 06:33:47,181 INFO L138 Inliner]: procedures = 168, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2025-01-10 06:33:47,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:33:47,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:33:47,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:33:47,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:33:47,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:47" (1/1) ... [2025-01-10 06:33:47,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:47" (1/1) ... [2025-01-10 06:33:47,191 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:47" (1/1) ... [2025-01-10 06:33:47,200 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 06:33:47,201 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:47" (1/1) ... [2025-01-10 06:33:47,201 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:47" (1/1) ... [2025-01-10 06:33:47,204 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:47" (1/1) ... [2025-01-10 06:33:47,205 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:47" (1/1) ... [2025-01-10 06:33:47,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:47" (1/1) ... [2025-01-10 06:33:47,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:47" (1/1) ... [2025-01-10 06:33:47,209 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:47" (1/1) ... [2025-01-10 06:33:47,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:33:47,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:33:47,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:33:47,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:33:47,212 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:47" (1/1) ... [2025-01-10 06:33:47,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:33:47,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:33:47,239 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:33:47,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:33:47,262 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-10 06:33:47,262 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-10 06:33:47,262 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-10 06:33:47,262 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-10 06:33:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 06:33:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:33:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:33:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 06:33:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:33:47,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:33:47,264 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:33:47,354 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:33:47,356 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:33:47,456 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:33:47,457 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:33:47,519 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:33:47,519 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:33:47,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:33:47 BoogieIcfgContainer [2025-01-10 06:33:47,519 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:33:47,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:33:47,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:33:47,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:33:47,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:33:46" (1/3) ... [2025-01-10 06:33:47,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f11215a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:33:47, skipping insertion in model container [2025-01-10 06:33:47,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:33:47" (2/3) ... [2025-01-10 06:33:47,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f11215a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:33:47, skipping insertion in model container [2025-01-10 06:33:47,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:33:47" (3/3) ... [2025-01-10 06:33:47,526 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2025-01-10 06:33:47,540 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:33:47,542 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-2.i that has 3 procedures, 31 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-01-10 06:33:47,542 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:33:47,598 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:33:47,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 32 transitions, 72 flow [2025-01-10 06:33:47,662 INFO L124 PetriNetUnfolderBase]: 2/30 cut-off events. [2025-01-10 06:33:47,668 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:33:47,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 2/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2025-01-10 06:33:47,672 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 32 transitions, 72 flow [2025-01-10 06:33:47,674 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 30 transitions, 66 flow [2025-01-10 06:33:47,684 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:33:47,693 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;@7574b9fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:33:47,694 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-01-10 06:33:47,702 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:33:47,702 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 06:33:47,702 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:33:47,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:47,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:33:47,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:33:47,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:47,713 INFO L85 PathProgramCache]: Analyzing trace with hash 200350461, now seen corresponding path program 1 times [2025-01-10 06:33:47,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:47,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023047151] [2025-01-10 06:33:47,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:47,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:47,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:33:47,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:33:47,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:47,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:47,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:47,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:47,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023047151] [2025-01-10 06:33:47,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023047151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:47,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:47,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:33:47,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533645927] [2025-01-10 06:33:47,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:47,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:33:47,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:47,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:33:47,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:33:47,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2025-01-10 06:33:47,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-01-10 06:33:47,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:47,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2025-01-10 06:33:47,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:48,134 INFO L124 PetriNetUnfolderBase]: 288/572 cut-off events. [2025-01-10 06:33:48,135 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:33:48,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 572 events. 288/572 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3043 event pairs, 118 based on Foata normal form. 0/427 useless extension candidates. Maximal degree in co-relation 1045. Up to 241 conditions per place. [2025-01-10 06:33:48,141 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 27 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2025-01-10 06:33:48,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 150 flow [2025-01-10 06:33:48,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:33:48,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:33:48,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-01-10 06:33:48,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7604166666666666 [2025-01-10 06:33:48,151 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 66 flow. Second operand 3 states and 73 transitions. [2025-01-10 06:33:48,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 150 flow [2025-01-10 06:33:48,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:33:48,157 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 86 flow [2025-01-10 06:33:48,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-01-10 06:33:48,161 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2025-01-10 06:33:48,161 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 86 flow [2025-01-10 06:33:48,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-01-10 06:33:48,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:48,161 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:33:48,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:33:48,162 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:33:48,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:48,162 INFO L85 PathProgramCache]: Analyzing trace with hash 200350462, now seen corresponding path program 1 times [2025-01-10 06:33:48,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:48,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361970614] [2025-01-10 06:33:48,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:48,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:48,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:33:48,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:33:48,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:48,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:48,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:48,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361970614] [2025-01-10 06:33:48,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361970614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:48,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:48,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:33:48,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582614744] [2025-01-10 06:33:48,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:48,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:33:48,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:48,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:33:48,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:33:48,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2025-01-10 06:33:48,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-01-10 06:33:48,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:48,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2025-01-10 06:33:48,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:48,312 INFO L124 PetriNetUnfolderBase]: 279/583 cut-off events. [2025-01-10 06:33:48,312 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-01-10 06:33:48,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1163 conditions, 583 events. 279/583 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3038 event pairs, 102 based on Foata normal form. 16/530 useless extension candidates. Maximal degree in co-relation 1151. Up to 266 conditions per place. [2025-01-10 06:33:48,317 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 27 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2025-01-10 06:33:48,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 174 flow [2025-01-10 06:33:48,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:33:48,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:33:48,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-01-10 06:33:48,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-01-10 06:33:48,318 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 86 flow. Second operand 3 states and 72 transitions. [2025-01-10 06:33:48,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 174 flow [2025-01-10 06:33:48,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:33:48,319 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 100 flow [2025-01-10 06:33:48,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-01-10 06:33:48,320 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-01-10 06:33:48,320 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 100 flow [2025-01-10 06:33:48,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-01-10 06:33:48,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:48,320 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:48,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:33:48,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:33:48,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:48,321 INFO L85 PathProgramCache]: Analyzing trace with hash -736727232, now seen corresponding path program 1 times [2025-01-10 06:33:48,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:48,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94558397] [2025-01-10 06:33:48,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:48,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:48,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:33:48,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:33:48,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:48,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:48,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:48,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:48,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94558397] [2025-01-10 06:33:48,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94558397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:48,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:48,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:33:48,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661224899] [2025-01-10 06:33:48,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:48,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:48,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:48,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:48,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:48,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:33:48,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-01-10 06:33:48,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:48,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:33:48,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:48,597 INFO L124 PetriNetUnfolderBase]: 661/1318 cut-off events. [2025-01-10 06:33:48,597 INFO L125 PetriNetUnfolderBase]: For 433/433 co-relation queries the response was YES. [2025-01-10 06:33:48,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2743 conditions, 1318 events. 661/1318 cut-off events. For 433/433 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8082 event pairs, 260 based on Foata normal form. 64/1231 useless extension candidates. Maximal degree in co-relation 2730. Up to 721 conditions per place. [2025-01-10 06:33:48,606 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 50 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2025-01-10 06:33:48,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 62 transitions, 302 flow [2025-01-10 06:33:48,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:33:48,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:33:48,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-01-10 06:33:48,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7265625 [2025-01-10 06:33:48,610 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 100 flow. Second operand 4 states and 93 transitions. [2025-01-10 06:33:48,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 62 transitions, 302 flow [2025-01-10 06:33:48,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 62 transitions, 294 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:33:48,612 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 120 flow [2025-01-10 06:33:48,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-01-10 06:33:48,613 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-01-10 06:33:48,613 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 120 flow [2025-01-10 06:33:48,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-01-10 06:33:48,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:48,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:48,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:33:48,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:33:48,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:48,616 INFO L85 PathProgramCache]: Analyzing trace with hash -745241499, now seen corresponding path program 1 times [2025-01-10 06:33:48,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:48,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454584542] [2025-01-10 06:33:48,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:48,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:48,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:33:48,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:33:48,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:48,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:48,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:48,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454584542] [2025-01-10 06:33:48,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454584542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:48,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:48,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:33:48,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101993820] [2025-01-10 06:33:48,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:48,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:33:48,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:48,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:33:48,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:33:48,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2025-01-10 06:33:48,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-01-10 06:33:48,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:48,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2025-01-10 06:33:48,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:48,743 INFO L124 PetriNetUnfolderBase]: 439/1041 cut-off events. [2025-01-10 06:33:48,743 INFO L125 PetriNetUnfolderBase]: For 448/460 co-relation queries the response was YES. [2025-01-10 06:33:48,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2340 conditions, 1041 events. 439/1041 cut-off events. For 448/460 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6784 event pairs, 151 based on Foata normal form. 12/982 useless extension candidates. Maximal degree in co-relation 2325. Up to 459 conditions per place. [2025-01-10 06:33:48,748 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 37 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2025-01-10 06:33:48,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 53 transitions, 267 flow [2025-01-10 06:33:48,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:33:48,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:33:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-01-10 06:33:48,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.78125 [2025-01-10 06:33:48,749 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 120 flow. Second operand 3 states and 75 transitions. [2025-01-10 06:33:48,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 53 transitions, 267 flow [2025-01-10 06:33:48,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:33:48,752 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 140 flow [2025-01-10 06:33:48,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2025-01-10 06:33:48,753 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2025-01-10 06:33:48,753 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 140 flow [2025-01-10 06:33:48,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-01-10 06:33:48,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:48,753 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:48,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:33:48,753 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:33:48,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:48,753 INFO L85 PathProgramCache]: Analyzing trace with hash -745241498, now seen corresponding path program 1 times [2025-01-10 06:33:48,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:48,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257583550] [2025-01-10 06:33:48,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:48,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:48,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:33:48,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:33:48,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:48,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:48,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:48,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:48,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257583550] [2025-01-10 06:33:48,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257583550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:48,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:48,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:33:48,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743245969] [2025-01-10 06:33:48,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:48,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:33:48,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:48,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:33:48,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:33:48,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2025-01-10 06:33:48,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-01-10 06:33:48,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:48,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2025-01-10 06:33:48,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:48,908 INFO L124 PetriNetUnfolderBase]: 417/1031 cut-off events. [2025-01-10 06:33:48,908 INFO L125 PetriNetUnfolderBase]: For 603/615 co-relation queries the response was YES. [2025-01-10 06:33:48,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2471 conditions, 1031 events. 417/1031 cut-off events. For 603/615 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6809 event pairs, 117 based on Foata normal form. 36/1032 useless extension candidates. Maximal degree in co-relation 2453. Up to 483 conditions per place. [2025-01-10 06:33:48,920 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 37 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2025-01-10 06:33:48,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 290 flow [2025-01-10 06:33:48,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:33:48,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:33:48,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-01-10 06:33:48,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2025-01-10 06:33:48,922 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 140 flow. Second operand 3 states and 74 transitions. [2025-01-10 06:33:48,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 290 flow [2025-01-10 06:33:48,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:33:48,927 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 154 flow [2025-01-10 06:33:48,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2025-01-10 06:33:48,928 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2025-01-10 06:33:48,928 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 154 flow [2025-01-10 06:33:48,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-01-10 06:33:48,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:48,929 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:48,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:33:48,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:33:48,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:48,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1082466312, now seen corresponding path program 1 times [2025-01-10 06:33:48,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:48,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995493987] [2025-01-10 06:33:48,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:48,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:48,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:33:48,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:33:48,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:48,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:48,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:48,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:48,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995493987] [2025-01-10 06:33:48,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995493987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:48,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:48,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:33:48,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631004887] [2025-01-10 06:33:48,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:48,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:48,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:48,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:48,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:48,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:33:48,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-01-10 06:33:48,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:48,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:33:48,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:49,185 INFO L124 PetriNetUnfolderBase]: 661/1349 cut-off events. [2025-01-10 06:33:49,186 INFO L125 PetriNetUnfolderBase]: For 1033/1154 co-relation queries the response was YES. [2025-01-10 06:33:49,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3369 conditions, 1349 events. 661/1349 cut-off events. For 1033/1154 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8885 event pairs, 378 based on Foata normal form. 89/1388 useless extension candidates. Maximal degree in co-relation 3350. Up to 853 conditions per place. [2025-01-10 06:33:49,196 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 51 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2025-01-10 06:33:49,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 64 transitions, 376 flow [2025-01-10 06:33:49,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:33:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:33:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-01-10 06:33:49,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6953125 [2025-01-10 06:33:49,198 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 154 flow. Second operand 4 states and 89 transitions. [2025-01-10 06:33:49,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 64 transitions, 376 flow [2025-01-10 06:33:49,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 368 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:33:49,202 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 174 flow [2025-01-10 06:33:49,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2025-01-10 06:33:49,204 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2025-01-10 06:33:49,204 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 174 flow [2025-01-10 06:33:49,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-01-10 06:33:49,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:49,204 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:49,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:33:49,204 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:33:49,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:49,205 INFO L85 PathProgramCache]: Analyzing trace with hash -572130395, now seen corresponding path program 1 times [2025-01-10 06:33:49,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:49,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238194329] [2025-01-10 06:33:49,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:49,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:49,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:33:49,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:33:49,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:49,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:49,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:49,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:49,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238194329] [2025-01-10 06:33:49,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238194329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:49,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:49,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:33:49,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953767339] [2025-01-10 06:33:49,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:49,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:49,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:49,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:49,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:49,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2025-01-10 06:33:49,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-01-10 06:33:49,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:49,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2025-01-10 06:33:49,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:49,442 INFO L124 PetriNetUnfolderBase]: 553/1323 cut-off events. [2025-01-10 06:33:49,442 INFO L125 PetriNetUnfolderBase]: For 1098/1191 co-relation queries the response was YES. [2025-01-10 06:33:49,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3486 conditions, 1323 events. 553/1323 cut-off events. For 1098/1191 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9426 event pairs, 147 based on Foata normal form. 87/1368 useless extension candidates. Maximal degree in co-relation 3465. Up to 422 conditions per place. [2025-01-10 06:33:49,449 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 51 selfloop transitions, 9 changer transitions 0/74 dead transitions. [2025-01-10 06:33:49,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 74 transitions, 435 flow [2025-01-10 06:33:49,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:33:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:33:49,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2025-01-10 06:33:49,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.74375 [2025-01-10 06:33:49,451 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 174 flow. Second operand 5 states and 119 transitions. [2025-01-10 06:33:49,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 74 transitions, 435 flow [2025-01-10 06:33:49,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 74 transitions, 430 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:33:49,455 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 258 flow [2025-01-10 06:33:49,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=258, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2025-01-10 06:33:49,456 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 21 predicate places. [2025-01-10 06:33:49,456 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 258 flow [2025-01-10 06:33:49,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-01-10 06:33:49,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:49,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:49,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:33:49,457 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:33:49,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:49,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1153156442, now seen corresponding path program 1 times [2025-01-10 06:33:49,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:49,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910934598] [2025-01-10 06:33:49,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:49,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:49,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:33:49,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:33:49,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:49,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:49,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:49,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:49,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910934598] [2025-01-10 06:33:49,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910934598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:49,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:49,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:33:49,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144098319] [2025-01-10 06:33:49,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:49,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:49,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:49,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:49,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:49,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2025-01-10 06:33:49,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-01-10 06:33:49,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:49,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2025-01-10 06:33:49,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:49,726 INFO L124 PetriNetUnfolderBase]: 608/1492 cut-off events. [2025-01-10 06:33:49,727 INFO L125 PetriNetUnfolderBase]: For 1768/1900 co-relation queries the response was YES. [2025-01-10 06:33:49,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4070 conditions, 1492 events. 608/1492 cut-off events. For 1768/1900 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10801 event pairs, 81 based on Foata normal form. 76/1537 useless extension candidates. Maximal degree in co-relation 4045. Up to 509 conditions per place. [2025-01-10 06:33:49,736 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 55 selfloop transitions, 12 changer transitions 0/81 dead transitions. [2025-01-10 06:33:49,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 81 transitions, 545 flow [2025-01-10 06:33:49,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:33:49,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:33:49,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-01-10 06:33:49,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.725 [2025-01-10 06:33:49,737 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 258 flow. Second operand 5 states and 116 transitions. [2025-01-10 06:33:49,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 81 transitions, 545 flow [2025-01-10 06:33:49,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 81 transitions, 543 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 06:33:49,742 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 328 flow [2025-01-10 06:33:49,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=328, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2025-01-10 06:33:49,743 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 27 predicate places. [2025-01-10 06:33:49,743 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 328 flow [2025-01-10 06:33:49,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-01-10 06:33:49,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:49,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:49,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:33:49,744 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:33:49,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:49,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1153142163, now seen corresponding path program 1 times [2025-01-10 06:33:49,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:49,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002902242] [2025-01-10 06:33:49,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:49,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:49,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:33:49,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:33:49,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:49,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:49,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:49,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:49,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002902242] [2025-01-10 06:33:49,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002902242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:49,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:49,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:33:49,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053012072] [2025-01-10 06:33:49,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:49,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:49,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:49,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:49,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:49,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2025-01-10 06:33:49,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 328 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-01-10 06:33:49,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:49,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2025-01-10 06:33:49,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:49,887 INFO L124 PetriNetUnfolderBase]: 503/1157 cut-off events. [2025-01-10 06:33:49,887 INFO L125 PetriNetUnfolderBase]: For 2241/2394 co-relation queries the response was YES. [2025-01-10 06:33:49,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3301 conditions, 1157 events. 503/1157 cut-off events. For 2241/2394 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7513 event pairs, 378 based on Foata normal form. 103/1188 useless extension candidates. Maximal degree in co-relation 3272. Up to 846 conditions per place. [2025-01-10 06:33:49,895 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 30 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2025-01-10 06:33:49,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 45 transitions, 319 flow [2025-01-10 06:33:49,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:33:49,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:33:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-01-10 06:33:49,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-01-10 06:33:49,896 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 328 flow. Second operand 3 states and 60 transitions. [2025-01-10 06:33:49,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 45 transitions, 319 flow [2025-01-10 06:33:49,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 45 transitions, 304 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-01-10 06:33:49,900 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 244 flow [2025-01-10 06:33:49,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2025-01-10 06:33:49,901 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 23 predicate places. [2025-01-10 06:33:49,901 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 244 flow [2025-01-10 06:33:49,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-01-10 06:33:49,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:49,901 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:49,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:33:49,901 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:33:49,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:49,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1153142162, now seen corresponding path program 1 times [2025-01-10 06:33:49,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:49,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019545966] [2025-01-10 06:33:49,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:49,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:49,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:33:49,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:33:49,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:49,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:49,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:49,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019545966] [2025-01-10 06:33:49,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019545966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:49,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:49,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:33:49,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59373875] [2025-01-10 06:33:49,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:49,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:49,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:49,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:49,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:49,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2025-01-10 06:33:49,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-01-10 06:33:49,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:49,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2025-01-10 06:33:49,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:50,099 INFO L124 PetriNetUnfolderBase]: 558/1373 cut-off events. [2025-01-10 06:33:50,100 INFO L125 PetriNetUnfolderBase]: For 1496/1616 co-relation queries the response was YES. [2025-01-10 06:33:50,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 1373 events. 558/1373 cut-off events. For 1496/1616 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9423 event pairs, 119 based on Foata normal form. 75/1409 useless extension candidates. Maximal degree in co-relation 3645. Up to 674 conditions per place. [2025-01-10 06:33:50,107 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 50 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2025-01-10 06:33:50,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 69 transitions, 444 flow [2025-01-10 06:33:50,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:33:50,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:33:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-01-10 06:33:50,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.69375 [2025-01-10 06:33:50,108 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 244 flow. Second operand 5 states and 111 transitions. [2025-01-10 06:33:50,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 69 transitions, 444 flow [2025-01-10 06:33:50,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 69 transitions, 443 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:33:50,111 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 269 flow [2025-01-10 06:33:50,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2025-01-10 06:33:50,114 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2025-01-10 06:33:50,114 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 269 flow [2025-01-10 06:33:50,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-01-10 06:33:50,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:50,115 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:50,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:33:50,115 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:33:50,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:50,117 INFO L85 PathProgramCache]: Analyzing trace with hash 765712008, now seen corresponding path program 1 times [2025-01-10 06:33:50,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:50,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006405834] [2025-01-10 06:33:50,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:50,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:50,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:33:50,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:33:50,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:50,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:50,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:50,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:50,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006405834] [2025-01-10 06:33:50,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006405834] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:33:50,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121233378] [2025-01-10 06:33:50,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:50,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:50,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:33:50,187 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:33:50,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:33:50,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:33:50,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:33:50,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:50,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:50,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:33:50,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:33:50,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:50,295 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:33:50,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121233378] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:50,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:33:50,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-01-10 06:33:50,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886396664] [2025-01-10 06:33:50,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:50,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:33:50,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:50,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:33:50,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:33:50,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2025-01-10 06:33:50,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 269 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-01-10 06:33:50,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:50,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2025-01-10 06:33:50,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:50,594 INFO L124 PetriNetUnfolderBase]: 1036/2019 cut-off events. [2025-01-10 06:33:50,595 INFO L125 PetriNetUnfolderBase]: For 2495/2621 co-relation queries the response was YES. [2025-01-10 06:33:50,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5802 conditions, 2019 events. 1036/2019 cut-off events. For 2495/2621 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13172 event pairs, 224 based on Foata normal form. 117/2016 useless extension candidates. Maximal degree in co-relation 5775. Up to 785 conditions per place. [2025-01-10 06:33:50,612 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 57 selfloop transitions, 6 changer transitions 0/72 dead transitions. [2025-01-10 06:33:50,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 540 flow [2025-01-10 06:33:50,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:33:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:33:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-01-10 06:33:50,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.609375 [2025-01-10 06:33:50,613 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 269 flow. Second operand 4 states and 78 transitions. [2025-01-10 06:33:50,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 540 flow [2025-01-10 06:33:50,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 72 transitions, 524 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-01-10 06:33:50,620 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 267 flow [2025-01-10 06:33:50,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=267, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2025-01-10 06:33:50,621 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2025-01-10 06:33:50,621 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 267 flow [2025-01-10 06:33:50,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-01-10 06:33:50,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:50,621 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:33:50,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 06:33:50,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 06:33:50,822 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:33:50,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:50,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2032731302, now seen corresponding path program 1 times [2025-01-10 06:33:50,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:50,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179726852] [2025-01-10 06:33:50,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:50,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:50,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:33:50,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:33:50,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:50,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:33:50,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:50,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179726852] [2025-01-10 06:33:50,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179726852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:50,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:50,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:33:50,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840897822] [2025-01-10 06:33:50,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:50,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:50,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:50,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:50,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:50,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2025-01-10 06:33:50,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 267 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-01-10 06:33:50,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:50,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2025-01-10 06:33:50,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:51,229 INFO L124 PetriNetUnfolderBase]: 883/1891 cut-off events. [2025-01-10 06:33:51,232 INFO L125 PetriNetUnfolderBase]: For 2721/2800 co-relation queries the response was YES. [2025-01-10 06:33:51,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5512 conditions, 1891 events. 883/1891 cut-off events. For 2721/2800 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12779 event pairs, 246 based on Foata normal form. 108/1964 useless extension candidates. Maximal degree in co-relation 5486. Up to 726 conditions per place. [2025-01-10 06:33:51,249 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 57 selfloop transitions, 6 changer transitions 0/72 dead transitions. [2025-01-10 06:33:51,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 534 flow [2025-01-10 06:33:51,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:33:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:33:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-01-10 06:33:51,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.609375 [2025-01-10 06:33:51,251 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 267 flow. Second operand 4 states and 78 transitions. [2025-01-10 06:33:51,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 534 flow [2025-01-10 06:33:51,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 522 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:33:51,262 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 271 flow [2025-01-10 06:33:51,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2025-01-10 06:33:51,262 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2025-01-10 06:33:51,262 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 271 flow [2025-01-10 06:33:51,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-01-10 06:33:51,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:51,262 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:51,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:33:51,262 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:33:51,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:51,263 INFO L85 PathProgramCache]: Analyzing trace with hash 13406219, now seen corresponding path program 1 times [2025-01-10 06:33:51,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:51,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162948214] [2025-01-10 06:33:51,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:51,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:51,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:33:51,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:33:51,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:51,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:51,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:51,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162948214] [2025-01-10 06:33:51,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162948214] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:33:51,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96951361] [2025-01-10 06:33:51,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:51,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:51,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:33:51,379 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:33:51,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:33:51,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:33:51,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:33:51,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:51,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:51,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:33:51,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:33:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:51,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:33:51,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96951361] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:51,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:33:51,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:33:51,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172641097] [2025-01-10 06:33:51,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:51,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:33:51,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:51,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:33:51,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:33:51,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:33:51,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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-01-10 06:33:51,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:51,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:33:51,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:51,688 INFO L124 PetriNetUnfolderBase]: 845/1723 cut-off events. [2025-01-10 06:33:51,688 INFO L125 PetriNetUnfolderBase]: For 3397/3453 co-relation queries the response was YES. [2025-01-10 06:33:51,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5160 conditions, 1723 events. 845/1723 cut-off events. For 3397/3453 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11298 event pairs, 70 based on Foata normal form. 125/1770 useless extension candidates. Maximal degree in co-relation 5134. Up to 562 conditions per place. [2025-01-10 06:33:51,696 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 71 selfloop transitions, 6 changer transitions 1/87 dead transitions. [2025-01-10 06:33:51,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 686 flow [2025-01-10 06:33:51,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:33:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:33:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2025-01-10 06:33:51,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-01-10 06:33:51,697 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 271 flow. Second operand 6 states and 116 transitions. [2025-01-10 06:33:51,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 686 flow [2025-01-10 06:33:51,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 87 transitions, 666 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:33:51,702 INFO L231 Difference]: Finished difference. Result has 65 places, 44 transitions, 271 flow [2025-01-10 06:33:51,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=65, PETRI_TRANSITIONS=44} [2025-01-10 06:33:51,703 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2025-01-10 06:33:51,703 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 44 transitions, 271 flow [2025-01-10 06:33:51,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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-01-10 06:33:51,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:51,703 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:51,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:33:51,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:51,904 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:33:51,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:51,905 INFO L85 PathProgramCache]: Analyzing trace with hash 160065062, now seen corresponding path program 1 times [2025-01-10 06:33:51,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:51,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051453240] [2025-01-10 06:33:51,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:51,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:51,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:33:51,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:33:51,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:51,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:51,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:51,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051453240] [2025-01-10 06:33:51,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051453240] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:33:51,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693741537] [2025-01-10 06:33:51,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:51,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:51,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:33:51,959 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:33:51,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:33:51,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:33:52,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:33:52,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:52,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:52,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:33:52,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:33:52,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:52,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:33:52,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:52,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693741537] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:33:52,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:33:52,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 06:33:52,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286429922] [2025-01-10 06:33:52,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:33:52,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:33:52,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:52,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:33:52,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:33:52,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2025-01-10 06:33:52,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 44 transitions, 271 flow. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 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-01-10 06:33:52,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:52,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2025-01-10 06:33:52,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:52,279 INFO L124 PetriNetUnfolderBase]: 747/1709 cut-off events. [2025-01-10 06:33:52,280 INFO L125 PetriNetUnfolderBase]: For 3576/3629 co-relation queries the response was YES. [2025-01-10 06:33:52,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5224 conditions, 1709 events. 747/1709 cut-off events. For 3576/3629 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 10704 event pairs, 71 based on Foata normal form. 140/1824 useless extension candidates. Maximal degree in co-relation 5197. Up to 289 conditions per place. [2025-01-10 06:33:52,287 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 61 selfloop transitions, 12 changer transitions 4/89 dead transitions. [2025-01-10 06:33:52,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 89 transitions, 653 flow [2025-01-10 06:33:52,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:33:52,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:33:52,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2025-01-10 06:33:52,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2025-01-10 06:33:52,288 INFO L175 Difference]: Start difference. First operand has 65 places, 44 transitions, 271 flow. Second operand 7 states and 160 transitions. [2025-01-10 06:33:52,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 89 transitions, 653 flow [2025-01-10 06:33:52,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 89 transitions, 626 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-01-10 06:33:52,293 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 375 flow [2025-01-10 06:33:52,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=375, PETRI_PLACES=72, PETRI_TRANSITIONS=50} [2025-01-10 06:33:52,293 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2025-01-10 06:33:52,294 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 375 flow [2025-01-10 06:33:52,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 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-01-10 06:33:52,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:52,294 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:52,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:33:52,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:52,498 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:33:52,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:52,498 INFO L85 PathProgramCache]: Analyzing trace with hash 415593026, now seen corresponding path program 1 times [2025-01-10 06:33:52,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:52,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187572163] [2025-01-10 06:33:52,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:52,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:52,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:33:52,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:33:52,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:52,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:52,522 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:33:52,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:52,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187572163] [2025-01-10 06:33:52,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187572163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:52,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:52,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:33:52,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316817701] [2025-01-10 06:33:52,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:52,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:52,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:52,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:52,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:52,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2025-01-10 06:33:52,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 50 transitions, 375 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-01-10 06:33:52,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:52,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2025-01-10 06:33:52,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:52,683 INFO L124 PetriNetUnfolderBase]: 1190/2257 cut-off events. [2025-01-10 06:33:52,683 INFO L125 PetriNetUnfolderBase]: For 5916/5963 co-relation queries the response was YES. [2025-01-10 06:33:52,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7478 conditions, 2257 events. 1190/2257 cut-off events. For 5916/5963 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 13393 event pairs, 275 based on Foata normal form. 155/2378 useless extension candidates. Maximal degree in co-relation 7446. Up to 893 conditions per place. [2025-01-10 06:33:52,694 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 63 selfloop transitions, 6 changer transitions 0/77 dead transitions. [2025-01-10 06:33:52,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 77 transitions, 740 flow [2025-01-10 06:33:52,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:33:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:33:52,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2025-01-10 06:33:52,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.578125 [2025-01-10 06:33:52,695 INFO L175 Difference]: Start difference. First operand has 72 places, 50 transitions, 375 flow. Second operand 4 states and 74 transitions. [2025-01-10 06:33:52,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 77 transitions, 740 flow [2025-01-10 06:33:52,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 77 transitions, 705 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-01-10 06:33:52,702 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 368 flow [2025-01-10 06:33:52,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=368, PETRI_PLACES=72, PETRI_TRANSITIONS=50} [2025-01-10 06:33:52,703 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2025-01-10 06:33:52,703 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 368 flow [2025-01-10 06:33:52,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-01-10 06:33:52,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:52,703 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:52,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:33:52,703 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:33:52,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:52,703 INFO L85 PathProgramCache]: Analyzing trace with hash 982258284, now seen corresponding path program 1 times [2025-01-10 06:33:52,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:52,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125396166] [2025-01-10 06:33:52,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:52,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:52,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:33:52,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:33:52,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:52,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:52,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:52,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125396166] [2025-01-10 06:33:52,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125396166] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:33:52,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458132457] [2025-01-10 06:33:52,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:52,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:52,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:33:52,788 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:33:52,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:33:52,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:33:52,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:33:52,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:52,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:52,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:33:52,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:33:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:52,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:33:52,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:52,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458132457] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:33:52,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:33:52,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 06:33:52,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217638205] [2025-01-10 06:33:52,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:33:52,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:33:52,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:52,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:33:52,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:33:52,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2025-01-10 06:33:52,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 50 transitions, 368 flow. Second operand has 12 states, 12 states have (on average 16.333333333333332) internal successors, (196), 12 states have internal predecessors, (196), 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-01-10 06:33:52,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:52,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2025-01-10 06:33:52,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:53,318 INFO L124 PetriNetUnfolderBase]: 972/2188 cut-off events. [2025-01-10 06:33:53,319 INFO L125 PetriNetUnfolderBase]: For 7437/7458 co-relation queries the response was YES. [2025-01-10 06:33:53,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7026 conditions, 2188 events. 972/2188 cut-off events. For 7437/7458 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 13042 event pairs, 35 based on Foata normal form. 123/2302 useless extension candidates. Maximal degree in co-relation 6995. Up to 277 conditions per place. [2025-01-10 06:33:53,328 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 78 selfloop transitions, 17 changer transitions 17/124 dead transitions. [2025-01-10 06:33:53,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 124 transitions, 946 flow [2025-01-10 06:33:53,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:33:53,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:33:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 270 transitions. [2025-01-10 06:33:53,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.703125 [2025-01-10 06:33:53,330 INFO L175 Difference]: Start difference. First operand has 72 places, 50 transitions, 368 flow. Second operand 12 states and 270 transitions. [2025-01-10 06:33:53,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 124 transitions, 946 flow [2025-01-10 06:33:53,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 124 transitions, 909 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-01-10 06:33:53,337 INFO L231 Difference]: Finished difference. Result has 87 places, 52 transitions, 427 flow [2025-01-10 06:33:53,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=427, PETRI_PLACES=87, PETRI_TRANSITIONS=52} [2025-01-10 06:33:53,338 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 52 predicate places. [2025-01-10 06:33:53,338 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 52 transitions, 427 flow [2025-01-10 06:33:53,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.333333333333332) internal successors, (196), 12 states have internal predecessors, (196), 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-01-10 06:33:53,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:53,338 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:53,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 06:33:53,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 06:33:53,540 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:33:53,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:53,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1666394388, now seen corresponding path program 1 times [2025-01-10 06:33:53,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:53,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485101406] [2025-01-10 06:33:53,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:53,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:53,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 06:33:53,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 06:33:53,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:53,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:53,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:53,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485101406] [2025-01-10 06:33:53,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485101406] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:33:53,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283459362] [2025-01-10 06:33:53,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:53,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:53,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:33:53,649 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:33:53,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:33:53,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 06:33:53,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 06:33:53,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:53,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:53,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:33:53,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:33:53,765 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:53,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:33:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:53,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283459362] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:33:53,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:33:53,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-01-10 06:33:53,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237701952] [2025-01-10 06:33:53,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:33:53,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 06:33:53,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:53,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 06:33:53,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-01-10 06:33:53,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2025-01-10 06:33:53,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 52 transitions, 427 flow. Second operand has 16 states, 16 states have (on average 16.25) internal successors, (260), 16 states have internal predecessors, (260), 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-01-10 06:33:53,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:53,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2025-01-10 06:33:53,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:54,307 INFO L124 PetriNetUnfolderBase]: 1422/3158 cut-off events. [2025-01-10 06:33:54,307 INFO L125 PetriNetUnfolderBase]: For 11455/11481 co-relation queries the response was YES. [2025-01-10 06:33:54,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10126 conditions, 3158 events. 1422/3158 cut-off events. For 11455/11481 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 19018 event pairs, 71 based on Foata normal form. 116/3255 useless extension candidates. Maximal degree in co-relation 10087. Up to 389 conditions per place. [2025-01-10 06:33:54,349 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 92 selfloop transitions, 24 changer transitions 25/153 dead transitions. [2025-01-10 06:33:54,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 153 transitions, 1222 flow [2025-01-10 06:33:54,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:33:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 06:33:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 336 transitions. [2025-01-10 06:33:54,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-01-10 06:33:54,351 INFO L175 Difference]: Start difference. First operand has 87 places, 52 transitions, 427 flow. Second operand 15 states and 336 transitions. [2025-01-10 06:33:54,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 153 transitions, 1222 flow [2025-01-10 06:33:54,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 153 transitions, 1209 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-01-10 06:33:54,361 INFO L231 Difference]: Finished difference. Result has 105 places, 60 transitions, 578 flow [2025-01-10 06:33:54,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=578, PETRI_PLACES=105, PETRI_TRANSITIONS=60} [2025-01-10 06:33:54,361 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 70 predicate places. [2025-01-10 06:33:54,362 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 60 transitions, 578 flow [2025-01-10 06:33:54,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.25) internal successors, (260), 16 states have internal predecessors, (260), 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-01-10 06:33:54,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:54,362 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:54,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 06:33:54,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 06:33:54,563 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:33:54,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:54,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1059982752, now seen corresponding path program 2 times [2025-01-10 06:33:54,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:54,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441903559] [2025-01-10 06:33:54,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:33:54,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:54,570 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-01-10 06:33:54,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 06:33:54,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:33:54,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:54,739 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:54,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:54,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441903559] [2025-01-10 06:33:54,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441903559] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:33:54,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819090450] [2025-01-10 06:33:54,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:33:54,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:54,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:33:54,742 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:33:54,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:33:54,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-01-10 06:33:54,792 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 06:33:54,792 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:33:54,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:54,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 06:33:54,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:33:54,949 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 06:33:54,949 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:33:54,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819090450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:54,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:33:54,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 26 [2025-01-10 06:33:54,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255688653] [2025-01-10 06:33:54,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:54,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 06:33:54,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:54,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:33:54,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-01-10 06:33:54,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2025-01-10 06:33:54,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 60 transitions, 578 flow. Second operand has 13 states, 13 states have (on average 13.23076923076923) internal successors, (172), 13 states have internal predecessors, (172), 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-01-10 06:33:54,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:54,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2025-01-10 06:33:54,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:56,011 INFO L124 PetriNetUnfolderBase]: 4078/7404 cut-off events. [2025-01-10 06:33:56,011 INFO L125 PetriNetUnfolderBase]: For 18385/18531 co-relation queries the response was YES. [2025-01-10 06:33:56,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24371 conditions, 7404 events. 4078/7404 cut-off events. For 18385/18531 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 51336 event pairs, 110 based on Foata normal form. 332/7723 useless extension candidates. Maximal degree in co-relation 24334. Up to 1260 conditions per place. [2025-01-10 06:33:56,056 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 0 selfloop transitions, 0 changer transitions 221/221 dead transitions. [2025-01-10 06:33:56,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 221 transitions, 2359 flow [2025-01-10 06:33:56,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 06:33:56,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 06:33:56,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 233 transitions. [2025-01-10 06:33:56,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5600961538461539 [2025-01-10 06:33:56,061 INFO L175 Difference]: Start difference. First operand has 105 places, 60 transitions, 578 flow. Second operand 13 states and 233 transitions. [2025-01-10 06:33:56,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 221 transitions, 2359 flow [2025-01-10 06:33:56,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 221 transitions, 1833 flow, removed 4 selfloop flow, removed 30 redundant places. [2025-01-10 06:33:56,104 INFO L231 Difference]: Finished difference. Result has 82 places, 0 transitions, 0 flow [2025-01-10 06:33:56,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=82, PETRI_TRANSITIONS=0} [2025-01-10 06:33:56,105 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 47 predicate places. [2025-01-10 06:33:56,106 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 0 transitions, 0 flow [2025-01-10 06:33:56,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.23076923076923) internal successors, (172), 13 states have internal predecessors, (172), 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-01-10 06:33:56,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-01-10 06:33:56,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 18 remaining) [2025-01-10 06:33:56,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-01-10 06:33:56,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-01-10 06:33:56,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-01-10 06:33:56,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-01-10 06:33:56,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-01-10 06:33:56,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-01-10 06:33:56,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-01-10 06:33:56,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-01-10 06:33:56,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-01-10 06:33:56,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-01-10 06:33:56,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-01-10 06:33:56,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-01-10 06:33:56,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-01-10 06:33:56,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-01-10 06:33:56,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-01-10 06:33:56,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-01-10 06:33:56,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 06:33:56,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 06:33:56,316 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:56,324 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 06:33:56,327 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:33:56,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:33:56 BasicIcfg [2025-01-10 06:33:56,344 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:33:56,345 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:33:56,345 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:33:56,345 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:33:56,346 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:33:47" (3/4) ... [2025-01-10 06:33:56,347 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 06:33:56,353 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t1 [2025-01-10 06:33:56,354 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t2 [2025-01-10 06:33:56,357 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2025-01-10 06:33:56,361 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-10 06:33:56,362 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 06:33:56,362 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 06:33:56,473 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 06:33:56,477 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 06:33:56,478 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:33:56,479 INFO L158 Benchmark]: Toolchain (without parser) took 9578.28ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 111.9MB in the beginning and 209.3MB in the end (delta: -97.4MB). Peak memory consumption was 132.9MB. Max. memory is 16.1GB. [2025-01-10 06:33:56,479 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:33:56,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.13ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 92.3MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 06:33:56,480 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.78ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 90.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:33:56,481 INFO L158 Benchmark]: Boogie Preprocessor took 27.83ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 89.3MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:33:56,481 INFO L158 Benchmark]: RCFGBuilder took 308.56ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 69.6MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 06:33:56,483 INFO L158 Benchmark]: TraceAbstraction took 8823.71ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 69.0MB in the beginning and 212.7MB in the end (delta: -143.7MB). Peak memory consumption was 242.0MB. Max. memory is 16.1GB. [2025-01-10 06:33:56,483 INFO L158 Benchmark]: Witness Printer took 132.76ms. Allocated memory is still 377.5MB. Free memory was 212.7MB in the beginning and 209.3MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:33:56,488 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.13ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 92.3MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.78ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 90.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.83ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 89.3MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 308.56ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 69.6MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8823.71ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 69.0MB in the beginning and 212.7MB in the end (delta: -143.7MB). Peak memory consumption was 242.0MB. Max. memory is 16.1GB. * Witness Printer took 132.76ms. Allocated memory is still 377.5MB. Free memory was 212.7MB in the beginning and 209.3MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 698]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 698]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 696]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 696]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 706]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 706]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 704]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 704]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.7s, OverallIterations: 18, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1212 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1153 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1897 IncrementalHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 17 mSDtfsCounter, 1897 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 343 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=578occurred in iteration=17, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 440 NumberOfCodeBlocks, 440 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 488 ConstructedInterpolants, 0 QuantifiedInterpolants, 1358 SizeOfPredicates, 20 NumberOfNonLiveVariables, 688 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 27 InterpolantComputations, 15 PerfectInterpolantSequences, 166/403 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 06:33:56,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE