./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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_61-invariant_racing.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 b4399e58ed3ca9c75e2a61372e91a4308548a0e79a3eb4428d85990bd71242f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:45:51,640 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:45:51,694 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:45:51,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:45:51,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:45:51,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:45:51,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:45:51,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:45:51,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:45:51,727 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:45:51,727 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:45:51,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:45:51,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:45:51,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:45:51,728 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:45:51,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:45:51,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:45:51,729 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:45:51,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:45:51,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:45:51,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:45:51,729 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:45:51,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:45:51,729 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:45:51,729 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:45:51,729 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:45:51,729 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:45:51,729 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:45:51,729 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:45:51,729 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:45:51,730 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:45:51,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:45:51,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:45:51,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:45:51,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:45:51,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:45:51,730 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:45:51,730 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:45:51,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:45:51,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:45:51,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:45:51,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:45:51,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:45:51,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:45:51,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:45:51,731 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 -> b4399e58ed3ca9c75e2a61372e91a4308548a0e79a3eb4428d85990bd71242f7 [2025-02-06 18:45:51,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:45:51,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:45:51,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:45:51,969 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:45:51,969 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:45:51,971 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_61-invariant_racing.i [2025-02-06 18:45:53,103 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/460332db9/7202fc138b3342978da250a96d23a6dd/FLAGdefd6bbc6 [2025-02-06 18:45:53,334 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:45:53,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i [2025-02-06 18:45:53,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/460332db9/7202fc138b3342978da250a96d23a6dd/FLAGdefd6bbc6 [2025-02-06 18:45:53,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/460332db9/7202fc138b3342978da250a96d23a6dd [2025-02-06 18:45:53,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:45:53,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:45:53,359 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:45:53,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:45:53,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:45:53,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:45:53" (1/1) ... [2025-02-06 18:45:53,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@571d993d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:53, skipping insertion in model container [2025-02-06 18:45:53,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:45:53" (1/1) ... [2025-02-06 18:45:53,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:45:53,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:45:53,620 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:45:53,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:45:53,676 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:45:53,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:53 WrapperNode [2025-02-06 18:45:53,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:45:53,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:45:53,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:45:53,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:45:53,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:53" (1/1) ... [2025-02-06 18:45:53,688 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:53" (1/1) ... [2025-02-06 18:45:53,700 INFO L138 Inliner]: procedures = 171, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2025-02-06 18:45:53,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:45:53,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:45:53,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:45:53,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:45:53,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:53" (1/1) ... [2025-02-06 18:45:53,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:53" (1/1) ... [2025-02-06 18:45:53,711 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:53" (1/1) ... [2025-02-06 18:45:53,726 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2025-02-06 18:45:53,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:53" (1/1) ... [2025-02-06 18:45:53,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:53" (1/1) ... [2025-02-06 18:45:53,730 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:53" (1/1) ... [2025-02-06 18:45:53,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:53" (1/1) ... [2025-02-06 18:45:53,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:53" (1/1) ... [2025-02-06 18:45:53,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:53" (1/1) ... [2025-02-06 18:45:53,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:45:53,738 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:45:53,738 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:45:53,738 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:45:53,738 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:53" (1/1) ... [2025-02-06 18:45:53,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:45:53,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:45:53,762 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-06 18:45:53,764 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-06 18:45:53,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:45:53,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:45:53,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 18:45:53,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 18:45:53,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:45:53,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:45:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 18:45:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 18:45:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 18:45:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:45:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:45:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 18:45:53,780 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 18:45:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:45:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:45:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:45:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 18:45:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 18:45:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 18:45:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:45:53,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:45:53,781 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 18:45:53,867 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:45:53,868 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:45:54,033 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 18:45:54,033 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L713-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 18:45:54,074 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:45:54,074 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:45:54,176 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:45:54,177 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:45:54,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:45:54 BoogieIcfgContainer [2025-02-06 18:45:54,178 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:45:54,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:45:54,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:45:54,183 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:45:54,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:45:53" (1/3) ... [2025-02-06 18:45:54,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789f98e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:45:54, skipping insertion in model container [2025-02-06 18:45:54,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:53" (2/3) ... [2025-02-06 18:45:54,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789f98e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:45:54, skipping insertion in model container [2025-02-06 18:45:54,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:45:54" (3/3) ... [2025-02-06 18:45:54,186 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_61-invariant_racing.i [2025-02-06 18:45:54,198 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:45:54,200 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_61-invariant_racing.i that has 2 procedures, 86 locations, 1 initial locations, 9 loop locations, and 12 error locations. [2025-02-06 18:45:54,200 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:45:54,244 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 18:45:54,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 102 transitions, 211 flow [2025-02-06 18:45:54,343 INFO L124 PetriNetUnfolderBase]: 24/146 cut-off events. [2025-02-06 18:45:54,347 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:45:54,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 146 events. 24/146 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 548 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 93. Up to 6 conditions per place. [2025-02-06 18:45:54,351 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 102 transitions, 211 flow [2025-02-06 18:45:54,354 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 101 transitions, 209 flow [2025-02-06 18:45:54,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:45:54,368 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;@64065006, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:45:54,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-02-06 18:45:54,373 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:45:54,374 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-02-06 18:45:54,374 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:45:54,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:54,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:45:54,375 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 18:45:54,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:54,381 INFO L85 PathProgramCache]: Analyzing trace with hash 389430477, now seen corresponding path program 1 times [2025-02-06 18:45:54,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:54,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794489230] [2025-02-06 18:45:54,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:54,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:54,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:45:54,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:45:54,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:54,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:54,590 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-06 18:45:54,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:54,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794489230] [2025-02-06 18:45:54,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794489230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:54,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:54,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:45:54,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538794947] [2025-02-06 18:45:54,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:54,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:54,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:54,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:54,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:54,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 102 [2025-02-06 18:45:54,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 101 transitions, 209 flow. Second operand has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:54,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:54,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 102 [2025-02-06 18:45:54,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:54,893 INFO L124 PetriNetUnfolderBase]: 302/993 cut-off events. [2025-02-06 18:45:54,894 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:45:54,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1638 conditions, 993 events. 302/993 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 6227 event pairs, 0 based on Foata normal form. 270/1188 useless extension candidates. Maximal degree in co-relation 1604. Up to 591 conditions per place. [2025-02-06 18:45:54,904 INFO L140 encePairwiseOnDemand]: 82/102 looper letters, 66 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2025-02-06 18:45:54,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 116 transitions, 377 flow [2025-02-06 18:45:54,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:45:54,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:45:54,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 286 transitions. [2025-02-06 18:45:54,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7009803921568627 [2025-02-06 18:45:54,916 INFO L175 Difference]: Start difference. First operand has 89 places, 101 transitions, 209 flow. Second operand 4 states and 286 transitions. [2025-02-06 18:45:54,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 116 transitions, 377 flow [2025-02-06 18:45:54,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 116 transitions, 377 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:45:54,923 INFO L231 Difference]: Finished difference. Result has 91 places, 85 transitions, 187 flow [2025-02-06 18:45:54,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=91, PETRI_TRANSITIONS=85} [2025-02-06 18:45:54,928 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 2 predicate places. [2025-02-06 18:45:54,928 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 85 transitions, 187 flow [2025-02-06 18:45:54,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:54,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:54,929 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:54,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:45:54,929 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 18:45:54,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:54,930 INFO L85 PathProgramCache]: Analyzing trace with hash 817030022, now seen corresponding path program 1 times [2025-02-06 18:45:54,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:54,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586519216] [2025-02-06 18:45:54,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:54,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:54,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:45:54,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:45:54,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:54,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:45:54,962 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:45:54,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:45:54,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:45:54,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:54,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:45:54,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:45:54,999 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:45:55,000 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-02-06 18:45:55,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-02-06 18:45:55,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-02-06 18:45:55,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-02-06 18:45:55,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-02-06 18:45:55,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-02-06 18:45:55,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-02-06 18:45:55,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-02-06 18:45:55,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-02-06 18:45:55,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-02-06 18:45:55,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-02-06 18:45:55,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-02-06 18:45:55,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-02-06 18:45:55,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-02-06 18:45:55,003 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-02-06 18:45:55,003 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-02-06 18:45:55,003 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-02-06 18:45:55,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 18:45:55,003 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 18:45:55,005 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:45:55,005 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 18:45:55,046 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 18:45:55,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 148 transitions, 312 flow [2025-02-06 18:45:55,064 INFO L124 PetriNetUnfolderBase]: 41/255 cut-off events. [2025-02-06 18:45:55,064 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 18:45:55,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 255 events. 41/255 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1196 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 154. Up to 9 conditions per place. [2025-02-06 18:45:55,066 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 148 transitions, 312 flow [2025-02-06 18:45:55,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 148 transitions, 312 flow [2025-02-06 18:45:55,069 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:45:55,069 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;@64065006, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:45:55,069 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-02-06 18:45:55,071 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:45:55,071 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-02-06 18:45:55,071 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:45:55,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:55,071 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:45:55,071 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-06 18:45:55,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:55,072 INFO L85 PathProgramCache]: Analyzing trace with hash 530709901, now seen corresponding path program 1 times [2025-02-06 18:45:55,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:55,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646136076] [2025-02-06 18:45:55,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:55,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:55,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:45:55,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:45:55,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:55,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:55,153 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-06 18:45:55,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:55,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646136076] [2025-02-06 18:45:55,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646136076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:55,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:55,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:45:55,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051086457] [2025-02-06 18:45:55,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:55,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:55,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:55,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:55,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:55,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 148 [2025-02-06 18:45:55,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 148 transitions, 312 flow. Second operand has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 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-06 18:45:55,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:55,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 148 [2025-02-06 18:45:55,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:57,238 INFO L124 PetriNetUnfolderBase]: 11954/26271 cut-off events. [2025-02-06 18:45:57,239 INFO L125 PetriNetUnfolderBase]: For 145/145 co-relation queries the response was YES. [2025-02-06 18:45:57,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44611 conditions, 26271 events. 11954/26271 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 261544 event pairs, 10371 based on Foata normal form. 6543/30508 useless extension candidates. Maximal degree in co-relation 21648. Up to 18204 conditions per place. [2025-02-06 18:45:57,383 INFO L140 encePairwiseOnDemand]: 122/148 looper letters, 88 selfloop transitions, 3 changer transitions 0/161 dead transitions. [2025-02-06 18:45:57,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 161 transitions, 520 flow [2025-02-06 18:45:57,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:45:57,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:45:57,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2025-02-06 18:45:57,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6858108108108109 [2025-02-06 18:45:57,389 INFO L175 Difference]: Start difference. First operand has 129 places, 148 transitions, 312 flow. Second operand 4 states and 406 transitions. [2025-02-06 18:45:57,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 161 transitions, 520 flow [2025-02-06 18:45:57,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 161 transitions, 520 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:45:57,393 INFO L231 Difference]: Finished difference. Result has 134 places, 130 transitions, 296 flow [2025-02-06 18:45:57,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=296, PETRI_PLACES=134, PETRI_TRANSITIONS=130} [2025-02-06 18:45:57,393 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 5 predicate places. [2025-02-06 18:45:57,394 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 130 transitions, 296 flow [2025-02-06 18:45:57,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 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-06 18:45:57,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:57,394 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:57,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:45:57,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-06 18:45:57,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:57,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1149420846, now seen corresponding path program 1 times [2025-02-06 18:45:57,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:57,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453881291] [2025-02-06 18:45:57,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:57,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:57,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:45:57,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:45:57,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:57,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:57,480 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-06 18:45:57,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:57,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453881291] [2025-02-06 18:45:57,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453881291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:57,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:57,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:45:57,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745159012] [2025-02-06 18:45:57,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:57,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:45:57,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:57,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:45:57,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:45:57,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 148 [2025-02-06 18:45:57,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 130 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 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-06 18:45:57,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:57,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 148 [2025-02-06 18:45:57,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:59,284 INFO L124 PetriNetUnfolderBase]: 11084/24075 cut-off events. [2025-02-06 18:45:59,284 INFO L125 PetriNetUnfolderBase]: For 1104/1104 co-relation queries the response was YES. [2025-02-06 18:45:59,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42327 conditions, 24075 events. 11084/24075 cut-off events. For 1104/1104 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 235237 event pairs, 1556 based on Foata normal form. 256/22842 useless extension candidates. Maximal degree in co-relation 10561. Up to 13506 conditions per place. [2025-02-06 18:45:59,408 INFO L140 encePairwiseOnDemand]: 143/148 looper letters, 144 selfloop transitions, 6 changer transitions 0/220 dead transitions. [2025-02-06 18:45:59,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 220 transitions, 774 flow [2025-02-06 18:45:59,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:45:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:45:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 571 transitions. [2025-02-06 18:45:59,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6430180180180181 [2025-02-06 18:45:59,414 INFO L175 Difference]: Start difference. First operand has 134 places, 130 transitions, 296 flow. Second operand 6 states and 571 transitions. [2025-02-06 18:45:59,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 220 transitions, 774 flow [2025-02-06 18:45:59,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 220 transitions, 772 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:45:59,420 INFO L231 Difference]: Finished difference. Result has 137 places, 129 transitions, 302 flow [2025-02-06 18:45:59,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=137, PETRI_TRANSITIONS=129} [2025-02-06 18:45:59,422 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 8 predicate places. [2025-02-06 18:45:59,423 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 129 transitions, 302 flow [2025-02-06 18:45:59,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 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-06 18:45:59,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:59,424 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 18:45:59,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:45:59,424 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-06 18:45:59,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:59,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1272308364, now seen corresponding path program 1 times [2025-02-06 18:45:59,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:59,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766610808] [2025-02-06 18:45:59,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:59,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:59,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:45:59,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:45:59,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:59,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:59,482 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-06 18:45:59,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:59,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766610808] [2025-02-06 18:45:59,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766610808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:59,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:59,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:45:59,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950864702] [2025-02-06 18:45:59,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:59,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:59,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:59,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:59,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:59,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 148 [2025-02-06 18:45:59,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 129 transitions, 302 flow. Second operand has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 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-06 18:45:59,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:59,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 148 [2025-02-06 18:45:59,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:46:00,830 INFO L124 PetriNetUnfolderBase]: 10736/22651 cut-off events. [2025-02-06 18:46:00,830 INFO L125 PetriNetUnfolderBase]: For 2060/2060 co-relation queries the response was YES. [2025-02-06 18:46:00,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40916 conditions, 22651 events. 10736/22651 cut-off events. For 2060/2060 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 216849 event pairs, 735 based on Foata normal form. 256/21910 useless extension candidates. Maximal degree in co-relation 19551. Up to 14398 conditions per place. [2025-02-06 18:46:00,934 INFO L140 encePairwiseOnDemand]: 143/148 looper letters, 113 selfloop transitions, 6 changer transitions 0/189 dead transitions. [2025-02-06 18:46:00,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 189 transitions, 658 flow [2025-02-06 18:46:00,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:46:00,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:46:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2025-02-06 18:46:00,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6722972972972973 [2025-02-06 18:46:00,936 INFO L175 Difference]: Start difference. First operand has 137 places, 129 transitions, 302 flow. Second operand 4 states and 398 transitions. [2025-02-06 18:46:00,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 189 transitions, 658 flow [2025-02-06 18:46:00,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 189 transitions, 642 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-06 18:46:00,945 INFO L231 Difference]: Finished difference. Result has 135 places, 129 transitions, 302 flow [2025-02-06 18:46:00,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=135, PETRI_TRANSITIONS=129} [2025-02-06 18:46:00,946 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 6 predicate places. [2025-02-06 18:46:00,946 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 129 transitions, 302 flow [2025-02-06 18:46:00,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 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-06 18:46:00,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:46:00,947 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:46:00,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:46:00,947 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-06 18:46:00,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:46:00,948 INFO L85 PathProgramCache]: Analyzing trace with hash 648269240, now seen corresponding path program 1 times [2025-02-06 18:46:00,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:46:00,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128005671] [2025-02-06 18:46:00,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:46:00,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:46:00,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:46:00,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:46:00,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:46:00,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:46:01,025 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-06 18:46:01,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:46:01,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128005671] [2025-02-06 18:46:01,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128005671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:46:01,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:46:01,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:46:01,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351671240] [2025-02-06 18:46:01,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:46:01,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:46:01,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:46:01,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:46:01,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:46:01,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 148 [2025-02-06 18:46:01,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 129 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 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-06 18:46:01,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:46:01,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 148 [2025-02-06 18:46:01,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:46:02,350 INFO L124 PetriNetUnfolderBase]: 10690/22122 cut-off events. [2025-02-06 18:46:02,351 INFO L125 PetriNetUnfolderBase]: For 2774/2774 co-relation queries the response was YES. [2025-02-06 18:46:02,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40099 conditions, 22122 events. 10690/22122 cut-off events. For 2774/2774 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 207232 event pairs, 670 based on Foata normal form. 16/20988 useless extension candidates. Maximal degree in co-relation 19556. Up to 14854 conditions per place. [2025-02-06 18:46:02,437 INFO L140 encePairwiseOnDemand]: 144/148 looper letters, 116 selfloop transitions, 4 changer transitions 0/190 dead transitions. [2025-02-06 18:46:02,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 190 transitions, 667 flow [2025-02-06 18:46:02,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:46:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:46:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2025-02-06 18:46:02,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6364864864864865 [2025-02-06 18:46:02,438 INFO L175 Difference]: Start difference. First operand has 135 places, 129 transitions, 302 flow. Second operand 5 states and 471 transitions. [2025-02-06 18:46:02,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 190 transitions, 667 flow [2025-02-06 18:46:02,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 190 transitions, 658 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:46:02,443 INFO L231 Difference]: Finished difference. Result has 138 places, 129 transitions, 306 flow [2025-02-06 18:46:02,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=306, PETRI_PLACES=138, PETRI_TRANSITIONS=129} [2025-02-06 18:46:02,443 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 9 predicate places. [2025-02-06 18:46:02,444 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 129 transitions, 306 flow [2025-02-06 18:46:02,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 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-06 18:46:02,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:46:02,444 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-02-06 18:46:02,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:46:02,444 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-06 18:46:02,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:46:02,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1377324603, now seen corresponding path program 1 times [2025-02-06 18:46:02,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:46:02,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798905325] [2025-02-06 18:46:02,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:46:02,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:46:02,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:46:02,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:46:02,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:46:02,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:46:02,456 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:46:02,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:46:02,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:46:02,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:46:02,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:46:02,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:46:02,466 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:46:02,466 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2025-02-06 18:46:02,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2025-02-06 18:46:02,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2025-02-06 18:46:02,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2025-02-06 18:46:02,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2025-02-06 18:46:02,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2025-02-06 18:46:02,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2025-02-06 18:46:02,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2025-02-06 18:46:02,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2025-02-06 18:46:02,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2025-02-06 18:46:02,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2025-02-06 18:46:02,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2025-02-06 18:46:02,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2025-02-06 18:46:02,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2025-02-06 18:46:02,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2025-02-06 18:46:02,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2025-02-06 18:46:02,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2025-02-06 18:46:02,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2025-02-06 18:46:02,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2025-02-06 18:46:02,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2025-02-06 18:46:02,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2025-02-06 18:46:02,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:46:02,468 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 18:46:02,469 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:46:02,469 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 18:46:02,488 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 18:46:02,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 194 transitions, 415 flow [2025-02-06 18:46:02,509 INFO L124 PetriNetUnfolderBase]: 61/383 cut-off events. [2025-02-06 18:46:02,509 INFO L125 PetriNetUnfolderBase]: For 19/22 co-relation queries the response was YES. [2025-02-06 18:46:02,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 383 events. 61/383 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1950 event pairs, 1 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 270. Up to 12 conditions per place. [2025-02-06 18:46:02,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 194 transitions, 415 flow [2025-02-06 18:46:02,514 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 194 transitions, 415 flow [2025-02-06 18:46:02,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:46:02,516 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;@64065006, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:46:02,516 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-02-06 18:46:02,517 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:46:02,517 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-02-06 18:46:02,517 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:46:02,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:46:02,517 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:46:02,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-02-06 18:46:02,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:46:02,517 INFO L85 PathProgramCache]: Analyzing trace with hash 715887355, now seen corresponding path program 1 times [2025-02-06 18:46:02,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:46:02,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136219423] [2025-02-06 18:46:02,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:46:02,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:46:02,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:46:02,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:46:02,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:46:02,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:46:02,544 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-06 18:46:02,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:46:02,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136219423] [2025-02-06 18:46:02,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136219423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:46:02,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:46:02,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:46:02,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117951224] [2025-02-06 18:46:02,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:46:02,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:46:02,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:46:02,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:46:02,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:46:02,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 194 [2025-02-06 18:46:02,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 194 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 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-06 18:46:02,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:46:02,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 194 [2025-02-06 18:46:02,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand