./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix046.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix046.oepc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0c2da3652c054af11b47a99e37d3ddb516e4f65f65f3696b960347af3ebf57e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:28:03,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:28:03,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:28:03,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:28:03,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:28:04,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:28:04,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:28:04,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:28:04,007 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:28:04,007 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:28:04,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:28:04,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:28:04,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:28:04,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:28:04,008 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:28:04,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:28:04,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:28:04,008 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:28:04,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:28:04,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:28:04,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:28:04,008 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:28:04,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:28:04,008 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:28:04,008 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:28:04,008 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:28:04,009 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:28:04,009 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:28:04,009 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:28:04,009 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:28:04,009 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:28:04,009 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:28:04,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:28:04,009 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:28:04,009 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:28:04,009 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:28:04,009 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:28:04,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:28:04,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:28:04,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:28:04,009 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:28:04,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:28:04,009 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:28:04,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:28:04,010 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:28:04,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:28:04,010 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:28:04,010 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:28:04,010 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 ! call(reach_error())) ) 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 -> 0c2da3652c054af11b47a99e37d3ddb516e4f65f65f3696b960347af3ebf57e8 [2025-01-09 16:28:04,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:28:04,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:28:04,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:28:04,277 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:28:04,277 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:28:04,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix046.oepc.i [2025-01-09 16:28:05,542 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67daaa1d2/a3a9d6ca97b841cdadeb77e914065f68/FLAGf1345b58a [2025-01-09 16:28:05,850 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:28:05,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix046.oepc.i [2025-01-09 16:28:05,868 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67daaa1d2/a3a9d6ca97b841cdadeb77e914065f68/FLAGf1345b58a [2025-01-09 16:28:06,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67daaa1d2/a3a9d6ca97b841cdadeb77e914065f68 [2025-01-09 16:28:06,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:28:06,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:28:06,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:28:06,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:28:06,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:28:06,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:28:06" (1/1) ... [2025-01-09 16:28:06,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659b9ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:06, skipping insertion in model container [2025-01-09 16:28:06,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:28:06" (1/1) ... [2025-01-09 16:28:06,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:28:06,307 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix046.oepc.i[945,958] [2025-01-09 16:28:06,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:28:06,448 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:28:06,455 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix046.oepc.i[945,958] [2025-01-09 16:28:06,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:28:06,513 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:28:06,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:06 WrapperNode [2025-01-09 16:28:06,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:28:06,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:28:06,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:28:06,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:28:06,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:06" (1/1) ... [2025-01-09 16:28:06,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:06" (1/1) ... [2025-01-09 16:28:06,549 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2025-01-09 16:28:06,549 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:28:06,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:28:06,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:28:06,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:28:06,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:06" (1/1) ... [2025-01-09 16:28:06,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:06" (1/1) ... [2025-01-09 16:28:06,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:06" (1/1) ... [2025-01-09 16:28:06,579 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 16:28:06,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:06" (1/1) ... [2025-01-09 16:28:06,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:06" (1/1) ... [2025-01-09 16:28:06,584 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:06" (1/1) ... [2025-01-09 16:28:06,585 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:06" (1/1) ... [2025-01-09 16:28:06,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:06" (1/1) ... [2025-01-09 16:28:06,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:06" (1/1) ... [2025-01-09 16:28:06,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:06" (1/1) ... [2025-01-09 16:28:06,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:28:06,590 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:28:06,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:28:06,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:28:06,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:06" (1/1) ... [2025-01-09 16:28:06,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:28:06,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:28:06,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:28:06,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:28:06,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:28:06,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:28:06,648 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-09 16:28:06,649 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-09 16:28:06,649 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-09 16:28:06,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-09 16:28:06,650 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-09 16:28:06,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-09 16:28:06,650 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-01-09 16:28:06,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-01-09 16:28:06,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:28:06,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:28:06,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:28:06,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:28:06,651 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:28:06,776 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:28:06,777 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:28:07,041 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:28:07,041 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:28:07,221 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:28:07,221 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:28:07,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:28:07 BoogieIcfgContainer [2025-01-09 16:28:07,222 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:28:07,224 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:28:07,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:28:07,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:28:07,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:28:06" (1/3) ... [2025-01-09 16:28:07,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a00367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:28:07, skipping insertion in model container [2025-01-09 16:28:07,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:06" (2/3) ... [2025-01-09 16:28:07,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a00367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:28:07, skipping insertion in model container [2025-01-09 16:28:07,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:28:07" (3/3) ... [2025-01-09 16:28:07,231 INFO L128 eAbstractionObserver]: Analyzing ICFG mix046.oepc.i [2025-01-09 16:28:07,241 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:28:07,243 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix046.oepc.i that has 5 procedures, 50 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-09 16:28:07,243 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:28:07,291 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:28:07,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2025-01-09 16:28:07,351 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-01-09 16:28:07,352 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:28:07,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 93 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2025-01-09 16:28:07,354 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2025-01-09 16:28:07,360 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2025-01-09 16:28:07,365 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:28:07,384 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;@4660533f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:28:07,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 16:28:07,390 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:28:07,391 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-09 16:28:07,391 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:28:07,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:07,391 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-09 16:28:07,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:07,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:07,397 INFO L85 PathProgramCache]: Analyzing trace with hash 11875706, now seen corresponding path program 1 times [2025-01-09 16:28:07,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:07,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296084512] [2025-01-09 16:28:07,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:07,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:07,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 16:28:07,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 16:28:07,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:07,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:07,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:07,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296084512] [2025-01-09 16:28:07,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296084512] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:07,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:07,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 16:28:07,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688581496] [2025-01-09 16:28:07,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:07,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:28:07,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:07,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:28:07,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:28:07,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2025-01-09 16:28:07,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:07,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:07,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2025-01-09 16:28:07,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:08,539 INFO L124 PetriNetUnfolderBase]: 2495/3975 cut-off events. [2025-01-09 16:28:08,539 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-01-09 16:28:08,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7551 conditions, 3975 events. 2495/3975 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 24867 event pairs, 1647 based on Foata normal form. 135/4048 useless extension candidates. Maximal degree in co-relation 7539. Up to 2779 conditions per place. [2025-01-09 16:28:08,563 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 37 selfloop transitions, 2 changer transitions 2/62 dead transitions. [2025-01-09 16:28:08,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 227 flow [2025-01-09 16:28:08,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:28:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:28:08,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-01-09 16:28:08,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7933333333333333 [2025-01-09 16:28:08,573 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 119 transitions. [2025-01-09 16:28:08,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 227 flow [2025-01-09 16:28:08,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:28:08,582 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2025-01-09 16:28:08,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2025-01-09 16:28:08,590 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2025-01-09 16:28:08,594 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2025-01-09 16:28:08,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:08,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:08,595 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:08,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:28:08,596 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:08,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:08,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1594122599, now seen corresponding path program 1 times [2025-01-09 16:28:08,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:08,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244581161] [2025-01-09 16:28:08,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:08,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:08,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 16:28:08,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:28:08,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:08,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:08,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:08,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244581161] [2025-01-09 16:28:08,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244581161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:08,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:08,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:28:08,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247581079] [2025-01-09 16:28:08,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:08,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:28:08,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:08,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:28:08,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:28:08,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-01-09 16:28:08,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:08,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:08,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-01-09 16:28:08,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:10,200 INFO L124 PetriNetUnfolderBase]: 7449/11581 cut-off events. [2025-01-09 16:28:10,201 INFO L125 PetriNetUnfolderBase]: For 680/680 co-relation queries the response was YES. [2025-01-09 16:28:10,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22565 conditions, 11581 events. 7449/11581 cut-off events. For 680/680 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 83725 event pairs, 1703 based on Foata normal form. 0/11230 useless extension candidates. Maximal degree in co-relation 22555. Up to 6408 conditions per place. [2025-01-09 16:28:10,253 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 35 selfloop transitions, 3 changer transitions 56/110 dead transitions. [2025-01-09 16:28:10,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 110 transitions, 434 flow [2025-01-09 16:28:10,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:28:10,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:28:10,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 256 transitions. [2025-01-09 16:28:10,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64 [2025-01-09 16:28:10,257 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 8 states and 256 transitions. [2025-01-09 16:28:10,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 110 transitions, 434 flow [2025-01-09 16:28:10,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 110 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:28:10,261 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 127 flow [2025-01-09 16:28:10,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=127, PETRI_PLACES=64, PETRI_TRANSITIONS=44} [2025-01-09 16:28:10,262 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2025-01-09 16:28:10,262 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 127 flow [2025-01-09 16:28:10,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:10,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:10,263 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:10,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:28:10,263 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:10,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:10,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2096953082, now seen corresponding path program 1 times [2025-01-09 16:28:10,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:10,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310293470] [2025-01-09 16:28:10,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:10,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:10,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:28:10,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:28:10,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:10,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:10,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-01-09 16:28:10,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:10,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310293470] [2025-01-09 16:28:10,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310293470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:10,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:10,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:28:10,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735717756] [2025-01-09 16:28:10,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:10,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:28:10,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:10,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:28:10,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:28:10,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-01-09 16:28:10,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 44 transitions, 127 flow. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:10,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:10,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-01-09 16:28:10,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:13,416 INFO L124 PetriNetUnfolderBase]: 23599/34161 cut-off events. [2025-01-09 16:28:13,416 INFO L125 PetriNetUnfolderBase]: For 15914/15954 co-relation queries the response was YES. [2025-01-09 16:28:13,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77812 conditions, 34161 events. 23599/34161 cut-off events. For 15914/15954 co-relation queries the response was YES. Maximal size of possible extension queue 1469. Compared 237386 event pairs, 3441 based on Foata normal form. 920/35001 useless extension candidates. Maximal degree in co-relation 77797. Up to 11775 conditions per place. [2025-01-09 16:28:13,565 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 58 selfloop transitions, 7 changer transitions 87/164 dead transitions. [2025-01-09 16:28:13,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 164 transitions, 755 flow [2025-01-09 16:28:13,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:28:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:28:13,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 313 transitions. [2025-01-09 16:28:13,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.626 [2025-01-09 16:28:13,567 INFO L175 Difference]: Start difference. First operand has 64 places, 44 transitions, 127 flow. Second operand 10 states and 313 transitions. [2025-01-09 16:28:13,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 164 transitions, 755 flow [2025-01-09 16:28:13,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 164 transitions, 732 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-01-09 16:28:13,924 INFO L231 Difference]: Finished difference. Result has 73 places, 49 transitions, 208 flow [2025-01-09 16:28:13,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=208, PETRI_PLACES=73, PETRI_TRANSITIONS=49} [2025-01-09 16:28:13,924 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 15 predicate places. [2025-01-09 16:28:13,925 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 49 transitions, 208 flow [2025-01-09 16:28:13,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:13,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:13,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:13,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:28:13,925 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:13,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:13,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1174125915, now seen corresponding path program 1 times [2025-01-09 16:28:13,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:13,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935339788] [2025-01-09 16:28:13,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:13,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:13,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:28:13,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:28:13,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:13,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:14,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:14,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:14,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935339788] [2025-01-09 16:28:14,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935339788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:14,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:14,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:28:14,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367552720] [2025-01-09 16:28:14,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:14,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:28:14,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:14,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:28:14,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:28:14,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-01-09 16:28:14,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 49 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:14,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:14,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-01-09 16:28:14,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:16,784 INFO L124 PetriNetUnfolderBase]: 17596/26910 cut-off events. [2025-01-09 16:28:16,785 INFO L125 PetriNetUnfolderBase]: For 52342/54228 co-relation queries the response was YES. [2025-01-09 16:28:16,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78103 conditions, 26910 events. 17596/26910 cut-off events. For 52342/54228 co-relation queries the response was YES. Maximal size of possible extension queue 1372. Compared 204908 event pairs, 6335 based on Foata normal form. 728/26820 useless extension candidates. Maximal degree in co-relation 78080. Up to 18205 conditions per place. [2025-01-09 16:28:16,952 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 41 selfloop transitions, 4 changer transitions 49/114 dead transitions. [2025-01-09 16:28:16,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 114 transitions, 666 flow [2025-01-09 16:28:16,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:28:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:28:16,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 226 transitions. [2025-01-09 16:28:16,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6457142857142857 [2025-01-09 16:28:16,954 INFO L175 Difference]: Start difference. First operand has 73 places, 49 transitions, 208 flow. Second operand 7 states and 226 transitions. [2025-01-09 16:28:16,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 114 transitions, 666 flow [2025-01-09 16:28:17,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 114 transitions, 654 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-01-09 16:28:17,147 INFO L231 Difference]: Finished difference. Result has 75 places, 52 transitions, 258 flow [2025-01-09 16:28:17,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=258, PETRI_PLACES=75, PETRI_TRANSITIONS=52} [2025-01-09 16:28:17,147 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2025-01-09 16:28:17,147 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 52 transitions, 258 flow [2025-01-09 16:28:17,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:17,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:17,148 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:17,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:28:17,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:17,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:17,298 INFO L85 PathProgramCache]: Analyzing trace with hash -901983320, now seen corresponding path program 1 times [2025-01-09 16:28:17,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:17,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041479782] [2025-01-09 16:28:17,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:17,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:17,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:28:17,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:28:17,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:17,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:17,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:17,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041479782] [2025-01-09 16:28:17,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041479782] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:17,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:17,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:28:17,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968382473] [2025-01-09 16:28:17,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:17,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:28:17,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:17,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:28:17,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:28:17,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-01-09 16:28:17,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 52 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:17,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:17,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-01-09 16:28:17,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:21,213 INFO L124 PetriNetUnfolderBase]: 29468/43792 cut-off events. [2025-01-09 16:28:21,213 INFO L125 PetriNetUnfolderBase]: For 67590/69583 co-relation queries the response was YES. [2025-01-09 16:28:21,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116271 conditions, 43792 events. 29468/43792 cut-off events. For 67590/69583 co-relation queries the response was YES. Maximal size of possible extension queue 2036. Compared 328113 event pairs, 5421 based on Foata normal form. 1548/43688 useless extension candidates. Maximal degree in co-relation 116244. Up to 22079 conditions per place. [2025-01-09 16:28:21,654 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 56 selfloop transitions, 6 changer transitions 0/86 dead transitions. [2025-01-09 16:28:21,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 86 transitions, 476 flow [2025-01-09 16:28:21,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:28:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:28:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-01-09 16:28:21,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.705 [2025-01-09 16:28:21,659 INFO L175 Difference]: Start difference. First operand has 75 places, 52 transitions, 258 flow. Second operand 4 states and 141 transitions. [2025-01-09 16:28:21,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 86 transitions, 476 flow [2025-01-09 16:28:21,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 86 transitions, 464 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-09 16:28:21,918 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 292 flow [2025-01-09 16:28:21,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=292, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2025-01-09 16:28:21,919 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 15 predicate places. [2025-01-09 16:28:21,919 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 292 flow [2025-01-09 16:28:21,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:21,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:21,919 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:21,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:28:21,919 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:21,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:21,920 INFO L85 PathProgramCache]: Analyzing trace with hash 597652304, now seen corresponding path program 1 times [2025-01-09 16:28:21,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:21,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638212283] [2025-01-09 16:28:21,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:21,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:21,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:28:21,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:28:21,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:21,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:22,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:22,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:22,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638212283] [2025-01-09 16:28:22,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638212283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:22,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:22,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:28:22,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449705537] [2025-01-09 16:28:22,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:22,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:28:22,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:22,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:28:22,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:28:22,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-01-09 16:28:22,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 292 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:22,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:22,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-01-09 16:28:22,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:23,010 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([403] L829-->L845: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse2 (= (mod v_~b$r_buff0_thd4~0_64 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_30 256) 0)) (.cse5 (not .cse2)) (.cse1 (and .cse10 .cse2)) (.cse8 (and .cse2 (= (mod v_~b$w_buff1_used~0_123 256) 0))) (.cse12 (= (mod v_~b$w_buff0_used~0_134 256) 0))) (let ((.cse6 (or .cse1 .cse8 .cse12)) (.cse7 (and .cse5 (not .cse12))) (.cse0 (not .cse11)) (.cse3 (= 0 (mod v_~b$w_buff1_used~0_122 256))) (.cse4 (= (mod v_~b$w_buff0_used~0_133 256) 0))) (and (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_64 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~b$r_buff0_thd4~0_64 (ite (and (not .cse4) .cse5) 0 v_~b$r_buff0_thd4~0_64))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_63) (= v_~__unbuffered_p3_EBX~0_16 (ite .cse6 v_~b~0_69 (ite .cse7 v_~b$w_buff0~0_47 v_~b$w_buff1~0_38))) (= v_~b$w_buff0~0_47 v_~b$w_buff0~0_46) (or (= |v_P3_#t~nondet4_29| 1) (= |v_P3_#t~nondet4_29| 0)) (= (ite (= (mod |v_P3_#t~nondet4_29| 256) 0) 0 1) v_~weak$$choice2~0_30) (or (= |v_P3_#t~nondet3_29| 1) (= |v_P3_#t~nondet3_29| 0)) (= v_~b$w_buff0_used~0_133 (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_134 (ite .cse6 v_~b$w_buff0_used~0_134 (ite .cse7 0 v_~b$w_buff0_used~0_134))) 256) 0) 0 1)) (= (ite (= (mod |v_P3_#t~nondet3_29| 256) 0) 0 1) v_~weak$$choice0~0_7) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_123 (ite (or .cse1 .cse8 .cse4) v_~b$w_buff1_used~0_123 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_122) (= v_~b$flush_delayed~0_31 0) (= v_~b$r_buff1_thd4~0_61 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_63 256) 0))) (or (and .cse3 .cse9) (and .cse10 .cse9) .cse4)) v_~b$r_buff1_thd4~0_62 0)) 256) 0) 0 1)) (= v_~b~0_68 (ite (not (= (mod (ite .cse11 0 1) 256) 0)) v_~b$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_16)) (= v_~b$w_buff1~0_38 v_~b$w_buff1~0_37) (= v_~b$mem_tmp~0_18 v_~b~0_69))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_134, ~b~0=v_~b~0_69, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_123, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_38, ~b$w_buff0~0=v_~b$w_buff0~0_47, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_64} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_133, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_122, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_37, ~b$w_buff0~0=v_~b$w_buff0~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_63, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_29|, |v_P3_#t~nondet4_29|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][49], [Black: 130#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 128#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 63#true, 84#true, 133#true, Black: 74#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 70#(= ~z~0 0), Black: 76#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 61#true, 7#L796true, Black: 99#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 88#(not (= (mod ~main$tmp_guard1~0 256) 0)), 59#true, 29#L881true, Black: 86#(= ~__unbuffered_p3_EAX~0 0), Black: 97#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 87#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 95#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 125#true, 5#L845true, 57#true, 35#L803true, Black: 111#(= ~y~0 0), Black: 115#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 31#L766true, Black: 117#(and (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2025-01-09 16:28:23,011 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-01-09 16:28:23,011 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:28:23,011 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:28:23,011 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:28:23,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([403] L829-->L845: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse2 (= (mod v_~b$r_buff0_thd4~0_64 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_30 256) 0)) (.cse5 (not .cse2)) (.cse1 (and .cse10 .cse2)) (.cse8 (and .cse2 (= (mod v_~b$w_buff1_used~0_123 256) 0))) (.cse12 (= (mod v_~b$w_buff0_used~0_134 256) 0))) (let ((.cse6 (or .cse1 .cse8 .cse12)) (.cse7 (and .cse5 (not .cse12))) (.cse0 (not .cse11)) (.cse3 (= 0 (mod v_~b$w_buff1_used~0_122 256))) (.cse4 (= (mod v_~b$w_buff0_used~0_133 256) 0))) (and (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_64 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~b$r_buff0_thd4~0_64 (ite (and (not .cse4) .cse5) 0 v_~b$r_buff0_thd4~0_64))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_63) (= v_~__unbuffered_p3_EBX~0_16 (ite .cse6 v_~b~0_69 (ite .cse7 v_~b$w_buff0~0_47 v_~b$w_buff1~0_38))) (= v_~b$w_buff0~0_47 v_~b$w_buff0~0_46) (or (= |v_P3_#t~nondet4_29| 1) (= |v_P3_#t~nondet4_29| 0)) (= (ite (= (mod |v_P3_#t~nondet4_29| 256) 0) 0 1) v_~weak$$choice2~0_30) (or (= |v_P3_#t~nondet3_29| 1) (= |v_P3_#t~nondet3_29| 0)) (= v_~b$w_buff0_used~0_133 (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_134 (ite .cse6 v_~b$w_buff0_used~0_134 (ite .cse7 0 v_~b$w_buff0_used~0_134))) 256) 0) 0 1)) (= (ite (= (mod |v_P3_#t~nondet3_29| 256) 0) 0 1) v_~weak$$choice0~0_7) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_123 (ite (or .cse1 .cse8 .cse4) v_~b$w_buff1_used~0_123 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_122) (= v_~b$flush_delayed~0_31 0) (= v_~b$r_buff1_thd4~0_61 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_63 256) 0))) (or (and .cse3 .cse9) (and .cse10 .cse9) .cse4)) v_~b$r_buff1_thd4~0_62 0)) 256) 0) 0 1)) (= v_~b~0_68 (ite (not (= (mod (ite .cse11 0 1) 256) 0)) v_~b$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_16)) (= v_~b$w_buff1~0_38 v_~b$w_buff1~0_37) (= v_~b$mem_tmp~0_18 v_~b~0_69))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_134, ~b~0=v_~b~0_69, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_123, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_38, ~b$w_buff0~0=v_~b$w_buff0~0_47, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_64} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_133, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_122, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_37, ~b$w_buff0~0=v_~b$w_buff0~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_63, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_29|, |v_P3_#t~nondet4_29|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][49], [Black: 130#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 128#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 63#true, 84#true, 133#true, Black: 74#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 70#(= ~z~0 0), Black: 76#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 61#true, Black: 99#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 88#(not (= (mod ~main$tmp_guard1~0 256) 0)), 59#true, 29#L881true, Black: 86#(= ~__unbuffered_p3_EAX~0 0), Black: 97#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 87#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 95#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 125#true, 5#L845true, 57#true, 27#P1EXITtrue, 35#L803true, Black: 111#(= ~y~0 0), Black: 115#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 31#L766true, Black: 117#(and (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2025-01-09 16:28:23,444 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-01-09 16:28:23,444 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:28:23,445 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:28:23,445 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:28:23,446 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([403] L829-->L845: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse2 (= (mod v_~b$r_buff0_thd4~0_64 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_30 256) 0)) (.cse5 (not .cse2)) (.cse1 (and .cse10 .cse2)) (.cse8 (and .cse2 (= (mod v_~b$w_buff1_used~0_123 256) 0))) (.cse12 (= (mod v_~b$w_buff0_used~0_134 256) 0))) (let ((.cse6 (or .cse1 .cse8 .cse12)) (.cse7 (and .cse5 (not .cse12))) (.cse0 (not .cse11)) (.cse3 (= 0 (mod v_~b$w_buff1_used~0_122 256))) (.cse4 (= (mod v_~b$w_buff0_used~0_133 256) 0))) (and (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_64 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~b$r_buff0_thd4~0_64 (ite (and (not .cse4) .cse5) 0 v_~b$r_buff0_thd4~0_64))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_63) (= v_~__unbuffered_p3_EBX~0_16 (ite .cse6 v_~b~0_69 (ite .cse7 v_~b$w_buff0~0_47 v_~b$w_buff1~0_38))) (= v_~b$w_buff0~0_47 v_~b$w_buff0~0_46) (or (= |v_P3_#t~nondet4_29| 1) (= |v_P3_#t~nondet4_29| 0)) (= (ite (= (mod |v_P3_#t~nondet4_29| 256) 0) 0 1) v_~weak$$choice2~0_30) (or (= |v_P3_#t~nondet3_29| 1) (= |v_P3_#t~nondet3_29| 0)) (= v_~b$w_buff0_used~0_133 (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_134 (ite .cse6 v_~b$w_buff0_used~0_134 (ite .cse7 0 v_~b$w_buff0_used~0_134))) 256) 0) 0 1)) (= (ite (= (mod |v_P3_#t~nondet3_29| 256) 0) 0 1) v_~weak$$choice0~0_7) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_123 (ite (or .cse1 .cse8 .cse4) v_~b$w_buff1_used~0_123 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_122) (= v_~b$flush_delayed~0_31 0) (= v_~b$r_buff1_thd4~0_61 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_63 256) 0))) (or (and .cse3 .cse9) (and .cse10 .cse9) .cse4)) v_~b$r_buff1_thd4~0_62 0)) 256) 0) 0 1)) (= v_~b~0_68 (ite (not (= (mod (ite .cse11 0 1) 256) 0)) v_~b$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_16)) (= v_~b$w_buff1~0_38 v_~b$w_buff1~0_37) (= v_~b$mem_tmp~0_18 v_~b~0_69))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_134, ~b~0=v_~b~0_69, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_123, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_38, ~b$w_buff0~0=v_~b$w_buff0~0_47, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_64} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_133, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_122, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_37, ~b$w_buff0~0=v_~b$w_buff0~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_63, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_29|, |v_P3_#t~nondet4_29|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][49], [Black: 130#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 128#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 63#true, 84#true, 133#true, Black: 74#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 70#(= ~z~0 0), Black: 76#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 61#true, 7#L796true, 45#L887true, Black: 99#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 88#(not (= (mod ~main$tmp_guard1~0 256) 0)), 59#true, Black: 86#(= ~__unbuffered_p3_EAX~0 0), Black: 97#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 87#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 95#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 125#true, 57#true, 5#L845true, 35#L803true, Black: 111#(= ~y~0 0), Black: 115#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 31#L766true, Black: 117#(and (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2025-01-09 16:28:23,446 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-01-09 16:28:23,446 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:28:23,446 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:28:23,447 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:28:23,471 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L887-->L890: Formula: (= v_~main$tmp_guard1~0_1 (ite (= (ite (not (and (= 2 v_~y~0_3) (= v_~__unbuffered_p3_EBX~0_2 0) (= v_~__unbuffered_p0_EAX~0_2 0) (= v_~__unbuffered_p3_EAX~0_2 1) (= 2 v_~z~0_3))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_2, ~z~0=v_~z~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_2, ~y~0=v_~y~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_2, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_1, ~z~0=v_~z~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_2, ~y~0=v_~y~0_3} AuxVars[] AssignedVars[~main$tmp_guard1~0][71], [Black: 130#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 128#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 20#L829true, 63#true, 133#true, 84#true, Black: 74#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 70#(= ~z~0 0), Black: 76#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 61#true, 39#L890true, 7#L796true, Black: 99#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 88#(not (= (mod ~main$tmp_guard1~0 256) 0)), 59#true, Black: 86#(= ~__unbuffered_p3_EAX~0 0), Black: 97#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 87#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 95#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 125#true, 57#true, Black: 111#(= ~y~0 0), 35#L803true, 31#L766true, Black: 115#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 117#(and (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2025-01-09 16:28:23,471 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-01-09 16:28:23,471 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:28:23,472 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:28:23,472 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:28:24,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([403] L829-->L845: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse2 (= (mod v_~b$r_buff0_thd4~0_64 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_30 256) 0)) (.cse5 (not .cse2)) (.cse1 (and .cse10 .cse2)) (.cse8 (and .cse2 (= (mod v_~b$w_buff1_used~0_123 256) 0))) (.cse12 (= (mod v_~b$w_buff0_used~0_134 256) 0))) (let ((.cse6 (or .cse1 .cse8 .cse12)) (.cse7 (and .cse5 (not .cse12))) (.cse0 (not .cse11)) (.cse3 (= 0 (mod v_~b$w_buff1_used~0_122 256))) (.cse4 (= (mod v_~b$w_buff0_used~0_133 256) 0))) (and (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_64 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~b$r_buff0_thd4~0_64 (ite (and (not .cse4) .cse5) 0 v_~b$r_buff0_thd4~0_64))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_63) (= v_~__unbuffered_p3_EBX~0_16 (ite .cse6 v_~b~0_69 (ite .cse7 v_~b$w_buff0~0_47 v_~b$w_buff1~0_38))) (= v_~b$w_buff0~0_47 v_~b$w_buff0~0_46) (or (= |v_P3_#t~nondet4_29| 1) (= |v_P3_#t~nondet4_29| 0)) (= (ite (= (mod |v_P3_#t~nondet4_29| 256) 0) 0 1) v_~weak$$choice2~0_30) (or (= |v_P3_#t~nondet3_29| 1) (= |v_P3_#t~nondet3_29| 0)) (= v_~b$w_buff0_used~0_133 (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_134 (ite .cse6 v_~b$w_buff0_used~0_134 (ite .cse7 0 v_~b$w_buff0_used~0_134))) 256) 0) 0 1)) (= (ite (= (mod |v_P3_#t~nondet3_29| 256) 0) 0 1) v_~weak$$choice0~0_7) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_123 (ite (or .cse1 .cse8 .cse4) v_~b$w_buff1_used~0_123 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_122) (= v_~b$flush_delayed~0_31 0) (= v_~b$r_buff1_thd4~0_61 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_63 256) 0))) (or (and .cse3 .cse9) (and .cse10 .cse9) .cse4)) v_~b$r_buff1_thd4~0_62 0)) 256) 0) 0 1)) (= v_~b~0_68 (ite (not (= (mod (ite .cse11 0 1) 256) 0)) v_~b$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_16)) (= v_~b$w_buff1~0_38 v_~b$w_buff1~0_37) (= v_~b$mem_tmp~0_18 v_~b~0_69))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_134, ~b~0=v_~b~0_69, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_123, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_38, ~b$w_buff0~0=v_~b$w_buff0~0_47, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_64} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_133, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_122, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_37, ~b$w_buff0~0=v_~b$w_buff0~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_63, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_29|, |v_P3_#t~nondet4_29|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][49], [Black: 130#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 128#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 63#true, 84#true, 133#true, Black: 74#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 70#(= ~z~0 0), Black: 76#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 61#true, 45#L887true, Black: 99#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 88#(not (= (mod ~main$tmp_guard1~0 256) 0)), 59#true, Black: 86#(= ~__unbuffered_p3_EAX~0 0), Black: 97#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 87#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 95#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 125#true, 5#L845true, 57#true, 27#P1EXITtrue, 35#L803true, Black: 111#(= ~y~0 0), Black: 115#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 31#L766true, Black: 117#(and (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2025-01-09 16:28:24,004 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-01-09 16:28:24,004 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-09 16:28:24,004 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-09 16:28:24,004 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-09 16:28:24,022 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L887-->L890: Formula: (= v_~main$tmp_guard1~0_1 (ite (= (ite (not (and (= 2 v_~y~0_3) (= v_~__unbuffered_p3_EBX~0_2 0) (= v_~__unbuffered_p0_EAX~0_2 0) (= v_~__unbuffered_p3_EAX~0_2 1) (= 2 v_~z~0_3))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_2, ~z~0=v_~z~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_2, ~y~0=v_~y~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_2, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_1, ~z~0=v_~z~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_2, ~y~0=v_~y~0_3} AuxVars[] AssignedVars[~main$tmp_guard1~0][71], [Black: 130#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 128#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 20#L829true, 63#true, 133#true, 84#true, Black: 74#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 70#(= ~z~0 0), Black: 76#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 61#true, 39#L890true, Black: 99#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 88#(not (= (mod ~main$tmp_guard1~0 256) 0)), 59#true, Black: 86#(= ~__unbuffered_p3_EAX~0 0), Black: 97#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 87#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 95#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 125#true, 57#true, 27#P1EXITtrue, 35#L803true, Black: 111#(= ~y~0 0), 31#L766true, Black: 115#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 117#(and (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2025-01-09 16:28:24,022 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-01-09 16:28:24,022 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-09 16:28:24,022 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-09 16:28:24,022 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-09 16:28:27,277 INFO L124 PetriNetUnfolderBase]: 38566/59279 cut-off events. [2025-01-09 16:28:27,277 INFO L125 PetriNetUnfolderBase]: For 108733/111754 co-relation queries the response was YES. [2025-01-09 16:28:27,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169970 conditions, 59279 events. 38566/59279 cut-off events. For 108733/111754 co-relation queries the response was YES. Maximal size of possible extension queue 3042. Compared 502896 event pairs, 15188 based on Foata normal form. 1390/56086 useless extension candidates. Maximal degree in co-relation 169942. Up to 21077 conditions per place. [2025-01-09 16:28:27,952 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 90 selfloop transitions, 11 changer transitions 0/126 dead transitions. [2025-01-09 16:28:27,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 126 transitions, 754 flow [2025-01-09 16:28:27,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:28:27,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:28:27,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 233 transitions. [2025-01-09 16:28:27,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6657142857142857 [2025-01-09 16:28:27,957 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 292 flow. Second operand 7 states and 233 transitions. [2025-01-09 16:28:27,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 126 transitions, 754 flow [2025-01-09 16:28:27,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 126 transitions, 746 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-09 16:28:28,002 INFO L231 Difference]: Finished difference. Result has 83 places, 62 transitions, 390 flow [2025-01-09 16:28:28,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=390, PETRI_PLACES=83, PETRI_TRANSITIONS=62} [2025-01-09 16:28:28,005 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 25 predicate places. [2025-01-09 16:28:28,005 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 62 transitions, 390 flow [2025-01-09 16:28:28,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:28,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:28,005 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:28,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:28:28,005 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:28,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:28,006 INFO L85 PathProgramCache]: Analyzing trace with hash -196924306, now seen corresponding path program 1 times [2025-01-09 16:28:28,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:28,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160468233] [2025-01-09 16:28:28,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:28,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:28,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:28:28,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:28:28,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:28,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:28,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:28,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160468233] [2025-01-09 16:28:28,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160468233] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:28,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:28,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:28:28,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035124827] [2025-01-09 16:28:28,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:28,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:28:28,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:28,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:28:28,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:28:28,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-01-09 16:28:28,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 62 transitions, 390 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:28,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:28,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-01-09 16:28:28,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:33,700 INFO L124 PetriNetUnfolderBase]: 42534/62270 cut-off events. [2025-01-09 16:28:33,701 INFO L125 PetriNetUnfolderBase]: For 101098/103135 co-relation queries the response was YES. [2025-01-09 16:28:33,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175841 conditions, 62270 events. 42534/62270 cut-off events. For 101098/103135 co-relation queries the response was YES. Maximal size of possible extension queue 2771. Compared 468606 event pairs, 5516 based on Foata normal form. 2380/62590 useless extension candidates. Maximal degree in co-relation 175808. Up to 23653 conditions per place. [2025-01-09 16:28:34,117 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 73 selfloop transitions, 10 changer transitions 3/112 dead transitions. [2025-01-09 16:28:34,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 112 transitions, 718 flow [2025-01-09 16:28:34,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:28:34,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:28:34,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2025-01-09 16:28:34,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.724 [2025-01-09 16:28:34,119 INFO L175 Difference]: Start difference. First operand has 83 places, 62 transitions, 390 flow. Second operand 5 states and 181 transitions. [2025-01-09 16:28:34,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 112 transitions, 718 flow [2025-01-09 16:28:34,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 112 transitions, 692 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-01-09 16:28:34,711 INFO L231 Difference]: Finished difference. Result has 88 places, 64 transitions, 399 flow [2025-01-09 16:28:34,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=399, PETRI_PLACES=88, PETRI_TRANSITIONS=64} [2025-01-09 16:28:34,711 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 30 predicate places. [2025-01-09 16:28:34,711 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 64 transitions, 399 flow [2025-01-09 16:28:34,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:34,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:34,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:34,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:28:34,712 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:34,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:34,713 INFO L85 PathProgramCache]: Analyzing trace with hash 791000384, now seen corresponding path program 1 times [2025-01-09 16:28:34,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:34,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583732191] [2025-01-09 16:28:34,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:34,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:34,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:28:34,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:28:34,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:34,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:35,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:35,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:35,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583732191] [2025-01-09 16:28:35,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583732191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:35,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:35,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:28:35,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041373865] [2025-01-09 16:28:35,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:35,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:28:35,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:35,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:28:35,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:28:35,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-01-09 16:28:35,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 64 transitions, 399 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:35,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:35,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-01-09 16:28:35,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand