./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb010ae024b402436affeb854f96a5f9e0df3d8ec2cfe8b3a7f33676b7169a2c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:21:57,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:21:57,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:21:57,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:21:57,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:21:57,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:21:57,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:21:57,451 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:21:57,452 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:21:57,452 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:21:57,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:21:57,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:21:57,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:21:57,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:21:57,453 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:21:57,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:21:57,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:21:57,454 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:21:57,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:21:57,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:21:57,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:21:57,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:21:57,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:21:57,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:21:57,454 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:21:57,454 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:21:57,455 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:21:57,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:21:57,455 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:21:57,455 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:21:57,455 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:21:57,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:21:57,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:21:57,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:21:57,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:21:57,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:21:57,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:21:57,456 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:21:57,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:21:57,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:21:57,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:21:57,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:21:57,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:21:57,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:21:57,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:21:57,456 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb010ae024b402436affeb854f96a5f9e0df3d8ec2cfe8b3a7f33676b7169a2c [2025-03-04 15:21:57,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:21:57,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:21:57,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:21:57,688 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:21:57,689 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:21:57,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i [2025-03-04 15:21:58,822 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb83c510/cffca3dd2797491a8b97c46d91f6ea78/FLAG75ecbcddb [2025-03-04 15:21:59,051 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:21:59,052 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i [2025-03-04 15:21:59,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb83c510/cffca3dd2797491a8b97c46d91f6ea78/FLAG75ecbcddb [2025-03-04 15:21:59,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb83c510/cffca3dd2797491a8b97c46d91f6ea78 [2025-03-04 15:21:59,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:21:59,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:21:59,390 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:21:59,390 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:21:59,393 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:21:59,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:21:59" (1/1) ... [2025-03-04 15:21:59,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c7f14ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:59, skipping insertion in model container [2025-03-04 15:21:59,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:21:59" (1/1) ... [2025-03-04 15:21:59,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:21:59,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:21:59,686 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:21:59,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:21:59,751 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:21:59,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:59 WrapperNode [2025-03-04 15:21:59,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:21:59,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:21:59,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:21:59,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:21:59,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:59" (1/1) ... [2025-03-04 15:21:59,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:59" (1/1) ... [2025-03-04 15:21:59,777 INFO L138 Inliner]: procedures = 170, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-03-04 15:21:59,778 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:21:59,778 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:21:59,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:21:59,778 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:21:59,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:59" (1/1) ... [2025-03-04 15:21:59,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:59" (1/1) ... [2025-03-04 15:21:59,785 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:59" (1/1) ... [2025-03-04 15:21:59,800 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-03-04 15:21:59,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:59" (1/1) ... [2025-03-04 15:21:59,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:59" (1/1) ... [2025-03-04 15:21:59,808 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:59" (1/1) ... [2025-03-04 15:21:59,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:59" (1/1) ... [2025-03-04 15:21:59,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:59" (1/1) ... [2025-03-04 15:21:59,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:59" (1/1) ... [2025-03-04 15:21:59,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:21:59,816 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:21:59,816 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:21:59,816 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:21:59,817 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:59" (1/1) ... [2025-03-04 15:21:59,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:21:59,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:21:59,847 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:21:59,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:21:59,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:21:59,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:21:59,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:21:59,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:21:59,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:21:59,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:21:59,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:21:59,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:21:59,868 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:21:59,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:21:59,868 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:21:59,868 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:21:59,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:21:59,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:21:59,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:21:59,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:21:59,868 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:21:59,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:21:59,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:21:59,869 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:21:59,974 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:21:59,975 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:22:00,130 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:22:00,131 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:22:00,214 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:22:00,214 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:22:00,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:22:00 BoogieIcfgContainer [2025-03-04 15:22:00,214 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:22:00,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:22:00,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:22:00,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:22:00,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:21:59" (1/3) ... [2025-03-04 15:22:00,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4b81a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:22:00, skipping insertion in model container [2025-03-04 15:22:00,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:59" (2/3) ... [2025-03-04 15:22:00,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4b81a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:22:00, skipping insertion in model container [2025-03-04 15:22:00,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:22:00" (3/3) ... [2025-03-04 15:22:00,223 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_21-deref_read_racing.i [2025-03-04 15:22:00,233 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:22:00,235 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_21-deref_read_racing.i that has 2 procedures, 40 locations, 1 initial locations, 4 loop locations, and 6 error locations. [2025-03-04 15:22:00,235 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:22:00,274 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:22:00,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 48 transitions, 100 flow [2025-03-04 15:22:00,329 INFO L124 PetriNetUnfolderBase]: 10/58 cut-off events. [2025-03-04 15:22:00,333 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:00,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 58 events. 10/58 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 160 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2025-03-04 15:22:00,339 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 48 transitions, 100 flow [2025-03-04 15:22:00,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 48 transitions, 100 flow [2025-03-04 15:22:00,352 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:00,361 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;@60f7230, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:00,361 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-04 15:22:00,366 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:00,366 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-03-04 15:22:00,366 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:00,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:00,367 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:22:00,367 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-03-04 15:22:00,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:00,372 INFO L85 PathProgramCache]: Analyzing trace with hash 255236293, now seen corresponding path program 1 times [2025-03-04 15:22:00,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:00,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168970377] [2025-03-04 15:22:00,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:00,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:00,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:22:00,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:22:00,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:00,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:00,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:00,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168970377] [2025-03-04 15:22:00,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168970377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:00,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:00,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:00,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426987873] [2025-03-04 15:22:00,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:00,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:00,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:00,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:00,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:00,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2025-03-04 15:22:00,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 48 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:00,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:00,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2025-03-04 15:22:00,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:00,759 INFO L124 PetriNetUnfolderBase]: 88/260 cut-off events. [2025-03-04 15:22:00,760 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:00,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 260 events. 88/260 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1174 event pairs, 0 based on Foata normal form. 51/293 useless extension candidates. Maximal degree in co-relation 440. Up to 162 conditions per place. [2025-03-04 15:22:00,763 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 41 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2025-03-04 15:22:00,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 61 transitions, 214 flow [2025-03-04 15:22:00,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:00,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-03-04 15:22:00,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.703125 [2025-03-04 15:22:00,773 INFO L175 Difference]: Start difference. First operand has 43 places, 48 transitions, 100 flow. Second operand 4 states and 135 transitions. [2025-03-04 15:22:00,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 61 transitions, 214 flow [2025-03-04 15:22:00,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 61 transitions, 214 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:00,779 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 90 flow [2025-03-04 15:22:00,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2025-03-04 15:22:00,784 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2025-03-04 15:22:00,784 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 90 flow [2025-03-04 15:22:00,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:00,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:00,785 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:00,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:22:00,786 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-03-04 15:22:00,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:00,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1652487236, now seen corresponding path program 1 times [2025-03-04 15:22:00,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:00,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116973268] [2025-03-04 15:22:00,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:00,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:00,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:22:00,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:22:00,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:00,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:00,815 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:22:00,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:22:00,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:22:00,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:00,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:00,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:22:00,852 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:22:00,853 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-04 15:22:00,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2025-03-04 15:22:00,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2025-03-04 15:22:00,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2025-03-04 15:22:00,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2025-03-04 15:22:00,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2025-03-04 15:22:00,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2025-03-04 15:22:00,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2025-03-04 15:22:00,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2025-03-04 15:22:00,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2025-03-04 15:22:00,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2025-03-04 15:22:00,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:22:00,856 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 15:22:00,858 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:22:00,858 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:22:00,876 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:22:00,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 79 transitions, 168 flow [2025-03-04 15:22:00,900 INFO L124 PetriNetUnfolderBase]: 18/104 cut-off events. [2025-03-04 15:22:00,902 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:22:00,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 104 events. 18/104 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 352 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 75. Up to 6 conditions per place. [2025-03-04 15:22:00,903 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 79 transitions, 168 flow [2025-03-04 15:22:00,904 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 79 transitions, 168 flow [2025-03-04 15:22:00,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:00,906 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;@60f7230, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:00,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-04 15:22:00,909 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:00,910 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-03-04 15:22:00,910 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:00,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:00,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:22:00,911 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-03-04 15:22:00,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:00,912 INFO L85 PathProgramCache]: Analyzing trace with hash 330655218, now seen corresponding path program 1 times [2025-03-04 15:22:00,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:00,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455744472] [2025-03-04 15:22:00,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:00,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:00,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:22:00,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:22:00,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:00,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:00,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:00,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455744472] [2025-03-04 15:22:00,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455744472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:00,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:00,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:00,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527186507] [2025-03-04 15:22:00,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:00,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:00,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:00,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:00,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:00,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 79 [2025-03-04 15:22:00,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 79 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:00,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:00,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 79 [2025-03-04 15:22:00,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:01,615 INFO L124 PetriNetUnfolderBase]: 2860/6223 cut-off events. [2025-03-04 15:22:01,615 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-04 15:22:01,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10819 conditions, 6223 events. 2860/6223 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 50731 event pairs, 1320 based on Foata normal form. 987/6620 useless extension candidates. Maximal degree in co-relation 881. Up to 4518 conditions per place. [2025-03-04 15:22:01,669 INFO L140 encePairwiseOnDemand]: 59/79 looper letters, 57 selfloop transitions, 3 changer transitions 0/90 dead transitions. [2025-03-04 15:22:01,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 90 transitions, 310 flow [2025-03-04 15:22:01,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:01,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:01,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 209 transitions. [2025-03-04 15:22:01,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6613924050632911 [2025-03-04 15:22:01,671 INFO L175 Difference]: Start difference. First operand has 70 places, 79 transitions, 168 flow. Second operand 4 states and 209 transitions. [2025-03-04 15:22:01,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 90 transitions, 310 flow [2025-03-04 15:22:01,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 90 transitions, 310 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:01,673 INFO L231 Difference]: Finished difference. Result has 75 places, 67 transitions, 164 flow [2025-03-04 15:22:01,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2025-03-04 15:22:01,673 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 5 predicate places. [2025-03-04 15:22:01,675 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 164 flow [2025-03-04 15:22:01,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:01,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:01,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:01,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:22:01,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 15:22:01,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:01,676 INFO L85 PathProgramCache]: Analyzing trace with hash -759752983, now seen corresponding path program 1 times [2025-03-04 15:22:01,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:01,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349933224] [2025-03-04 15:22:01,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:01,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:01,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:22:01,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:22:01,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:01,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:01,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:01,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:01,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349933224] [2025-03-04 15:22:01,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349933224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:01,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:01,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:01,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487046795] [2025-03-04 15:22:01,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:01,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:01,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:01,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:01,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:01,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 79 [2025-03-04 15:22:01,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:01,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:01,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 79 [2025-03-04 15:22:01,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:02,252 INFO L124 PetriNetUnfolderBase]: 2393/5181 cut-off events. [2025-03-04 15:22:02,252 INFO L125 PetriNetUnfolderBase]: For 394/726 co-relation queries the response was YES. [2025-03-04 15:22:02,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9445 conditions, 5181 events. 2393/5181 cut-off events. For 394/726 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 40388 event pairs, 757 based on Foata normal form. 114/5007 useless extension candidates. Maximal degree in co-relation 9345. Up to 3353 conditions per place. [2025-03-04 15:22:02,286 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 74 selfloop transitions, 6 changer transitions 0/112 dead transitions. [2025-03-04 15:22:02,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 112 transitions, 442 flow [2025-03-04 15:22:02,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:22:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:22:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 236 transitions. [2025-03-04 15:22:02,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5974683544303797 [2025-03-04 15:22:02,290 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 164 flow. Second operand 5 states and 236 transitions. [2025-03-04 15:22:02,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 112 transitions, 442 flow [2025-03-04 15:22:02,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 112 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:22:02,292 INFO L231 Difference]: Finished difference. Result has 81 places, 72 transitions, 206 flow [2025-03-04 15:22:02,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=81, PETRI_TRANSITIONS=72} [2025-03-04 15:22:02,293 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 11 predicate places. [2025-03-04 15:22:02,293 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 72 transitions, 206 flow [2025-03-04 15:22:02,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:02,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:02,293 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:02,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:22:02,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 15:22:02,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:02,295 INFO L85 PathProgramCache]: Analyzing trace with hash -74101063, now seen corresponding path program 1 times [2025-03-04 15:22:02,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:02,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744385149] [2025-03-04 15:22:02,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:02,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:02,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:22:02,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:22:02,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:02,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:02,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:02,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744385149] [2025-03-04 15:22:02,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744385149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:02,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:02,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:22:02,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682663190] [2025-03-04 15:22:02,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:02,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:22:02,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:02,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:22:02,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:22:02,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 79 [2025-03-04 15:22:02,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 72 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:02,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:02,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 79 [2025-03-04 15:22:02,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:02,879 INFO L124 PetriNetUnfolderBase]: 2738/5487 cut-off events. [2025-03-04 15:22:02,880 INFO L125 PetriNetUnfolderBase]: For 1222/1222 co-relation queries the response was YES. [2025-03-04 15:22:02,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11297 conditions, 5487 events. 2738/5487 cut-off events. For 1222/1222 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 42012 event pairs, 407 based on Foata normal form. 152/5320 useless extension candidates. Maximal degree in co-relation 10465. Up to 2271 conditions per place. [2025-03-04 15:22:02,906 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 112 selfloop transitions, 6 changer transitions 0/148 dead transitions. [2025-03-04 15:22:02,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 148 transitions, 652 flow [2025-03-04 15:22:02,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:22:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:22:02,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 284 transitions. [2025-03-04 15:22:02,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5991561181434599 [2025-03-04 15:22:02,912 INFO L175 Difference]: Start difference. First operand has 81 places, 72 transitions, 206 flow. Second operand 6 states and 284 transitions. [2025-03-04 15:22:02,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 148 transitions, 652 flow [2025-03-04 15:22:02,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 148 transitions, 652 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:02,919 INFO L231 Difference]: Finished difference. Result has 85 places, 71 transitions, 214 flow [2025-03-04 15:22:02,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=85, PETRI_TRANSITIONS=71} [2025-03-04 15:22:02,921 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 15 predicate places. [2025-03-04 15:22:02,921 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 71 transitions, 214 flow [2025-03-04 15:22:02,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:02,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:02,922 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:22:02,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:22:02,922 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-03-04 15:22:02,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:02,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1997834618, now seen corresponding path program 1 times [2025-03-04 15:22:02,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:02,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969541613] [2025-03-04 15:22:02,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:02,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:02,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:22:02,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:22:02,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:02,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:02,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:02,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969541613] [2025-03-04 15:22:02,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969541613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:02,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:02,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:22:02,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380992375] [2025-03-04 15:22:02,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:02,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:02,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:02,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:02,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:02,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 79 [2025-03-04 15:22:02,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 71 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:02,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:02,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 79 [2025-03-04 15:22:02,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:03,344 INFO L124 PetriNetUnfolderBase]: 2459/4804 cut-off events. [2025-03-04 15:22:03,344 INFO L125 PetriNetUnfolderBase]: For 1732/1732 co-relation queries the response was YES. [2025-03-04 15:22:03,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10425 conditions, 4804 events. 2459/4804 cut-off events. For 1732/1732 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 35526 event pairs, 397 based on Foata normal form. 152/4892 useless extension candidates. Maximal degree in co-relation 9712. Up to 2725 conditions per place. [2025-03-04 15:22:03,361 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 89 selfloop transitions, 6 changer transitions 0/125 dead transitions. [2025-03-04 15:22:03,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 125 transitions, 556 flow [2025-03-04 15:22:03,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:03,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2025-03-04 15:22:03,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.629746835443038 [2025-03-04 15:22:03,362 INFO L175 Difference]: Start difference. First operand has 85 places, 71 transitions, 214 flow. Second operand 4 states and 199 transitions. [2025-03-04 15:22:03,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 125 transitions, 556 flow [2025-03-04 15:22:03,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 125 transitions, 540 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 15:22:03,374 INFO L231 Difference]: Finished difference. Result has 83 places, 71 transitions, 214 flow [2025-03-04 15:22:03,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=83, PETRI_TRANSITIONS=71} [2025-03-04 15:22:03,377 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 13 predicate places. [2025-03-04 15:22:03,377 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 71 transitions, 214 flow [2025-03-04 15:22:03,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:03,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:03,377 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 15:22:03,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:22:03,379 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-03-04 15:22:03,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:03,379 INFO L85 PathProgramCache]: Analyzing trace with hash 68697181, now seen corresponding path program 1 times [2025-03-04 15:22:03,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:03,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370720314] [2025-03-04 15:22:03,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:03,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:03,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:22:03,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:22:03,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:03,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:03,390 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:22:03,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:22:03,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:22:03,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:03,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:03,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:22:03,407 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:22:03,407 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-03-04 15:22:03,407 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 15 remaining) [2025-03-04 15:22:03,407 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 15 remaining) [2025-03-04 15:22:03,407 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 15 remaining) [2025-03-04 15:22:03,407 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 15 remaining) [2025-03-04 15:22:03,407 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 15 remaining) [2025-03-04 15:22:03,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 15 remaining) [2025-03-04 15:22:03,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 15 remaining) [2025-03-04 15:22:03,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 15 remaining) [2025-03-04 15:22:03,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 15 remaining) [2025-03-04 15:22:03,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 15 remaining) [2025-03-04 15:22:03,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 15 remaining) [2025-03-04 15:22:03,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 15 remaining) [2025-03-04 15:22:03,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 15 remaining) [2025-03-04 15:22:03,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 15 remaining) [2025-03-04 15:22:03,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:22:03,408 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 15:22:03,409 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:22:03,409 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 15:22:03,429 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:22:03,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 110 transitions, 238 flow [2025-03-04 15:22:03,441 INFO L124 PetriNetUnfolderBase]: 26/150 cut-off events. [2025-03-04 15:22:03,441 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 15:22:03,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 26/150 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 533 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 115. Up to 8 conditions per place. [2025-03-04 15:22:03,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 110 transitions, 238 flow [2025-03-04 15:22:03,443 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 110 transitions, 238 flow [2025-03-04 15:22:03,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:03,444 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;@60f7230, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:03,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-04 15:22:03,446 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:03,446 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-03-04 15:22:03,446 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:03,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:03,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:22:03,446 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-03-04 15:22:03,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:03,446 INFO L85 PathProgramCache]: Analyzing trace with hash 435657598, now seen corresponding path program 1 times [2025-03-04 15:22:03,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:03,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720243372] [2025-03-04 15:22:03,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:03,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:03,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:22:03,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:22:03,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:03,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:03,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:03,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:03,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720243372] [2025-03-04 15:22:03,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720243372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:03,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:03,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:03,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916178451] [2025-03-04 15:22:03,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:03,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:03,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:03,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:03,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:03,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 110 [2025-03-04 15:22:03,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 110 transitions, 238 flow. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:03,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:03,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 110 [2025-03-04 15:22:03,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:08,679 INFO L124 PetriNetUnfolderBase]: 53548/96979 cut-off events. [2025-03-04 15:22:08,679 INFO L125 PetriNetUnfolderBase]: For 1092/1092 co-relation queries the response was YES. [2025-03-04 15:22:08,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171848 conditions, 96979 events. 53548/96979 cut-off events. For 1092/1092 co-relation queries the response was YES. Maximal size of possible extension queue 2408. Compared 983713 event pairs, 34584 based on Foata normal form. 16575/105248 useless extension candidates. Maximal degree in co-relation 11324. Up to 74214 conditions per place. [2025-03-04 15:22:09,260 INFO L140 encePairwiseOnDemand]: 84/110 looper letters, 69 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2025-03-04 15:22:09,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 115 transitions, 392 flow [2025-03-04 15:22:09,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:09,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:09,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 279 transitions. [2025-03-04 15:22:09,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.634090909090909 [2025-03-04 15:22:09,263 INFO L175 Difference]: Start difference. First operand has 97 places, 110 transitions, 238 flow. Second operand 4 states and 279 transitions. [2025-03-04 15:22:09,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 115 transitions, 392 flow [2025-03-04 15:22:09,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 115 transitions, 390 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:09,267 INFO L231 Difference]: Finished difference. Result has 102 places, 92 transitions, 220 flow [2025-03-04 15:22:09,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=102, PETRI_TRANSITIONS=92} [2025-03-04 15:22:09,269 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 5 predicate places. [2025-03-04 15:22:09,269 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 92 transitions, 220 flow [2025-03-04 15:22:09,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:09,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:09,269 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:09,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:22:09,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:22:09,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:09,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1150011509, now seen corresponding path program 1 times [2025-03-04 15:22:09,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:09,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259651613] [2025-03-04 15:22:09,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:09,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:09,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:22:09,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:22:09,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:09,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:09,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:09,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:09,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259651613] [2025-03-04 15:22:09,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259651613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:09,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:09,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:09,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530817505] [2025-03-04 15:22:09,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:09,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:09,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:09,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:09,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:09,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 110 [2025-03-04 15:22:09,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 92 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:09,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:09,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 110 [2025-03-04 15:22:09,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:13,772 INFO L124 PetriNetUnfolderBase]: 47105/82401 cut-off events. [2025-03-04 15:22:13,772 INFO L125 PetriNetUnfolderBase]: For 5131/9649 co-relation queries the response was YES. [2025-03-04 15:22:13,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153029 conditions, 82401 events. 47105/82401 cut-off events. For 5131/9649 co-relation queries the response was YES. Maximal size of possible extension queue 2163. Compared 788134 event pairs, 18833 based on Foata normal form. 1266/79592 useless extension candidates. Maximal degree in co-relation 152928. Up to 60521 conditions per place. [2025-03-04 15:22:14,198 INFO L140 encePairwiseOnDemand]: 103/110 looper letters, 110 selfloop transitions, 8 changer transitions 0/163 dead transitions. [2025-03-04 15:22:14,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 163 transitions, 641 flow [2025-03-04 15:22:14,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:22:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:22:14,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 339 transitions. [2025-03-04 15:22:14,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6163636363636363 [2025-03-04 15:22:14,200 INFO L175 Difference]: Start difference. First operand has 102 places, 92 transitions, 220 flow. Second operand 5 states and 339 transitions. [2025-03-04 15:22:14,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 163 transitions, 641 flow [2025-03-04 15:22:14,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 163 transitions, 637 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:22:14,206 INFO L231 Difference]: Finished difference. Result has 108 places, 99 transitions, 279 flow [2025-03-04 15:22:14,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=279, PETRI_PLACES=108, PETRI_TRANSITIONS=99} [2025-03-04 15:22:14,207 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 11 predicate places. [2025-03-04 15:22:14,207 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 99 transitions, 279 flow [2025-03-04 15:22:14,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:14,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:14,207 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:14,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:22:14,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:22:14,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:14,208 INFO L85 PathProgramCache]: Analyzing trace with hash -191568327, now seen corresponding path program 1 times [2025-03-04 15:22:14,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:14,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424290491] [2025-03-04 15:22:14,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:14,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:14,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:22:14,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:22:14,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:14,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:14,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:14,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424290491] [2025-03-04 15:22:14,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424290491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:14,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:14,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:22:14,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340505148] [2025-03-04 15:22:14,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:14,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:22:14,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:14,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:22:14,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:22:14,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 110 [2025-03-04 15:22:14,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 99 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 44.5) internal successors, (267), 6 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:14,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:14,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 110 [2025-03-04 15:22:14,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:19,645 INFO L124 PetriNetUnfolderBase]: 54490/91808 cut-off events. [2025-03-04 15:22:19,645 INFO L125 PetriNetUnfolderBase]: For 23298/23298 co-relation queries the response was YES. [2025-03-04 15:22:19,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190393 conditions, 91808 events. 54490/91808 cut-off events. For 23298/23298 co-relation queries the response was YES. Maximal size of possible extension queue 2326. Compared 870675 event pairs, 9783 based on Foata normal form. 2120/88676 useless extension candidates. Maximal degree in co-relation 165695. Up to 39025 conditions per place. [2025-03-04 15:22:20,134 INFO L140 encePairwiseOnDemand]: 105/110 looper letters, 152 selfloop transitions, 6 changer transitions 0/201 dead transitions. [2025-03-04 15:22:20,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 201 transitions, 883 flow [2025-03-04 15:22:20,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:22:20,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:22:20,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 396 transitions. [2025-03-04 15:22:20,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 15:22:20,135 INFO L175 Difference]: Start difference. First operand has 108 places, 99 transitions, 279 flow. Second operand 6 states and 396 transitions. [2025-03-04 15:22:20,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 201 transitions, 883 flow [2025-03-04 15:22:20,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 201 transitions, 883 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:20,151 INFO L231 Difference]: Finished difference. Result has 112 places, 98 transitions, 287 flow [2025-03-04 15:22:20,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=287, PETRI_PLACES=112, PETRI_TRANSITIONS=98} [2025-03-04 15:22:20,151 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 15 predicate places. [2025-03-04 15:22:20,151 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 98 transitions, 287 flow [2025-03-04 15:22:20,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.5) internal successors, (267), 6 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:20,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:20,152 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:22:20,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:22:20,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:22:20,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:20,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1643650456, now seen corresponding path program 1 times [2025-03-04 15:22:20,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:20,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454292767] [2025-03-04 15:22:20,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:20,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:20,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:22:20,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:22:20,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:20,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:20,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:20,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454292767] [2025-03-04 15:22:20,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454292767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:20,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:20,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:22:20,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179012486] [2025-03-04 15:22:20,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:20,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:20,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:20,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:20,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:20,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 110 [2025-03-04 15:22:20,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 98 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:20,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:20,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 110 [2025-03-04 15:22:20,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:25,253 INFO L124 PetriNetUnfolderBase]: 48891/80004 cut-off events. [2025-03-04 15:22:25,254 INFO L125 PetriNetUnfolderBase]: For 28867/28867 co-relation queries the response was YES. [2025-03-04 15:22:25,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173718 conditions, 80004 events. 48891/80004 cut-off events. For 28867/28867 co-relation queries the response was YES. Maximal size of possible extension queue 2034. Compared 719290 event pairs, 7166 based on Foata normal form. 2120/80282 useless extension candidates. Maximal degree in co-relation 154022. Up to 46821 conditions per place. [2025-03-04 15:22:25,810 INFO L140 encePairwiseOnDemand]: 105/110 looper letters, 129 selfloop transitions, 6 changer transitions 0/178 dead transitions. [2025-03-04 15:22:25,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 178 transitions, 787 flow [2025-03-04 15:22:25,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:25,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:25,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 285 transitions. [2025-03-04 15:22:25,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6477272727272727 [2025-03-04 15:22:25,813 INFO L175 Difference]: Start difference. First operand has 112 places, 98 transitions, 287 flow. Second operand 4 states and 285 transitions. [2025-03-04 15:22:25,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 178 transitions, 787 flow [2025-03-04 15:22:25,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 178 transitions, 771 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 15:22:25,871 INFO L231 Difference]: Finished difference. Result has 110 places, 98 transitions, 287 flow [2025-03-04 15:22:25,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=287, PETRI_PLACES=110, PETRI_TRANSITIONS=98} [2025-03-04 15:22:25,872 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 13 predicate places. [2025-03-04 15:22:25,873 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 98 transitions, 287 flow [2025-03-04 15:22:25,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:25,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:25,873 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:25,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:22:25,873 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-03-04 15:22:25,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:25,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1005766448, now seen corresponding path program 1 times [2025-03-04 15:22:25,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:25,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961201053] [2025-03-04 15:22:25,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:25,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:25,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:22:25,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:22:25,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:25,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:25,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:25,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:25,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961201053] [2025-03-04 15:22:25,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961201053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:25,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:25,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:25,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425941326] [2025-03-04 15:22:25,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:25,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:25,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:25,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:25,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:25,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 110 [2025-03-04 15:22:25,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 98 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:25,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:25,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 110 [2025-03-04 15:22:25,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:31,449 INFO L124 PetriNetUnfolderBase]: 52573/92580 cut-off events. [2025-03-04 15:22:31,449 INFO L125 PetriNetUnfolderBase]: For 37149/37165 co-relation queries the response was YES. [2025-03-04 15:22:31,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191866 conditions, 92580 events. 52573/92580 cut-off events. For 37149/37165 co-relation queries the response was YES. Maximal size of possible extension queue 2499. Compared 908176 event pairs, 21609 based on Foata normal form. 2624/91797 useless extension candidates. Maximal degree in co-relation 167720. Up to 68005 conditions per place. [2025-03-04 15:22:31,988 INFO L140 encePairwiseOnDemand]: 103/110 looper letters, 111 selfloop transitions, 11 changer transitions 0/165 dead transitions. [2025-03-04 15:22:31,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 165 transitions, 746 flow [2025-03-04 15:22:31,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:22:31,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:22:31,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 338 transitions. [2025-03-04 15:22:31,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6145454545454545 [2025-03-04 15:22:31,989 INFO L175 Difference]: Start difference. First operand has 110 places, 98 transitions, 287 flow. Second operand 5 states and 338 transitions. [2025-03-04 15:22:31,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 165 transitions, 746 flow [2025-03-04 15:22:32,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 165 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:22:32,013 INFO L231 Difference]: Finished difference. Result has 115 places, 103 transitions, 352 flow [2025-03-04 15:22:32,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=352, PETRI_PLACES=115, PETRI_TRANSITIONS=103} [2025-03-04 15:22:32,014 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 18 predicate places. [2025-03-04 15:22:32,014 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 103 transitions, 352 flow [2025-03-04 15:22:32,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:32,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:32,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:32,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:22:32,015 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:22:32,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:32,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1250389332, now seen corresponding path program 1 times [2025-03-04 15:22:32,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:32,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014814423] [2025-03-04 15:22:32,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:32,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:32,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:22:32,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:22:32,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:32,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:32,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:32,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014814423] [2025-03-04 15:22:32,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014814423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:32,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:32,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:22:32,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851962443] [2025-03-04 15:22:32,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:32,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:22:32,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:32,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:22:32,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:22:32,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 110 [2025-03-04 15:22:32,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 103 transitions, 352 flow. Second operand has 6 states, 6 states have (on average 43.833333333333336) internal successors, (263), 6 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:32,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:32,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 110 [2025-03-04 15:22:32,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand