./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb010ae024b402436affeb854f96a5f9e0df3d8ec2cfe8b3a7f33676b7169a2c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:45:10,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:45:10,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:45:10,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:45:10,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:45:10,443 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:45:10,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:45:10,444 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:45:10,444 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:45:10,444 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:45:10,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:45:10,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:45:10,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:45:10,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:45:10,446 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:45:10,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:45:10,446 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:45:10,446 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:45:10,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:45:10,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:45:10,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:45:10,447 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:45:10,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:45:10,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:45:10,447 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:45:10,447 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:45:10,447 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:45:10,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:45:10,447 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:45:10,447 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:45:10,448 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:45:10,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:45:10,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:45:10,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:45:10,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:45:10,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:45:10,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:45:10,448 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:45:10,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:45:10,449 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:45:10,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:45:10,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:45:10,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:45:10,449 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:45:10,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:45:10,449 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb010ae024b402436affeb854f96a5f9e0df3d8ec2cfe8b3a7f33676b7169a2c [2025-02-06 18:45:10,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:45:10,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:45:10,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:45:10,695 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:45:10,695 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:45:10,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i [2025-02-06 18:45:11,895 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db7cf90b2/5373773ddb0c41819bee96f3a3385718/FLAG3785025b1 [2025-02-06 18:45:12,184 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:45:12,185 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i [2025-02-06 18:45:12,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db7cf90b2/5373773ddb0c41819bee96f3a3385718/FLAG3785025b1 [2025-02-06 18:45:12,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db7cf90b2/5373773ddb0c41819bee96f3a3385718 [2025-02-06 18:45:12,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:45:12,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:45:12,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:45:12,234 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:45:12,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:45:12,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:45:12" (1/1) ... [2025-02-06 18:45:12,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2167fe93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:12, skipping insertion in model container [2025-02-06 18:45:12,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:45:12" (1/1) ... [2025-02-06 18:45:12,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:45:12,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:45:12,488 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:45:12,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:45:12,548 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:45:12,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:12 WrapperNode [2025-02-06 18:45:12,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:45:12,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:45:12,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:45:12,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:45:12,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:12" (1/1) ... [2025-02-06 18:45:12,564 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:12" (1/1) ... [2025-02-06 18:45:12,579 INFO L138 Inliner]: procedures = 170, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-02-06 18:45:12,579 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:45:12,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:45:12,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:45:12,580 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:45:12,589 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:12" (1/1) ... [2025-02-06 18:45:12,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:12" (1/1) ... [2025-02-06 18:45:12,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:12" (1/1) ... [2025-02-06 18:45:12,611 INFO L175 MemorySlicer]: Split 18 memory accesses to 4 slices as follows [2, 5, 6, 5]. 33 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 5]. The 2 writes are split as follows [0, 0, 2, 0]. [2025-02-06 18:45:12,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:12" (1/1) ... [2025-02-06 18:45:12,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:12" (1/1) ... [2025-02-06 18:45:12,615 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:12" (1/1) ... [2025-02-06 18:45:12,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:12" (1/1) ... [2025-02-06 18:45:12,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:12" (1/1) ... [2025-02-06 18:45:12,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:12" (1/1) ... [2025-02-06 18:45:12,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:45:12,623 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:45:12,623 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:45:12,623 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:45:12,623 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:12" (1/1) ... [2025-02-06 18:45:12,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:45:12,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:45:12,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:45:12,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:45:12,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:45:12,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:45:12,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 18:45:12,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 18:45:12,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:45:12,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:45:12,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 18:45:12,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 18:45:12,677 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 18:45:12,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:45:12,677 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 18:45:12,678 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 18:45:12,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:45:12,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:45:12,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 18:45:12,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 18:45:12,678 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 18:45:12,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:45:12,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:45:12,680 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 18:45:12,779 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:45:12,781 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:45:12,943 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:45:12,943 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:45:13,039 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:45:13,040 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:45:13,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:45:13 BoogieIcfgContainer [2025-02-06 18:45:13,040 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:45:13,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:45:13,043 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:45:13,046 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:45:13,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:45:12" (1/3) ... [2025-02-06 18:45:13,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f94463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:45:13, skipping insertion in model container [2025-02-06 18:45:13,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:12" (2/3) ... [2025-02-06 18:45:13,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f94463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:45:13, skipping insertion in model container [2025-02-06 18:45:13,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:45:13" (3/3) ... [2025-02-06 18:45:13,049 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_21-deref_read_racing.i [2025-02-06 18:45:13,061 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:45:13,062 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_21-deref_read_racing.i that has 2 procedures, 44 locations, 1 initial locations, 5 loop locations, and 6 error locations. [2025-02-06 18:45:13,063 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:45:13,097 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 18:45:13,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 52 transitions, 108 flow [2025-02-06 18:45:13,147 INFO L124 PetriNetUnfolderBase]: 10/63 cut-off events. [2025-02-06 18:45:13,152 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:45:13,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 63 events. 10/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 163 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2025-02-06 18:45:13,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 52 transitions, 108 flow [2025-02-06 18:45:13,157 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 52 transitions, 108 flow [2025-02-06 18:45:13,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:45:13,183 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;@15807486, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:45:13,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-06 18:45:13,192 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:45:13,192 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-02-06 18:45:13,192 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:45:13,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:13,193 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:45:13,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-02-06 18:45:13,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:13,200 INFO L85 PathProgramCache]: Analyzing trace with hash 259983885, now seen corresponding path program 1 times [2025-02-06 18:45:13,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:13,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561580223] [2025-02-06 18:45:13,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:13,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:13,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:45:13,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:45:13,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:13,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:13,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:45:13,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:13,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561580223] [2025-02-06 18:45:13,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561580223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:13,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:13,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:45:13,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915033426] [2025-02-06 18:45:13,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:13,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:13,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:13,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:13,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:13,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2025-02-06 18:45:13,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 52 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:13,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:13,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2025-02-06 18:45:13,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:13,693 INFO L124 PetriNetUnfolderBase]: 88/320 cut-off events. [2025-02-06 18:45:13,693 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:45:13,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 320 events. 88/320 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1457 event pairs, 60 based on Foata normal form. 90/381 useless extension candidates. Maximal degree in co-relation 510. Up to 162 conditions per place. [2025-02-06 18:45:13,701 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 41 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2025-02-06 18:45:13,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 65 transitions, 222 flow [2025-02-06 18:45:13,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:45:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:45:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2025-02-06 18:45:13,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7259615384615384 [2025-02-06 18:45:13,711 INFO L175 Difference]: Start difference. First operand has 47 places, 52 transitions, 108 flow. Second operand 4 states and 151 transitions. [2025-02-06 18:45:13,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 65 transitions, 222 flow [2025-02-06 18:45:13,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 222 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:45:13,716 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 98 flow [2025-02-06 18:45:13,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2025-02-06 18:45:13,720 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2025-02-06 18:45:13,721 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 98 flow [2025-02-06 18:45:13,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:13,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:13,721 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:13,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:45:13,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-02-06 18:45:13,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:13,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1354083719, now seen corresponding path program 1 times [2025-02-06 18:45:13,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:13,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767931089] [2025-02-06 18:45:13,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:13,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:13,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:45:13,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:45:13,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:13,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:45:13,744 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:45:13,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:45:13,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:45:13,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:13,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:45:13,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:45:13,777 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:45:13,778 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-06 18:45:13,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2025-02-06 18:45:13,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2025-02-06 18:45:13,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2025-02-06 18:45:13,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2025-02-06 18:45:13,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2025-02-06 18:45:13,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2025-02-06 18:45:13,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2025-02-06 18:45:13,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2025-02-06 18:45:13,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2025-02-06 18:45:13,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2025-02-06 18:45:13,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 18:45:13,781 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 18:45:13,784 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:45:13,785 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 18:45:13,805 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 18:45:13,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 86 transitions, 182 flow [2025-02-06 18:45:13,824 INFO L124 PetriNetUnfolderBase]: 18/113 cut-off events. [2025-02-06 18:45:13,825 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 18:45:13,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 113 events. 18/113 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 386 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 82. Up to 6 conditions per place. [2025-02-06 18:45:13,827 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 86 transitions, 182 flow [2025-02-06 18:45:13,828 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 86 transitions, 182 flow [2025-02-06 18:45:13,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:45:13,829 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;@15807486, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:45:13,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-02-06 18:45:13,831 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:45:13,832 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-02-06 18:45:13,832 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:45:13,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:13,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:45:13,832 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-02-06 18:45:13,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:13,832 INFO L85 PathProgramCache]: Analyzing trace with hash 342085828, now seen corresponding path program 1 times [2025-02-06 18:45:13,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:13,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659535328] [2025-02-06 18:45:13,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:13,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:13,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:45:13,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:45:13,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:13,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:13,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:45:13,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:13,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659535328] [2025-02-06 18:45:13,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659535328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:13,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:13,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:45:13,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211155331] [2025-02-06 18:45:13,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:13,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:13,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:13,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:13,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:13,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 86 [2025-02-06 18:45:13,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 86 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:13,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:13,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 86 [2025-02-06 18:45:13,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:14,548 INFO L124 PetriNetUnfolderBase]: 2860/6434 cut-off events. [2025-02-06 18:45:14,549 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-06 18:45:14,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11030 conditions, 6434 events. 2860/6434 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 54150 event pairs, 1320 based on Foata normal form. 1926/7714 useless extension candidates. Maximal degree in co-relation 897. Up to 4518 conditions per place. [2025-02-06 18:45:14,584 INFO L140 encePairwiseOnDemand]: 66/86 looper letters, 57 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2025-02-06 18:45:14,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 97 transitions, 324 flow [2025-02-06 18:45:14,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:45:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:45:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2025-02-06 18:45:14,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.688953488372093 [2025-02-06 18:45:14,586 INFO L175 Difference]: Start difference. First operand has 77 places, 86 transitions, 182 flow. Second operand 4 states and 237 transitions. [2025-02-06 18:45:14,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 97 transitions, 324 flow [2025-02-06 18:45:14,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 97 transitions, 324 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:45:14,588 INFO L231 Difference]: Finished difference. Result has 82 places, 74 transitions, 178 flow [2025-02-06 18:45:14,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=82, PETRI_TRANSITIONS=74} [2025-02-06 18:45:14,589 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 5 predicate places. [2025-02-06 18:45:14,589 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 178 flow [2025-02-06 18:45:14,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:14,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:14,589 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:14,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:45:14,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-02-06 18:45:14,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:14,590 INFO L85 PathProgramCache]: Analyzing trace with hash -2142033288, now seen corresponding path program 1 times [2025-02-06 18:45:14,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:14,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911192690] [2025-02-06 18:45:14,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:14,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:14,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:45:14,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:45:14,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:14,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:14,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:45:14,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:14,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911192690] [2025-02-06 18:45:14,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911192690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:14,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:14,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:45:14,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558203246] [2025-02-06 18:45:14,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:14,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:45:14,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:14,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:45:14,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:45:14,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 86 [2025-02-06 18:45:14,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 74 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:14,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:14,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 86 [2025-02-06 18:45:14,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:15,271 INFO L124 PetriNetUnfolderBase]: 2596/5530 cut-off events. [2025-02-06 18:45:15,271 INFO L125 PetriNetUnfolderBase]: For 622/622 co-relation queries the response was YES. [2025-02-06 18:45:15,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10358 conditions, 5530 events. 2596/5530 cut-off events. For 622/622 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 44470 event pairs, 252 based on Foata normal form. 144/5372 useless extension candidates. Maximal degree in co-relation 872. Up to 2156 conditions per place. [2025-02-06 18:45:15,296 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 97 selfloop transitions, 6 changer transitions 0/140 dead transitions. [2025-02-06 18:45:15,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 140 transitions, 514 flow [2025-02-06 18:45:15,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:45:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:45:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 326 transitions. [2025-02-06 18:45:15,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6317829457364341 [2025-02-06 18:45:15,300 INFO L175 Difference]: Start difference. First operand has 82 places, 74 transitions, 178 flow. Second operand 6 states and 326 transitions. [2025-02-06 18:45:15,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 140 transitions, 514 flow [2025-02-06 18:45:15,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 140 transitions, 512 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:45:15,304 INFO L231 Difference]: Finished difference. Result has 85 places, 73 transitions, 184 flow [2025-02-06 18:45:15,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=85, PETRI_TRANSITIONS=73} [2025-02-06 18:45:15,305 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 8 predicate places. [2025-02-06 18:45:15,306 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 73 transitions, 184 flow [2025-02-06 18:45:15,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:15,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:15,306 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:15,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:45:15,306 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-02-06 18:45:15,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:15,307 INFO L85 PathProgramCache]: Analyzing trace with hash -288448161, now seen corresponding path program 1 times [2025-02-06 18:45:15,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:15,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767029127] [2025-02-06 18:45:15,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:15,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:15,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:45:15,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:45:15,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:15,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:45:15,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:15,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767029127] [2025-02-06 18:45:15,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767029127] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:15,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:15,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:45:15,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281769502] [2025-02-06 18:45:15,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:15,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:15,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:15,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:15,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:15,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 86 [2025-02-06 18:45:15,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 73 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:15,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:15,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 86 [2025-02-06 18:45:15,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:15,892 INFO L124 PetriNetUnfolderBase]: 2393/5313 cut-off events. [2025-02-06 18:45:15,893 INFO L125 PetriNetUnfolderBase]: For 1433/1594 co-relation queries the response was YES. [2025-02-06 18:45:15,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9927 conditions, 5313 events. 2393/5313 cut-off events. For 1433/1594 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 42288 event pairs, 757 based on Foata normal form. 104/5114 useless extension candidates. Maximal degree in co-relation 7933. Up to 3353 conditions per place. [2025-02-06 18:45:15,926 INFO L140 encePairwiseOnDemand]: 80/86 looper letters, 74 selfloop transitions, 6 changer transitions 0/118 dead transitions. [2025-02-06 18:45:15,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 118 transitions, 476 flow [2025-02-06 18:45:15,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:45:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:45:15,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 271 transitions. [2025-02-06 18:45:15,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6302325581395349 [2025-02-06 18:45:15,928 INFO L175 Difference]: Start difference. First operand has 85 places, 73 transitions, 184 flow. Second operand 5 states and 271 transitions. [2025-02-06 18:45:15,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 118 transitions, 476 flow [2025-02-06 18:45:15,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 118 transitions, 453 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-06 18:45:15,935 INFO L231 Difference]: Finished difference. Result has 88 places, 78 transitions, 216 flow [2025-02-06 18:45:15,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=88, PETRI_TRANSITIONS=78} [2025-02-06 18:45:15,937 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 11 predicate places. [2025-02-06 18:45:15,937 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 78 transitions, 216 flow [2025-02-06 18:45:15,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:15,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:15,938 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 18:45:15,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:45:15,938 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-02-06 18:45:15,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:15,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1978522202, now seen corresponding path program 1 times [2025-02-06 18:45:15,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:15,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244355766] [2025-02-06 18:45:15,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:15,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:15,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:45:15,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:45:15,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:15,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:15,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:45:15,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:15,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244355766] [2025-02-06 18:45:15,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244355766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:15,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:15,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:45:15,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587817313] [2025-02-06 18:45:15,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:15,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:15,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:15,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:15,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:15,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 86 [2025-02-06 18:45:15,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 78 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:15,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:15,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 86 [2025-02-06 18:45:15,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:16,513 INFO L124 PetriNetUnfolderBase]: 2459/5059 cut-off events. [2025-02-06 18:45:16,513 INFO L125 PetriNetUnfolderBase]: For 1381/1381 co-relation queries the response was YES. [2025-02-06 18:45:16,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10209 conditions, 5059 events. 2459/5059 cut-off events. For 1381/1381 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 38601 event pairs, 242 based on Foata normal form. 152/5081 useless extension candidates. Maximal degree in co-relation 9457. Up to 2725 conditions per place. [2025-02-06 18:45:16,531 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 89 selfloop transitions, 6 changer transitions 0/132 dead transitions. [2025-02-06 18:45:16,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 132 transitions, 558 flow [2025-02-06 18:45:16,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:45:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:45:16,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 227 transitions. [2025-02-06 18:45:16,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6598837209302325 [2025-02-06 18:45:16,533 INFO L175 Difference]: Start difference. First operand has 88 places, 78 transitions, 216 flow. Second operand 4 states and 227 transitions. [2025-02-06 18:45:16,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 132 transitions, 558 flow [2025-02-06 18:45:16,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 132 transitions, 554 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 18:45:16,540 INFO L231 Difference]: Finished difference. Result has 90 places, 78 transitions, 228 flow [2025-02-06 18:45:16,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=90, PETRI_TRANSITIONS=78} [2025-02-06 18:45:16,540 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 13 predicate places. [2025-02-06 18:45:16,541 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 78 transitions, 228 flow [2025-02-06 18:45:16,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:16,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:16,541 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-02-06 18:45:16,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:45:16,541 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-02-06 18:45:16,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:16,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1310686963, now seen corresponding path program 1 times [2025-02-06 18:45:16,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:16,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833970950] [2025-02-06 18:45:16,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:16,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:16,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:45:16,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:45:16,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:16,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:45:16,557 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:45:16,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:45:16,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:45:16,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:16,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:45:16,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:45:16,567 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:45:16,567 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-02-06 18:45:16,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 15 remaining) [2025-02-06 18:45:16,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 15 remaining) [2025-02-06 18:45:16,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 15 remaining) [2025-02-06 18:45:16,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 15 remaining) [2025-02-06 18:45:16,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 15 remaining) [2025-02-06 18:45:16,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 15 remaining) [2025-02-06 18:45:16,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 15 remaining) [2025-02-06 18:45:16,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 15 remaining) [2025-02-06 18:45:16,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 15 remaining) [2025-02-06 18:45:16,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 15 remaining) [2025-02-06 18:45:16,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 15 remaining) [2025-02-06 18:45:16,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 15 remaining) [2025-02-06 18:45:16,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 15 remaining) [2025-02-06 18:45:16,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 15 remaining) [2025-02-06 18:45:16,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:45:16,568 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 18:45:16,568 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:45:16,568 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 18:45:16,589 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 18:45:16,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 120 transitions, 258 flow [2025-02-06 18:45:16,600 INFO L124 PetriNetUnfolderBase]: 26/163 cut-off events. [2025-02-06 18:45:16,601 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 18:45:16,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 163 events. 26/163 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 605 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2025-02-06 18:45:16,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 120 transitions, 258 flow [2025-02-06 18:45:16,602 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 120 transitions, 258 flow [2025-02-06 18:45:16,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:45:16,603 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;@15807486, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:45:16,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-02-06 18:45:16,604 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:45:16,604 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-02-06 18:45:16,604 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:45:16,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:16,604 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:45:16,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-06 18:45:16,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:16,605 INFO L85 PathProgramCache]: Analyzing trace with hash 456634141, now seen corresponding path program 1 times [2025-02-06 18:45:16,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:16,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282165775] [2025-02-06 18:45:16,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:16,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:16,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:45:16,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:45:16,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:16,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:16,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:45:16,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:16,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282165775] [2025-02-06 18:45:16,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282165775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:16,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:16,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:45:16,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666007854] [2025-02-06 18:45:16,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:16,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:16,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:16,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:16,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:16,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 120 [2025-02-06 18:45:16,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 120 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:16,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:16,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 120 [2025-02-06 18:45:16,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:22,437 INFO L124 PetriNetUnfolderBase]: 53548/98954 cut-off events. [2025-02-06 18:45:22,437 INFO L125 PetriNetUnfolderBase]: For 1092/1092 co-relation queries the response was YES. [2025-02-06 18:45:22,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173823 conditions, 98954 events. 53548/98954 cut-off events. For 1092/1092 co-relation queries the response was YES. Maximal size of possible extension queue 2499. Compared 1037894 event pairs, 34584 based on Foata normal form. 32958/123154 useless extension candidates. Maximal degree in co-relation 11439. Up to 74214 conditions per place. [2025-02-06 18:45:22,982 INFO L140 encePairwiseOnDemand]: 94/120 looper letters, 69 selfloop transitions, 3 changer transitions 0/125 dead transitions. [2025-02-06 18:45:22,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 125 transitions, 412 flow [2025-02-06 18:45:22,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:45:22,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:45:22,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 319 transitions. [2025-02-06 18:45:22,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6645833333333333 [2025-02-06 18:45:22,985 INFO L175 Difference]: Start difference. First operand has 107 places, 120 transitions, 258 flow. Second operand 4 states and 319 transitions. [2025-02-06 18:45:22,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 125 transitions, 412 flow [2025-02-06 18:45:22,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 125 transitions, 410 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 18:45:22,988 INFO L231 Difference]: Finished difference. Result has 112 places, 102 transitions, 240 flow [2025-02-06 18:45:22,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=112, PETRI_TRANSITIONS=102} [2025-02-06 18:45:22,990 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 5 predicate places. [2025-02-06 18:45:22,990 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 102 transitions, 240 flow [2025-02-06 18:45:22,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:22,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:22,991 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:22,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:45:22,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-06 18:45:22,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:22,991 INFO L85 PathProgramCache]: Analyzing trace with hash 938293784, now seen corresponding path program 1 times [2025-02-06 18:45:22,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:22,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804783344] [2025-02-06 18:45:22,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:22,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:22,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:45:23,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:45:23,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:23,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:23,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:45:23,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:23,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804783344] [2025-02-06 18:45:23,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804783344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:23,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:23,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:45:23,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300438286] [2025-02-06 18:45:23,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:23,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:45:23,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:23,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:45:23,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:45:23,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 120 [2025-02-06 18:45:23,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 102 transitions, 240 flow. Second operand has 6 states, 6 states have (on average 54.5) internal successors, (327), 6 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:23,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:23,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 120 [2025-02-06 18:45:23,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:27,749 INFO L124 PetriNetUnfolderBase]: 48532/81694 cut-off events. [2025-02-06 18:45:27,749 INFO L125 PetriNetUnfolderBase]: For 6166/6166 co-relation queries the response was YES. [2025-02-06 18:45:28,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157083 conditions, 81694 events. 48532/81694 cut-off events. For 6166/6166 co-relation queries the response was YES. Maximal size of possible extension queue 2013. Compared 772094 event pairs, 8184 based on Foata normal form. 1872/79484 useless extension candidates. Maximal degree in co-relation 13339. Up to 34556 conditions per place. [2025-02-06 18:45:28,389 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 131 selfloop transitions, 6 changer transitions 0/190 dead transitions. [2025-02-06 18:45:28,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 190 transitions, 688 flow [2025-02-06 18:45:28,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:45:28,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:45:28,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 456 transitions. [2025-02-06 18:45:28,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-02-06 18:45:28,391 INFO L175 Difference]: Start difference. First operand has 112 places, 102 transitions, 240 flow. Second operand 6 states and 456 transitions. [2025-02-06 18:45:28,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 190 transitions, 688 flow [2025-02-06 18:45:28,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 190 transitions, 686 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:45:28,395 INFO L231 Difference]: Finished difference. Result has 115 places, 101 transitions, 246 flow [2025-02-06 18:45:28,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=115, PETRI_TRANSITIONS=101} [2025-02-06 18:45:28,396 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 8 predicate places. [2025-02-06 18:45:28,396 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 101 transitions, 246 flow [2025-02-06 18:45:28,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.5) internal successors, (327), 6 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:28,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:28,396 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:28,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:45:28,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-06 18:45:28,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:28,397 INFO L85 PathProgramCache]: Analyzing trace with hash 171001592, now seen corresponding path program 1 times [2025-02-06 18:45:28,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:28,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823734356] [2025-02-06 18:45:28,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:28,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:28,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:45:28,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:45:28,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:28,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:28,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:45:28,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:28,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823734356] [2025-02-06 18:45:28,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823734356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:28,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:28,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:45:28,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515813864] [2025-02-06 18:45:28,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:28,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:28,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:28,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:28,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:28,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 120 [2025-02-06 18:45:28,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 101 transitions, 246 flow. Second operand has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:28,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:28,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 120 [2025-02-06 18:45:28,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:33,288 INFO L124 PetriNetUnfolderBase]: 47105/84294 cut-off events. [2025-02-06 18:45:33,288 INFO L125 PetriNetUnfolderBase]: For 16535/18783 co-relation queries the response was YES. [2025-02-06 18:45:33,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159496 conditions, 84294 events. 47105/84294 cut-off events. For 16535/18783 co-relation queries the response was YES. Maximal size of possible extension queue 2174. Compared 833276 event pairs, 18833 based on Foata normal form. 1256/81164 useless extension candidates. Maximal degree in co-relation 136435. Up to 60521 conditions per place. [2025-02-06 18:45:33,760 INFO L140 encePairwiseOnDemand]: 113/120 looper letters, 110 selfloop transitions, 8 changer transitions 0/172 dead transitions. [2025-02-06 18:45:33,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 172 transitions, 681 flow [2025-02-06 18:45:33,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:45:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:45:33,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 389 transitions. [2025-02-06 18:45:33,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6483333333333333 [2025-02-06 18:45:33,762 INFO L175 Difference]: Start difference. First operand has 115 places, 101 transitions, 246 flow. Second operand 5 states and 389 transitions. [2025-02-06 18:45:33,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 172 transitions, 681 flow [2025-02-06 18:45:33,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 172 transitions, 658 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-06 18:45:33,768 INFO L231 Difference]: Finished difference. Result has 118 places, 108 transitions, 295 flow [2025-02-06 18:45:33,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=295, PETRI_PLACES=118, PETRI_TRANSITIONS=108} [2025-02-06 18:45:33,769 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 11 predicate places. [2025-02-06 18:45:33,769 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 108 transitions, 295 flow [2025-02-06 18:45:33,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:33,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:33,769 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 18:45:33,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:45:33,769 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-02-06 18:45:33,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:33,770 INFO L85 PathProgramCache]: Analyzing trace with hash -977663362, now seen corresponding path program 1 times [2025-02-06 18:45:33,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:33,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139324428] [2025-02-06 18:45:33,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:33,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:33,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:45:33,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:45:33,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:33,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:45:33,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:33,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139324428] [2025-02-06 18:45:33,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139324428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:33,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:33,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:45:33,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736106845] [2025-02-06 18:45:33,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:33,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:33,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:33,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:33,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:33,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 120 [2025-02-06 18:45:33,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 108 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:33,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:33,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 120 [2025-02-06 18:45:33,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:38,970 INFO L124 PetriNetUnfolderBase]: 48849/82078 cut-off events. [2025-02-06 18:45:38,970 INFO L125 PetriNetUnfolderBase]: For 24847/24847 co-relation queries the response was YES. [2025-02-06 18:45:39,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169453 conditions, 82078 events. 48849/82078 cut-off events. For 24847/24847 co-relation queries the response was YES. Maximal size of possible extension queue 2110. Compared 777373 event pairs, 8837 based on Foata normal form. 2136/82810 useless extension candidates. Maximal degree in co-relation 147351. Up to 46837 conditions per place. [2025-02-06 18:45:39,650 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 129 selfloop transitions, 6 changer transitions 0/188 dead transitions. [2025-02-06 18:45:39,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 188 transitions, 795 flow [2025-02-06 18:45:39,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:45:39,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:45:39,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2025-02-06 18:45:39,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2025-02-06 18:45:39,652 INFO L175 Difference]: Start difference. First operand has 118 places, 108 transitions, 295 flow. Second operand 4 states and 325 transitions. [2025-02-06 18:45:39,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 188 transitions, 795 flow [2025-02-06 18:45:39,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 188 transitions, 791 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 18:45:39,941 INFO L231 Difference]: Finished difference. Result has 120 places, 108 transitions, 307 flow [2025-02-06 18:45:39,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=307, PETRI_PLACES=120, PETRI_TRANSITIONS=108} [2025-02-06 18:45:39,942 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 13 predicate places. [2025-02-06 18:45:39,942 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 108 transitions, 307 flow [2025-02-06 18:45:39,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:39,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:39,942 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:39,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:45:39,943 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-06 18:45:39,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:39,943 INFO L85 PathProgramCache]: Analyzing trace with hash 621390003, now seen corresponding path program 1 times [2025-02-06 18:45:39,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:39,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663106210] [2025-02-06 18:45:39,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:39,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:39,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 18:45:39,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 18:45:39,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:39,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:40,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:45:40,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:40,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663106210] [2025-02-06 18:45:40,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663106210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:40,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:40,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:45:40,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302769244] [2025-02-06 18:45:40,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:40,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:40,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:40,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:40,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:40,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 120 [2025-02-06 18:45:40,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 108 transitions, 307 flow. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:40,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:40,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 120 [2025-02-06 18:45:40,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:45,857 INFO L124 PetriNetUnfolderBase]: 52665/95064 cut-off events. [2025-02-06 18:45:45,857 INFO L125 PetriNetUnfolderBase]: For 37680/37728 co-relation queries the response was YES. [2025-02-06 18:45:46,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195160 conditions, 95064 events. 52665/95064 cut-off events. For 37680/37728 co-relation queries the response was YES. Maximal size of possible extension queue 2518. Compared 965207 event pairs, 21673 based on Foata normal form. 2624/94025 useless extension candidates. Maximal degree in co-relation 169598. Up to 68097 conditions per place. [2025-02-06 18:45:46,336 INFO L140 encePairwiseOnDemand]: 113/120 looper letters, 111 selfloop transitions, 11 changer transitions 0/175 dead transitions. [2025-02-06 18:45:46,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 175 transitions, 766 flow [2025-02-06 18:45:46,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:45:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:45:46,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2025-02-06 18:45:46,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6466666666666666 [2025-02-06 18:45:46,338 INFO L175 Difference]: Start difference. First operand has 120 places, 108 transitions, 307 flow. Second operand 5 states and 388 transitions. [2025-02-06 18:45:46,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 175 transitions, 766 flow [2025-02-06 18:45:46,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 175 transitions, 751 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:45:46,387 INFO L231 Difference]: Finished difference. Result has 125 places, 113 transitions, 372 flow [2025-02-06 18:45:46,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=372, PETRI_PLACES=125, PETRI_TRANSITIONS=113} [2025-02-06 18:45:46,387 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 18 predicate places. [2025-02-06 18:45:46,387 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 113 transitions, 372 flow [2025-02-06 18:45:46,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:46,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:46,387 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1] [2025-02-06 18:45:46,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 18:45:46,388 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-06 18:45:46,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:46,388 INFO L85 PathProgramCache]: Analyzing trace with hash 465229190, now seen corresponding path program 1 times [2025-02-06 18:45:46,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:46,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122056355] [2025-02-06 18:45:46,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:46,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:46,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 18:45:46,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 18:45:46,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:46,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:45:46,398 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:45:46,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 18:45:46,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 18:45:46,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:46,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:45:46,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:45:46,408 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:45:46,408 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2025-02-06 18:45:46,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 19 remaining) [2025-02-06 18:45:46,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 19 remaining) [2025-02-06 18:45:46,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 19 remaining) [2025-02-06 18:45:46,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 19 remaining) [2025-02-06 18:45:46,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 19 remaining) [2025-02-06 18:45:46,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 19 remaining) [2025-02-06 18:45:46,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 19 remaining) [2025-02-06 18:45:46,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 19 remaining) [2025-02-06 18:45:46,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 19 remaining) [2025-02-06 18:45:46,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 19 remaining) [2025-02-06 18:45:46,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 19 remaining) [2025-02-06 18:45:46,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 19 remaining) [2025-02-06 18:45:46,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 19 remaining) [2025-02-06 18:45:46,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 19 remaining) [2025-02-06 18:45:46,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 19 remaining) [2025-02-06 18:45:46,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 19 remaining) [2025-02-06 18:45:46,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 19 remaining) [2025-02-06 18:45:46,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 19 remaining) [2025-02-06 18:45:46,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 18:45:46,409 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 18:45:46,410 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:45:46,410 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 18:45:46,427 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 18:45:46,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 154 transitions, 336 flow [2025-02-06 18:45:46,440 INFO L124 PetriNetUnfolderBase]: 34/213 cut-off events. [2025-02-06 18:45:46,440 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 18:45:46,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 213 events. 34/213 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 818 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 179. Up to 10 conditions per place. [2025-02-06 18:45:46,441 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 154 transitions, 336 flow [2025-02-06 18:45:46,443 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 154 transitions, 336 flow [2025-02-06 18:45:46,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:45:46,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;@15807486, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:45:46,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-06 18:45:46,445 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:45:46,445 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-02-06 18:45:46,445 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:45:46,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:46,445 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:45:46,445 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2025-02-06 18:45:46,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:46,445 INFO L85 PathProgramCache]: Analyzing trace with hash 603628824, now seen corresponding path program 1 times [2025-02-06 18:45:46,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:46,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163404486] [2025-02-06 18:45:46,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:46,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:46,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:45:46,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:45:46,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:46,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:46,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-02-06 18:45:46,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:46,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163404486] [2025-02-06 18:45:46,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163404486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:46,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:46,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:45:46,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183253830] [2025-02-06 18:45:46,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:46,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:46,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:46,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:46,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:46,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 154 [2025-02-06 18:45:46,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 154 transitions, 336 flow. Second operand has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:46,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:46,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 154 [2025-02-06 18:45:46,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand