./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_22-deref_read_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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/goblint-regression/28-race_reach_22-deref_read_racefree.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 4ce97f399f5ab540e05119d9433f4e1bfecfe892f8e87faddc6435387a55a4d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:05:34,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:05:34,524 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 14:05:34,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:05:34,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:05:34,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:05:34,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:05:34,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:05:34,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:05:34,552 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:05:34,553 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:05:34,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:05:34,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:05:34,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:05:34,553 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:05:34,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:05:34,554 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:05:34,554 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:05:34,554 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:05:34,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:05:34,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:05:34,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:05:34,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:05:34,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:05:34,555 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:05:34,555 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:05:34,555 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:05:34,555 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:05:34,555 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:05:34,555 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:05:34,555 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:05:34,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:05:34,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:05:34,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:05:34,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:05:34,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:05:34,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:05:34,556 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:05:34,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:05:34,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:05:34,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:05:34,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:05:34,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:05:34,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:05:34,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:05:34,557 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 -> 4ce97f399f5ab540e05119d9433f4e1bfecfe892f8e87faddc6435387a55a4d6 [2025-02-08 14:05:34,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:05:34,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:05:34,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:05:34,827 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:05:34,827 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:05:34,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_22-deref_read_racefree.i [2025-02-08 14:05:36,074 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5eeb629aa/2f33af64bebf469ca1a1c8e2752bd09e/FLAG609521be1 [2025-02-08 14:05:36,424 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:05:36,425 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_22-deref_read_racefree.i [2025-02-08 14:05:36,438 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5eeb629aa/2f33af64bebf469ca1a1c8e2752bd09e/FLAG609521be1 [2025-02-08 14:05:36,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5eeb629aa/2f33af64bebf469ca1a1c8e2752bd09e [2025-02-08 14:05:36,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:05:36,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:05:36,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:05:36,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:05:36,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:05:36,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:05:36" (1/1) ... [2025-02-08 14:05:36,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b4c7b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:36, skipping insertion in model container [2025-02-08 14:05:36,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:05:36" (1/1) ... [2025-02-08 14:05:36,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:05:36,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:05:36,955 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:05:36,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:05:37,023 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:05:37,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:37 WrapperNode [2025-02-08 14:05:37,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:05:37,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:05:37,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:05:37,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:05:37,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:37" (1/1) ... [2025-02-08 14:05:37,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:37" (1/1) ... [2025-02-08 14:05:37,058 INFO L138 Inliner]: procedures = 170, calls = 38, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2025-02-08 14:05:37,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:05:37,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:05:37,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:05:37,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:05:37,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:37" (1/1) ... [2025-02-08 14:05:37,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:37" (1/1) ... [2025-02-08 14:05:37,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:37" (1/1) ... [2025-02-08 14:05:37,080 INFO L175 MemorySlicer]: Split 18 memory accesses to 4 slices as follows [2, 5, 6, 5]. 33 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 5]. The 2 writes are split as follows [0, 0, 2, 0]. [2025-02-08 14:05:37,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:37" (1/1) ... [2025-02-08 14:05:37,081 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:37" (1/1) ... [2025-02-08 14:05:37,084 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:37" (1/1) ... [2025-02-08 14:05:37,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:37" (1/1) ... [2025-02-08 14:05:37,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:37" (1/1) ... [2025-02-08 14:05:37,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:37" (1/1) ... [2025-02-08 14:05:37,087 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:05:37,088 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:05:37,088 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:05:37,088 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:05:37,089 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:37" (1/1) ... [2025-02-08 14:05:37,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:05:37,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:05:37,115 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-02-08 14:05:37,118 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-02-08 14:05:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:05:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:05:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 14:05:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 14:05:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:05:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:05:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 14:05:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 14:05:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 14:05:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:05:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 14:05:37,147 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 14:05:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:05:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:05:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 14:05:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 14:05:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 14:05:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:05:37,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:05:37,148 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 14:05:37,228 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:05:37,229 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:05:37,381 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:05:37,381 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:05:37,466 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:05:37,467 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:05:37,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:05:37 BoogieIcfgContainer [2025-02-08 14:05:37,467 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:05:37,469 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:05:37,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:05:37,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:05:37,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:05:36" (1/3) ... [2025-02-08 14:05:37,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4352776e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:05:37, skipping insertion in model container [2025-02-08 14:05:37,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:37" (2/3) ... [2025-02-08 14:05:37,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4352776e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:05:37, skipping insertion in model container [2025-02-08 14:05:37,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:05:37" (3/3) ... [2025-02-08 14:05:37,473 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_22-deref_read_racefree.i [2025-02-08 14:05:37,482 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:05:37,483 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_22-deref_read_racefree.i that has 2 procedures, 47 locations, 1 initial locations, 5 loop locations, and 6 error locations. [2025-02-08 14:05:37,483 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:05:37,509 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 14:05:37,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 55 transitions, 114 flow [2025-02-08 14:05:37,549 INFO L124 PetriNetUnfolderBase]: 10/69 cut-off events. [2025-02-08 14:05:37,550 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:05:37,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 69 events. 10/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 201 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 52. Up to 4 conditions per place. [2025-02-08 14:05:37,552 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 55 transitions, 114 flow [2025-02-08 14:05:37,554 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 55 transitions, 114 flow [2025-02-08 14:05:37,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:05:37,565 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;@1f3a11e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:05:37,565 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-08 14:05:37,569 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:05:37,569 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-08 14:05:37,569 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:05:37,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:37,570 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:05:37,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-02-08 14:05:37,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:37,573 INFO L85 PathProgramCache]: Analyzing trace with hash 273374938, now seen corresponding path program 1 times [2025-02-08 14:05:37,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:37,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475298968] [2025-02-08 14:05:37,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:37,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:37,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:05:37,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:05:37,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:37,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:37,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:05:37,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:37,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475298968] [2025-02-08 14:05:37,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475298968] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:37,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:37,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:37,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901842483] [2025-02-08 14:05:37,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:37,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:37,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:37,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:37,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:37,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2025-02-08 14:05:37,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 55 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-02-08 14:05:37,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:37,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2025-02-08 14:05:37,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:38,001 INFO L124 PetriNetUnfolderBase]: 110/386 cut-off events. [2025-02-08 14:05:38,004 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:05:38,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 386 events. 110/386 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1858 event pairs, 80 based on Foata normal form. 101/454 useless extension candidates. Maximal degree in co-relation 622. Up to 208 conditions per place. [2025-02-08 14:05:38,009 INFO L140 encePairwiseOnDemand]: 41/55 looper letters, 43 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2025-02-08 14:05:38,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 68 transitions, 232 flow [2025-02-08 14:05:38,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:38,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:38,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2025-02-08 14:05:38,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7136363636363636 [2025-02-08 14:05:38,022 INFO L175 Difference]: Start difference. First operand has 50 places, 55 transitions, 114 flow. Second operand 4 states and 157 transitions. [2025-02-08 14:05:38,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 68 transitions, 232 flow [2025-02-08 14:05:38,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 68 transitions, 232 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:05:38,035 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 104 flow [2025-02-08 14:05:38,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2025-02-08 14:05:38,044 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-02-08 14:05:38,044 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 104 flow [2025-02-08 14:05:38,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-02-08 14:05:38,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:38,049 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:38,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:05:38,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-02-08 14:05:38,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:38,050 INFO L85 PathProgramCache]: Analyzing trace with hash 855001931, now seen corresponding path program 1 times [2025-02-08 14:05:38,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:38,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28965676] [2025-02-08 14:05:38,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:38,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:38,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:05:38,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:05:38,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:38,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:38,077 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:05:38,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:05:38,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:05:38,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:38,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:38,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:05:38,099 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:05:38,100 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-08 14:05:38,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2025-02-08 14:05:38,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2025-02-08 14:05:38,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2025-02-08 14:05:38,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2025-02-08 14:05:38,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2025-02-08 14:05:38,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2025-02-08 14:05:38,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2025-02-08 14:05:38,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2025-02-08 14:05:38,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2025-02-08 14:05:38,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2025-02-08 14:05:38,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:05:38,103 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 14:05:38,104 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:05:38,104 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 14:05:38,130 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 14:05:38,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 89 transitions, 188 flow [2025-02-08 14:05:38,148 INFO L124 PetriNetUnfolderBase]: 18/122 cut-off events. [2025-02-08 14:05:38,148 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 14:05:38,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 122 events. 18/122 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 441 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 85. Up to 6 conditions per place. [2025-02-08 14:05:38,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 89 transitions, 188 flow [2025-02-08 14:05:38,150 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 89 transitions, 188 flow [2025-02-08 14:05:38,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:05:38,152 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;@1f3a11e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:05:38,152 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-02-08 14:05:38,154 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:05:38,155 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-08 14:05:38,155 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:05:38,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:38,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:05:38,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-02-08 14:05:38,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:38,156 INFO L85 PathProgramCache]: Analyzing trace with hash 358339796, now seen corresponding path program 1 times [2025-02-08 14:05:38,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:38,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522871866] [2025-02-08 14:05:38,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:38,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:38,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:05:38,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:05:38,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:38,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:05:38,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:38,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522871866] [2025-02-08 14:05:38,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522871866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:38,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:38,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:38,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145306014] [2025-02-08 14:05:38,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:38,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:38,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:38,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:38,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:38,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 89 [2025-02-08 14:05:38,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 89 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 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-02-08 14:05:38,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:38,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 89 [2025-02-08 14:05:38,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:39,043 INFO L124 PetriNetUnfolderBase]: 3410/7755 cut-off events. [2025-02-08 14:05:39,044 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-02-08 14:05:39,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13213 conditions, 7755 events. 3410/7755 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 66325 event pairs, 3224 based on Foata normal form. 2199/9218 useless extension candidates. Maximal degree in co-relation 11457. Up to 5380 conditions per place. [2025-02-08 14:05:39,093 INFO L140 encePairwiseOnDemand]: 69/89 looper letters, 59 selfloop transitions, 3 changer transitions 0/100 dead transitions. [2025-02-08 14:05:39,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 100 transitions, 334 flow [2025-02-08 14:05:39,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2025-02-08 14:05:39,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6825842696629213 [2025-02-08 14:05:39,099 INFO L175 Difference]: Start difference. First operand has 80 places, 89 transitions, 188 flow. Second operand 4 states and 243 transitions. [2025-02-08 14:05:39,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 100 transitions, 334 flow [2025-02-08 14:05:39,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 100 transitions, 334 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:05:39,102 INFO L231 Difference]: Finished difference. Result has 85 places, 77 transitions, 184 flow [2025-02-08 14:05:39,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=85, PETRI_TRANSITIONS=77} [2025-02-08 14:05:39,103 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 5 predicate places. [2025-02-08 14:05:39,103 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 77 transitions, 184 flow [2025-02-08 14:05:39,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 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-02-08 14:05:39,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:39,104 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:39,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:05:39,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-02-08 14:05:39,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:39,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1244494587, now seen corresponding path program 1 times [2025-02-08 14:05:39,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:39,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055288349] [2025-02-08 14:05:39,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:39,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:39,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:05:39,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:05:39,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:39,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:05:39,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:39,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055288349] [2025-02-08 14:05:39,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055288349] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:39,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:39,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:05:39,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028874601] [2025-02-08 14:05:39,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:39,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:05:39,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:39,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:05:39,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:05:39,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 89 [2025-02-08 14:05:39,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 77 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 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-02-08 14:05:39,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:39,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 89 [2025-02-08 14:05:39,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:39,932 INFO L124 PetriNetUnfolderBase]: 3146/6788 cut-off events. [2025-02-08 14:05:39,932 INFO L125 PetriNetUnfolderBase]: For 622/622 co-relation queries the response was YES. [2025-02-08 14:05:39,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12478 conditions, 6788 events. 3146/6788 cut-off events. For 622/622 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 55755 event pairs, 720 based on Foata normal form. 144/6545 useless extension candidates. Maximal degree in co-relation 4353. Up to 3018 conditions per place. [2025-02-08 14:05:39,965 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 99 selfloop transitions, 6 changer transitions 0/143 dead transitions. [2025-02-08 14:05:39,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 143 transitions, 524 flow [2025-02-08 14:05:39,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:05:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:05:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 334 transitions. [2025-02-08 14:05:39,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6254681647940075 [2025-02-08 14:05:39,967 INFO L175 Difference]: Start difference. First operand has 85 places, 77 transitions, 184 flow. Second operand 6 states and 334 transitions. [2025-02-08 14:05:39,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 143 transitions, 524 flow [2025-02-08 14:05:39,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 143 transitions, 522 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:05:39,969 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 190 flow [2025-02-08 14:05:39,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=88, PETRI_TRANSITIONS=76} [2025-02-08 14:05:39,970 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 8 predicate places. [2025-02-08 14:05:39,970 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 190 flow [2025-02-08 14:05:39,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 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-02-08 14:05:39,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:39,971 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:39,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:05:39,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-02-08 14:05:39,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:39,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1850021008, now seen corresponding path program 1 times [2025-02-08 14:05:39,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:39,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513436447] [2025-02-08 14:05:39,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:39,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:39,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:05:39,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:05:39,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:39,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:40,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:05:40,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:40,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513436447] [2025-02-08 14:05:40,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513436447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:40,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:40,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:40,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871522543] [2025-02-08 14:05:40,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:40,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:40,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:40,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:40,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:40,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 89 [2025-02-08 14:05:40,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 76 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 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-02-08 14:05:40,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:40,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 89 [2025-02-08 14:05:40,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:40,623 INFO L124 PetriNetUnfolderBase]: 3033/6663 cut-off events. [2025-02-08 14:05:40,624 INFO L125 PetriNetUnfolderBase]: For 1111/1272 co-relation queries the response was YES. [2025-02-08 14:05:40,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12277 conditions, 6663 events. 3033/6663 cut-off events. For 1111/1272 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 54568 event pairs, 949 based on Foata normal form. 130/6417 useless extension candidates. Maximal degree in co-relation 9838. Up to 4227 conditions per place. [2025-02-08 14:05:40,645 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 82 selfloop transitions, 6 changer transitions 0/127 dead transitions. [2025-02-08 14:05:40,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 127 transitions, 510 flow [2025-02-08 14:05:40,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:05:40,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:05:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 284 transitions. [2025-02-08 14:05:40,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6382022471910113 [2025-02-08 14:05:40,647 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 190 flow. Second operand 5 states and 284 transitions. [2025-02-08 14:05:40,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 127 transitions, 510 flow [2025-02-08 14:05:40,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 127 transitions, 487 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-08 14:05:40,649 INFO L231 Difference]: Finished difference. Result has 91 places, 81 transitions, 222 flow [2025-02-08 14:05:40,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=222, PETRI_PLACES=91, PETRI_TRANSITIONS=81} [2025-02-08 14:05:40,650 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 11 predicate places. [2025-02-08 14:05:40,650 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 81 transitions, 222 flow [2025-02-08 14:05:40,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 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-02-08 14:05:40,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:40,651 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:05:40,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:05:40,651 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-02-08 14:05:40,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:40,651 INFO L85 PathProgramCache]: Analyzing trace with hash -75373161, now seen corresponding path program 1 times [2025-02-08 14:05:40,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:40,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471831182] [2025-02-08 14:05:40,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:40,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:40,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:05:40,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:05:40,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:40,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:40,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:05:40,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:40,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471831182] [2025-02-08 14:05:40,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471831182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:40,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:40,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:05:40,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954463834] [2025-02-08 14:05:40,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:40,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:40,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:40,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:40,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:40,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 89 [2025-02-08 14:05:40,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 81 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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-02-08 14:05:40,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:40,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 89 [2025-02-08 14:05:40,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:41,209 INFO L124 PetriNetUnfolderBase]: 3039/6110 cut-off events. [2025-02-08 14:05:41,210 INFO L125 PetriNetUnfolderBase]: For 1500/1500 co-relation queries the response was YES. [2025-02-08 14:05:41,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12304 conditions, 6110 events. 3039/6110 cut-off events. For 1500/1500 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 47657 event pairs, 254 based on Foata normal form. 152/6145 useless extension candidates. Maximal degree in co-relation 11412. Up to 3633 conditions per place. [2025-02-08 14:05:41,238 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 91 selfloop transitions, 6 changer transitions 0/135 dead transitions. [2025-02-08 14:05:41,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 135 transitions, 568 flow [2025-02-08 14:05:41,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:41,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 233 transitions. [2025-02-08 14:05:41,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6544943820224719 [2025-02-08 14:05:41,240 INFO L175 Difference]: Start difference. First operand has 91 places, 81 transitions, 222 flow. Second operand 4 states and 233 transitions. [2025-02-08 14:05:41,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 135 transitions, 568 flow [2025-02-08 14:05:41,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 135 transitions, 564 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 14:05:41,244 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 234 flow [2025-02-08 14:05:41,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2025-02-08 14:05:41,244 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 13 predicate places. [2025-02-08 14:05:41,244 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 234 flow [2025-02-08 14:05:41,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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-02-08 14:05:41,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:41,245 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 14:05:41,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:05:41,245 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-02-08 14:05:41,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:41,245 INFO L85 PathProgramCache]: Analyzing trace with hash 580847844, now seen corresponding path program 1 times [2025-02-08 14:05:41,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:41,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456968207] [2025-02-08 14:05:41,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:41,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:41,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:05:41,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:05:41,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:41,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:41,266 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:05:41,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:05:41,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:05:41,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:41,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:41,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:05:41,286 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:05:41,286 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-02-08 14:05:41,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 15 remaining) [2025-02-08 14:05:41,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 15 remaining) [2025-02-08 14:05:41,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 15 remaining) [2025-02-08 14:05:41,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 15 remaining) [2025-02-08 14:05:41,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 15 remaining) [2025-02-08 14:05:41,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 15 remaining) [2025-02-08 14:05:41,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 15 remaining) [2025-02-08 14:05:41,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 15 remaining) [2025-02-08 14:05:41,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 15 remaining) [2025-02-08 14:05:41,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 15 remaining) [2025-02-08 14:05:41,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 15 remaining) [2025-02-08 14:05:41,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 15 remaining) [2025-02-08 14:05:41,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 15 remaining) [2025-02-08 14:05:41,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 15 remaining) [2025-02-08 14:05:41,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:05:41,287 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 14:05:41,288 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:05:41,288 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 14:05:41,319 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 14:05:41,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 123 transitions, 264 flow [2025-02-08 14:05:41,340 INFO L124 PetriNetUnfolderBase]: 26/175 cut-off events. [2025-02-08 14:05:41,340 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 14:05:41,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 175 events. 26/175 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 699 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 133. Up to 8 conditions per place. [2025-02-08 14:05:41,341 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 123 transitions, 264 flow [2025-02-08 14:05:41,344 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 123 transitions, 264 flow [2025-02-08 14:05:41,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:05:41,348 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;@1f3a11e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:05:41,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-02-08 14:05:41,350 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:05:41,350 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-08 14:05:41,350 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:05:41,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:41,350 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:05:41,350 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 14:05:41,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:41,352 INFO L85 PathProgramCache]: Analyzing trace with hash 475751024, now seen corresponding path program 1 times [2025-02-08 14:05:41,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:41,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45776912] [2025-02-08 14:05:41,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:41,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:41,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:05:41,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:05:41,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:41,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:41,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:05:41,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:41,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45776912] [2025-02-08 14:05:41,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45776912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:41,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:41,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:41,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003108084] [2025-02-08 14:05:41,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:41,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:41,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:41,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:41,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:41,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 123 [2025-02-08 14:05:41,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 123 transitions, 264 flow. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:05:41,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:41,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 123 [2025-02-08 14:05:41,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:47,940 INFO L124 PetriNetUnfolderBase]: 63602/115565 cut-off events. [2025-02-08 14:05:47,940 INFO L125 PetriNetUnfolderBase]: For 996/996 co-relation queries the response was YES. [2025-02-08 14:05:48,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204256 conditions, 115565 events. 63602/115565 cut-off events. For 996/996 co-relation queries the response was YES. Maximal size of possible extension queue 2809. Compared 1203747 event pairs, 53400 based on Foata normal form. 37972/144080 useless extension candidates. Maximal degree in co-relation 90269. Up to 88036 conditions per place. [2025-02-08 14:05:48,596 INFO L140 encePairwiseOnDemand]: 97/123 looper letters, 71 selfloop transitions, 3 changer transitions 0/128 dead transitions. [2025-02-08 14:05:48,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 128 transitions, 422 flow [2025-02-08 14:05:48,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:48,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2025-02-08 14:05:48,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6605691056910569 [2025-02-08 14:05:48,599 INFO L175 Difference]: Start difference. First operand has 110 places, 123 transitions, 264 flow. Second operand 4 states and 325 transitions. [2025-02-08 14:05:48,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 128 transitions, 422 flow [2025-02-08 14:05:48,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 128 transitions, 420 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 14:05:48,603 INFO L231 Difference]: Finished difference. Result has 115 places, 105 transitions, 246 flow [2025-02-08 14:05:48,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=115, PETRI_TRANSITIONS=105} [2025-02-08 14:05:48,605 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 5 predicate places. [2025-02-08 14:05:48,606 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 105 transitions, 246 flow [2025-02-08 14:05:48,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:05:48,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:48,606 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:48,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:05:48,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 14:05:48,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:48,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1997642875, now seen corresponding path program 1 times [2025-02-08 14:05:48,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:48,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828487273] [2025-02-08 14:05:48,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:48,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:48,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:05:48,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:05:48,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:48,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:05:48,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:48,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828487273] [2025-02-08 14:05:48,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828487273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:48,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:48,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:05:48,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289889326] [2025-02-08 14:05:48,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:48,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:05:48,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:48,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:05:48,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:05:48,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 123 [2025-02-08 14:05:48,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 105 transitions, 246 flow. Second operand has 6 states, 6 states have (on average 55.5) internal successors, (333), 6 states have internal predecessors, (333), 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-02-08 14:05:48,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:48,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 123 [2025-02-08 14:05:48,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:54,874 INFO L124 PetriNetUnfolderBase]: 58586/100306 cut-off events. [2025-02-08 14:05:54,875 INFO L125 PetriNetUnfolderBase]: For 7906/7906 co-relation queries the response was YES. [2025-02-08 14:05:55,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189517 conditions, 100306 events. 58586/100306 cut-off events. For 7906/7906 co-relation queries the response was YES. Maximal size of possible extension queue 2409. Compared 985733 event pairs, 7884 based on Foata normal form. 1872/97816 useless extension candidates. Maximal degree in co-relation 16094. Up to 48378 conditions per place. [2025-02-08 14:05:55,396 INFO L140 encePairwiseOnDemand]: 118/123 looper letters, 133 selfloop transitions, 6 changer transitions 0/193 dead transitions. [2025-02-08 14:05:55,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 193 transitions, 698 flow [2025-02-08 14:05:55,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:05:55,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:05:55,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 464 transitions. [2025-02-08 14:05:55,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6287262872628726 [2025-02-08 14:05:55,398 INFO L175 Difference]: Start difference. First operand has 115 places, 105 transitions, 246 flow. Second operand 6 states and 464 transitions. [2025-02-08 14:05:55,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 193 transitions, 698 flow [2025-02-08 14:05:55,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 193 transitions, 696 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:05:55,402 INFO L231 Difference]: Finished difference. Result has 118 places, 104 transitions, 252 flow [2025-02-08 14:05:55,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=118, PETRI_TRANSITIONS=104} [2025-02-08 14:05:55,403 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 8 predicate places. [2025-02-08 14:05:55,403 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 104 transitions, 252 flow [2025-02-08 14:05:55,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.5) internal successors, (333), 6 states have internal predecessors, (333), 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-02-08 14:05:55,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:55,403 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:05:55,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 14:05:55,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 14:05:55,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:55,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1797387410, now seen corresponding path program 1 times [2025-02-08 14:05:55,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:55,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321698183] [2025-02-08 14:05:55,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:55,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:55,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:05:55,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:05:55,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:55,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:55,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:05:55,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:55,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321698183] [2025-02-08 14:05:55,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321698183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:55,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:55,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:05:55,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724717149] [2025-02-08 14:05:55,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:55,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:55,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:55,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:55,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:55,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 123 [2025-02-08 14:05:55,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 104 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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-02-08 14:05:55,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:55,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 123 [2025-02-08 14:05:55,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:06:00,398 INFO L124 PetriNetUnfolderBase]: 53570/88838 cut-off events. [2025-02-08 14:06:00,398 INFO L125 PetriNetUnfolderBase]: For 13695/13695 co-relation queries the response was YES. [2025-02-08 14:06:00,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174930 conditions, 88838 events. 53570/88838 cut-off events. For 13695/13695 co-relation queries the response was YES. Maximal size of possible extension queue 2156. Compared 826581 event pairs, 6301 based on Foata normal form. 1872/88982 useless extension candidates. Maximal degree in co-relation 144552. Up to 55289 conditions per place. [2025-02-08 14:06:01,072 INFO L140 encePairwiseOnDemand]: 118/123 looper letters, 110 selfloop transitions, 6 changer transitions 0/170 dead transitions. [2025-02-08 14:06:01,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 170 transitions, 614 flow [2025-02-08 14:06:01,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:06:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:06:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 331 transitions. [2025-02-08 14:06:01,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6727642276422764 [2025-02-08 14:06:01,073 INFO L175 Difference]: Start difference. First operand has 118 places, 104 transitions, 252 flow. Second operand 4 states and 331 transitions. [2025-02-08 14:06:01,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 170 transitions, 614 flow [2025-02-08 14:06:01,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 170 transitions, 598 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-08 14:06:01,108 INFO L231 Difference]: Finished difference. Result has 116 places, 104 transitions, 252 flow [2025-02-08 14:06:01,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=116, PETRI_TRANSITIONS=104} [2025-02-08 14:06:01,109 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 6 predicate places. [2025-02-08 14:06:01,109 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 104 transitions, 252 flow [2025-02-08 14:06:01,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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-02-08 14:06:01,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:01,110 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:06:01,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 14:06:01,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 14:06:01,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:01,110 INFO L85 PathProgramCache]: Analyzing trace with hash -518669524, now seen corresponding path program 1 times [2025-02-08 14:06:01,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:01,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308272032] [2025-02-08 14:06:01,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:01,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:01,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:06:01,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:06:01,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:01,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:06:01,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:06:01,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:06:01,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308272032] [2025-02-08 14:06:01,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308272032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:06:01,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:06:01,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:06:01,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774895765] [2025-02-08 14:06:01,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:06:01,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:06:01,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:06:01,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:06:01,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:06:01,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 123 [2025-02-08 14:06:01,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 104 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 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-02-08 14:06:01,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:06:01,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 123 [2025-02-08 14:06:01,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:06:07,306 INFO L124 PetriNetUnfolderBase]: 59409/105948 cut-off events. [2025-02-08 14:06:07,306 INFO L125 PetriNetUnfolderBase]: For 18878/18878 co-relation queries the response was YES. [2025-02-08 14:06:07,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198025 conditions, 105948 events. 59409/105948 cut-off events. For 18878/18878 co-relation queries the response was YES. Maximal size of possible extension queue 2660. Compared 1072144 event pairs, 23553 based on Foata normal form. 1570/102069 useless extension candidates. Maximal degree in co-relation 169493. Up to 76131 conditions per place. [2025-02-08 14:06:07,962 INFO L140 encePairwiseOnDemand]: 116/123 looper letters, 119 selfloop transitions, 8 changer transitions 0/181 dead transitions. [2025-02-08 14:06:07,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 181 transitions, 722 flow [2025-02-08 14:06:07,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:06:07,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:06:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 402 transitions. [2025-02-08 14:06:07,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6536585365853659 [2025-02-08 14:06:07,963 INFO L175 Difference]: Start difference. First operand has 116 places, 104 transitions, 252 flow. Second operand 5 states and 402 transitions. [2025-02-08 14:06:07,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 181 transitions, 722 flow [2025-02-08 14:06:07,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 181 transitions, 706 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:06:07,968 INFO L231 Difference]: Finished difference. Result has 121 places, 111 transitions, 305 flow [2025-02-08 14:06:07,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=305, PETRI_PLACES=121, PETRI_TRANSITIONS=111} [2025-02-08 14:06:07,969 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 11 predicate places. [2025-02-08 14:06:07,969 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 111 transitions, 305 flow [2025-02-08 14:06:07,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 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-02-08 14:06:07,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:07,969 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:06:07,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 14:06:07,969 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 14:06:07,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:07,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1792229367, now seen corresponding path program 1 times [2025-02-08 14:06:07,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:07,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544698930] [2025-02-08 14:06:07,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:07,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:07,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:06:07,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:06:07,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:07,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:06:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:06:08,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:06:08,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544698930] [2025-02-08 14:06:08,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544698930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:06:08,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:06:08,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:06:08,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430073133] [2025-02-08 14:06:08,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:06:08,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:06:08,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:06:08,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:06:08,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:06:08,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 123 [2025-02-08 14:06:08,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 111 transitions, 305 flow. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 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-02-08 14:06:08,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:06:08,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 123 [2025-02-08 14:06:08,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand