./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 03b62196b25662d8efd4f9890b2a9ba3be7263fa8e2874a92734800e01910b00 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 14:24:36,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 14:24:36,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 14:24:36,329 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 14:24:36,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 14:24:36,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 14:24:36,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 14:24:36,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 14:24:36,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 14:24:36,350 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 14:24:36,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 14:24:36,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 14:24:36,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 14:24:36,351 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 14:24:36,351 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 14:24:36,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 14:24:36,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 14:24:36,352 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 14:24:36,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 14:24:36,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 14:24:36,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 14:24:36,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 14:24:36,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 14:24:36,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 14:24:36,354 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 14:24:36,354 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 14:24:36,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 14:24:36,355 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 14:24:36,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 14:24:36,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 14:24:36,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 14:24:36,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 14:24:36,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:24:36,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 14:24:36,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 14:24:36,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 14:24:36,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 14:24:36,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 14:24:36,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 14:24:36,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 14:24:36,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 14:24:36,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 14:24:36,359 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 03b62196b25662d8efd4f9890b2a9ba3be7263fa8e2874a92734800e01910b00 [2024-10-14 14:24:36,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 14:24:36,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 14:24:36,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 14:24:36,616 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 14:24:36,617 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 14:24:36,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2024-10-14 14:24:37,967 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 14:24:38,179 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 14:24:38,180 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2024-10-14 14:24:38,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1a19f11/f193b44f2c85442c876df9e1b4f2dde4/FLAG1ec5aff5e [2024-10-14 14:24:38,208 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1a19f11/f193b44f2c85442c876df9e1b4f2dde4 [2024-10-14 14:24:38,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 14:24:38,211 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 14:24:38,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 14:24:38,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 14:24:38,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 14:24:38,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:24:38" (1/1) ... [2024-10-14 14:24:38,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d911c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:38, skipping insertion in model container [2024-10-14 14:24:38,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:24:38" (1/1) ... [2024-10-14 14:24:38,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 14:24:38,430 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-10-14 14:24:38,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:24:38,640 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 14:24:38,655 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-10-14 14:24:38,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:24:38,735 INFO L204 MainTranslator]: Completed translation [2024-10-14 14:24:38,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:38 WrapperNode [2024-10-14 14:24:38,736 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 14:24:38,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 14:24:38,738 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 14:24:38,738 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 14:24:38,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:38" (1/1) ... [2024-10-14 14:24:38,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:38" (1/1) ... [2024-10-14 14:24:38,791 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2024-10-14 14:24:38,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 14:24:38,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 14:24:38,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 14:24:38,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 14:24:38,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:38" (1/1) ... [2024-10-14 14:24:38,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:38" (1/1) ... [2024-10-14 14:24:38,808 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:38" (1/1) ... [2024-10-14 14:24:38,836 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]. [2024-10-14 14:24:38,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:38" (1/1) ... [2024-10-14 14:24:38,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:38" (1/1) ... [2024-10-14 14:24:38,846 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:38" (1/1) ... [2024-10-14 14:24:38,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:38" (1/1) ... [2024-10-14 14:24:38,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:38" (1/1) ... [2024-10-14 14:24:38,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:38" (1/1) ... [2024-10-14 14:24:38,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 14:24:38,861 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 14:24:38,861 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 14:24:38,861 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 14:24:38,862 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:38" (1/1) ... [2024-10-14 14:24:38,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:24:38,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:24:38,893 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 14:24:38,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 14:24:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 14:24:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 14:24:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-14 14:24:38,944 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-14 14:24:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-14 14:24:38,945 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-14 14:24:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-14 14:24:38,945 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-14 14:24:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-14 14:24:38,945 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-14 14:24:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 14:24:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 14:24:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 14:24:38,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 14:24:38,946 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 14:24:39,080 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 14:24:39,081 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 14:24:39,391 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 14:24:39,392 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 14:24:39,589 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 14:24:39,590 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 14:24:39,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:24:39 BoogieIcfgContainer [2024-10-14 14:24:39,590 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 14:24:39,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 14:24:39,592 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 14:24:39,595 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 14:24:39,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:24:38" (1/3) ... [2024-10-14 14:24:39,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762c1aef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:24:39, skipping insertion in model container [2024-10-14 14:24:39,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:38" (2/3) ... [2024-10-14 14:24:39,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762c1aef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:24:39, skipping insertion in model container [2024-10-14 14:24:39,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:24:39" (3/3) ... [2024-10-14 14:24:39,599 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_power.oepc_pso.oepc_rmo.oepc.i [2024-10-14 14:24:39,622 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 14:24:39,622 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 14:24:39,622 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 14:24:39,708 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-14 14:24:39,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 48 transitions, 112 flow [2024-10-14 14:24:39,776 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2024-10-14 14:24:39,777 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 14:24:39,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 90 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2024-10-14 14:24:39,782 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 48 transitions, 112 flow [2024-10-14 14:24:39,785 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 44 transitions, 100 flow [2024-10-14 14:24:39,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 14:24:39,795 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;@2abf13f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 14:24:39,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-14 14:24:39,798 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 14:24:39,798 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-14 14:24:39,798 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 14:24:39,798 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:24:39,799 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-14 14:24:39,799 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:24:39,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:24:39,803 INFO L85 PathProgramCache]: Analyzing trace with hash 12312705, now seen corresponding path program 1 times [2024-10-14 14:24:39,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:24:39,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30674942] [2024-10-14 14:24:39,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:24:39,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:24:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:24:40,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:24:40,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:24:40,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30674942] [2024-10-14 14:24:40,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30674942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:24:40,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:24:40,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 14:24:40,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000880413] [2024-10-14 14:24:40,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:24:40,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 14:24:40,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:24:40,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 14:24:40,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:24:40,187 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 48 [2024-10-14 14:24:40,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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) [2024-10-14 14:24:40,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:24:40,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 48 [2024-10-14 14:24:40,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:24:40,873 INFO L124 PetriNetUnfolderBase]: 2495/4127 cut-off events. [2024-10-14 14:24:40,874 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-10-14 14:24:40,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7703 conditions, 4127 events. 2495/4127 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 28758 event pairs, 443 based on Foata normal form. 135/4199 useless extension candidates. Maximal degree in co-relation 7691. Up to 2779 conditions per place. [2024-10-14 14:24:40,897 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 37 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2024-10-14 14:24:40,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 223 flow [2024-10-14 14:24:40,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 14:24:40,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 14:24:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-10-14 14:24:40,908 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7847222222222222 [2024-10-14 14:24:40,909 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 113 transitions. [2024-10-14 14:24:40,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 223 flow [2024-10-14 14:24:40,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 216 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-14 14:24:40,917 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 94 flow [2024-10-14 14:24:40,918 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2024-10-14 14:24:40,921 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places. [2024-10-14 14:24:40,922 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 94 flow [2024-10-14 14:24:40,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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) [2024-10-14 14:24:40,923 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:24:40,923 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:24:40,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 14:24:40,923 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)] === [2024-10-14 14:24:40,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:24:40,925 INFO L85 PathProgramCache]: Analyzing trace with hash -285260819, now seen corresponding path program 1 times [2024-10-14 14:24:40,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:24:40,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525599830] [2024-10-14 14:24:40,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:24:40,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:24:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:24:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:24:41,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:24:41,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525599830] [2024-10-14 14:24:41,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525599830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:24:41,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:24:41,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:24:41,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405998772] [2024-10-14 14:24:41,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:24:41,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:24:41,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:24:41,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:24:41,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:24:41,220 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2024-10-14 14:24:41,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:24:41,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:24:41,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2024-10-14 14:24:41,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:24:45,686 INFO L124 PetriNetUnfolderBase]: 30055/43249 cut-off events. [2024-10-14 14:24:45,687 INFO L125 PetriNetUnfolderBase]: For 1809/1809 co-relation queries the response was YES. [2024-10-14 14:24:45,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86002 conditions, 43249 events. 30055/43249 cut-off events. For 1809/1809 co-relation queries the response was YES. Maximal size of possible extension queue 1933. Compared 307943 event pairs, 7191 based on Foata normal form. 0/42112 useless extension candidates. Maximal degree in co-relation 85992. Up to 15129 conditions per place. [2024-10-14 14:24:45,873 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 46 selfloop transitions, 7 changer transitions 97/161 dead transitions. [2024-10-14 14:24:45,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 161 transitions, 652 flow [2024-10-14 14:24:45,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 14:24:45,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-14 14:24:45,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 287 transitions. [2024-10-14 14:24:45,876 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6643518518518519 [2024-10-14 14:24:45,876 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 9 states and 287 transitions. [2024-10-14 14:24:45,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 161 transitions, 652 flow [2024-10-14 14:24:45,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 161 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 14:24:45,882 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 186 flow [2024-10-14 14:24:45,883 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=186, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2024-10-14 14:24:45,883 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 10 predicate places. [2024-10-14 14:24:45,883 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 186 flow [2024-10-14 14:24:45,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:24:45,884 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:24:45,884 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:24:45,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 14:24:45,884 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)] === [2024-10-14 14:24:45,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:24:45,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1474582094, now seen corresponding path program 1 times [2024-10-14 14:24:45,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:24:45,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205429487] [2024-10-14 14:24:45,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:24:45,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:24:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:24:46,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:24:46,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:24:46,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205429487] [2024-10-14 14:24:46,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205429487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:24:46,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:24:46,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:24:46,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340274872] [2024-10-14 14:24:46,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:24:46,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:24:46,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:24:46,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:24:46,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:24:46,025 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2024-10-14 14:24:46,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 46 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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) [2024-10-14 14:24:46,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:24:46,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2024-10-14 14:24:46,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:24:49,722 INFO L124 PetriNetUnfolderBase]: 22992/33548 cut-off events. [2024-10-14 14:24:49,723 INFO L125 PetriNetUnfolderBase]: For 48000/48192 co-relation queries the response was YES. [2024-10-14 14:24:49,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97339 conditions, 33548 events. 22992/33548 cut-off events. For 48000/48192 co-relation queries the response was YES. Maximal size of possible extension queue 1522. Compared 236796 event pairs, 3634 based on Foata normal form. 889/34386 useless extension candidates. Maximal degree in co-relation 97321. Up to 14004 conditions per place. [2024-10-14 14:24:49,919 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 62 selfloop transitions, 11 changer transitions 92/176 dead transitions. [2024-10-14 14:24:49,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 176 transitions, 1112 flow [2024-10-14 14:24:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 14:24:49,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-14 14:24:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 305 transitions. [2024-10-14 14:24:49,921 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2024-10-14 14:24:49,921 INFO L175 Difference]: Start difference. First operand has 66 places, 46 transitions, 186 flow. Second operand 10 states and 305 transitions. [2024-10-14 14:24:49,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 176 transitions, 1112 flow [2024-10-14 14:24:50,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 176 transitions, 982 flow, removed 31 selfloop flow, removed 4 redundant places. [2024-10-14 14:24:50,052 INFO L231 Difference]: Finished difference. Result has 73 places, 53 transitions, 284 flow [2024-10-14 14:24:50,053 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=284, PETRI_PLACES=73, PETRI_TRANSITIONS=53} [2024-10-14 14:24:50,054 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 17 predicate places. [2024-10-14 14:24:50,054 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 53 transitions, 284 flow [2024-10-14 14:24:50,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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) [2024-10-14 14:24:50,054 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:24:50,055 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:24:50,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 14:24:50,055 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)] === [2024-10-14 14:24:50,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:24:50,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1651898126, now seen corresponding path program 1 times [2024-10-14 14:24:50,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:24:50,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072489541] [2024-10-14 14:24:50,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:24:50,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:24:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:24:50,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:24:50,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:24:50,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072489541] [2024-10-14 14:24:50,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072489541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:24:50,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:24:50,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:24:50,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113661788] [2024-10-14 14:24:50,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:24:50,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:24:50,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:24:50,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:24:50,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:24:50,271 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2024-10-14 14:24:50,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 53 transitions, 284 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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) [2024-10-14 14:24:50,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:24:50,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2024-10-14 14:24:50,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:24:53,790 INFO L124 PetriNetUnfolderBase]: 21434/31423 cut-off events. [2024-10-14 14:24:53,790 INFO L125 PetriNetUnfolderBase]: For 85683/85829 co-relation queries the response was YES. [2024-10-14 14:24:53,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99927 conditions, 31423 events. 21434/31423 cut-off events. For 85683/85829 co-relation queries the response was YES. Maximal size of possible extension queue 1378. Compared 219484 event pairs, 4531 based on Foata normal form. 727/32112 useless extension candidates. Maximal degree in co-relation 99902. Up to 13415 conditions per place. [2024-10-14 14:24:53,984 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 67 selfloop transitions, 17 changer transitions 78/173 dead transitions. [2024-10-14 14:24:53,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 173 transitions, 1162 flow [2024-10-14 14:24:53,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 14:24:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-14 14:24:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 303 transitions. [2024-10-14 14:24:53,986 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.63125 [2024-10-14 14:24:53,986 INFO L175 Difference]: Start difference. First operand has 73 places, 53 transitions, 284 flow. Second operand 10 states and 303 transitions. [2024-10-14 14:24:53,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 173 transitions, 1162 flow [2024-10-14 14:24:54,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 173 transitions, 1134 flow, removed 14 selfloop flow, removed 0 redundant places. [2024-10-14 14:24:54,290 INFO L231 Difference]: Finished difference. Result has 84 places, 60 transitions, 418 flow [2024-10-14 14:24:54,290 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=418, PETRI_PLACES=84, PETRI_TRANSITIONS=60} [2024-10-14 14:24:54,291 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 28 predicate places. [2024-10-14 14:24:54,291 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 60 transitions, 418 flow [2024-10-14 14:24:54,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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) [2024-10-14 14:24:54,291 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:24:54,292 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:24:54,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 14:24:54,292 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)] === [2024-10-14 14:24:54,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:24:54,292 INFO L85 PathProgramCache]: Analyzing trace with hash -62916695, now seen corresponding path program 1 times [2024-10-14 14:24:54,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:24:54,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279699265] [2024-10-14 14:24:54,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:24:54,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:24:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:24:54,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:24:54,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:24:54,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279699265] [2024-10-14 14:24:54,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279699265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:24:54,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:24:54,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 14:24:54,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132919263] [2024-10-14 14:24:54,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:24:54,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:24:54,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:24:54,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:24:54,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:24:54,537 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-10-14 14:24:54,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 60 transitions, 418 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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) [2024-10-14 14:24:54,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:24:54,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-10-14 14:24:54,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:24:59,580 INFO L124 PetriNetUnfolderBase]: 30631/46014 cut-off events. [2024-10-14 14:24:59,581 INFO L125 PetriNetUnfolderBase]: For 86213/89596 co-relation queries the response was YES. [2024-10-14 14:24:59,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123503 conditions, 46014 events. 30631/46014 cut-off events. For 86213/89596 co-relation queries the response was YES. Maximal size of possible extension queue 2139. Compared 353138 event pairs, 5331 based on Foata normal form. 2371/46849 useless extension candidates. Maximal degree in co-relation 123468. Up to 22867 conditions per place. [2024-10-14 14:24:59,949 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 60 selfloop transitions, 6 changer transitions 0/96 dead transitions. [2024-10-14 14:24:59,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 96 transitions, 680 flow [2024-10-14 14:24:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:24:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 14:24:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2024-10-14 14:24:59,953 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6927083333333334 [2024-10-14 14:24:59,953 INFO L175 Difference]: Start difference. First operand has 84 places, 60 transitions, 418 flow. Second operand 4 states and 133 transitions. [2024-10-14 14:24:59,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 96 transitions, 680 flow [2024-10-14 14:25:00,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 96 transitions, 628 flow, removed 26 selfloop flow, removed 10 redundant places. [2024-10-14 14:25:00,474 INFO L231 Difference]: Finished difference. Result has 73 places, 65 transitions, 420 flow [2024-10-14 14:25:00,475 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=420, PETRI_PLACES=73, PETRI_TRANSITIONS=65} [2024-10-14 14:25:00,475 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 17 predicate places. [2024-10-14 14:25:00,475 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 65 transitions, 420 flow [2024-10-14 14:25:00,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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) [2024-10-14 14:25:00,476 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:25:00,476 INFO L204 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] [2024-10-14 14:25:00,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 14:25:00,476 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)] === [2024-10-14 14:25:00,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:25:00,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1427504700, now seen corresponding path program 1 times [2024-10-14 14:25:00,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:25:00,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100248585] [2024-10-14 14:25:00,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:25:00,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:25:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:25:00,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:25:00,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:25:00,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100248585] [2024-10-14 14:25:00,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100248585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:25:00,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:25:00,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:25:00,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055500856] [2024-10-14 14:25:00,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:25:00,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:25:00,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:25:00,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:25:00,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:25:00,623 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-10-14 14:25:00,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 65 transitions, 420 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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) [2024-10-14 14:25:00,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:25:00,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-10-14 14:25:00,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:25:02,210 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L802-->L809: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_93 256) 0))) (.cse2 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_94 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_81 256) 0)))) (.cse4 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_26 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse2 (not (= (mod v_~a$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse3)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_93 (ite (= (mod (ite .cse0 0 v_~a$w_buff0_used~0_94) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse4 .cse1) 0 v_~a$w_buff1_used~0_81) 256) 0) 0 1) v_~a$w_buff1_used~0_80) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse4 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_94, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_81} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_93, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_80} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][58], [Black: 115#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 139#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 114#(= ~x~0 0), 24#P0EXITtrue, 87#true, Black: 141#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 69#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 72#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 74#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 76#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 61#true, Black: 68#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 59#true, Black: 90#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 16#L866-4true, Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 41#L842true, Black: 89#(= ~y~0 0), Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 5#L809true, 146#(= ~x~0 1), 57#true, 112#true, 31#L782true, 55#true]) [2024-10-14 14:25:02,211 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-10-14 14:25:02,211 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-14 14:25:02,211 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-14 14:25:02,211 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-14 14:25:02,768 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L802-->L809: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_93 256) 0))) (.cse2 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_94 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_81 256) 0)))) (.cse4 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_26 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse2 (not (= (mod v_~a$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse3)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_93 (ite (= (mod (ite .cse0 0 v_~a$w_buff0_used~0_94) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse4 .cse1) 0 v_~a$w_buff1_used~0_81) 256) 0) 0 1) v_~a$w_buff1_used~0_80) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse4 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_94, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_81} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_93, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_80} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][58], [Black: 115#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 139#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 114#(= ~x~0 0), 24#P0EXITtrue, 33#L867true, 87#true, Black: 141#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 69#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 72#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 74#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 76#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 61#true, Black: 68#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 59#true, Black: 90#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 41#L842true, Black: 89#(= ~y~0 0), Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 146#(= ~x~0 1), 5#L809true, 57#true, 112#true, 31#L782true, 55#true]) [2024-10-14 14:25:02,768 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-14 14:25:02,768 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-14 14:25:02,769 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-14 14:25:02,769 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-14 14:25:03,343 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L802-->L809: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_93 256) 0))) (.cse2 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_94 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_81 256) 0)))) (.cse4 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_26 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse2 (not (= (mod v_~a$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse3)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_93 (ite (= (mod (ite .cse0 0 v_~a$w_buff0_used~0_94) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse4 .cse1) 0 v_~a$w_buff1_used~0_81) 256) 0) 0 1) v_~a$w_buff1_used~0_80) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse4 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_94, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_81} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_93, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_80} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][58], [Black: 115#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 139#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 114#(= ~x~0 0), 24#P0EXITtrue, 87#true, Black: 69#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 72#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 74#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 76#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 61#true, Black: 68#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 59#true, Black: 90#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 16#L866-4true, Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 89#(= ~y~0 0), Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 5#L809true, 146#(= ~x~0 1), 57#true, 112#true, 31#L782true, 11#P3EXITtrue, 55#true]) [2024-10-14 14:25:03,344 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-14 14:25:03,344 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 14:25:03,344 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 14:25:03,344 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 14:25:03,951 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L802-->L809: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_93 256) 0))) (.cse2 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_94 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_81 256) 0)))) (.cse4 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_26 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse2 (not (= (mod v_~a$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse3)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_93 (ite (= (mod (ite .cse0 0 v_~a$w_buff0_used~0_94) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse4 .cse1) 0 v_~a$w_buff1_used~0_81) 256) 0) 0 1) v_~a$w_buff1_used~0_80) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse4 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_94, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_81} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_93, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_80} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][58], [Black: 115#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 114#(= ~x~0 0), 24#P0EXITtrue, 87#true, Black: 139#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 69#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 72#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 74#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 76#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 61#true, Black: 68#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 26#L871true, 59#true, Black: 90#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 41#L842true, Black: 89#(= ~y~0 0), Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 136#true, 57#true, 146#(= ~x~0 1), 5#L809true, 112#true, 31#L782true, 55#true]) [2024-10-14 14:25:03,951 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-14 14:25:03,951 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 14:25:03,951 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 14:25:03,951 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 14:25:03,952 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L802-->L809: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_93 256) 0))) (.cse2 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_94 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_81 256) 0)))) (.cse4 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_26 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse2 (not (= (mod v_~a$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse3)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_93 (ite (= (mod (ite .cse0 0 v_~a$w_buff0_used~0_94) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse4 .cse1) 0 v_~a$w_buff1_used~0_81) 256) 0) 0 1) v_~a$w_buff1_used~0_80) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse4 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_94, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_81} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_93, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_80} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][58], [Black: 115#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 139#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 114#(= ~x~0 0), 24#P0EXITtrue, 33#L867true, 87#true, Black: 69#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 72#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 74#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 76#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 61#true, Black: 68#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 59#true, Black: 90#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 89#(= ~y~0 0), Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 146#(= ~x~0 1), 5#L809true, 57#true, 112#true, 31#L782true, 11#P3EXITtrue, 55#true]) [2024-10-14 14:25:03,952 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-14 14:25:03,952 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 14:25:03,952 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 14:25:03,952 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 14:25:03,961 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L802-->L809: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_93 256) 0))) (.cse2 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_94 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_81 256) 0)))) (.cse4 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_26 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse2 (not (= (mod v_~a$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse3)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_93 (ite (= (mod (ite .cse0 0 v_~a$w_buff0_used~0_94) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse4 .cse1) 0 v_~a$w_buff1_used~0_81) 256) 0) 0 1) v_~a$w_buff1_used~0_80) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse4 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_94, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_81} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_93, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_80} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][58], [Black: 115#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 114#(= ~x~0 0), 18#L877true, 87#true, Black: 139#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 69#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 72#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 74#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 76#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 61#true, Black: 68#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 22#L772true, 59#true, Black: 90#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 41#L842true, Black: 89#(= ~y~0 0), Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 146#(= ~x~0 1), 5#L809true, 136#true, 57#true, 112#true, 31#L782true, 55#true]) [2024-10-14 14:25:03,961 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-14 14:25:03,961 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 14:25:03,961 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 14:25:03,961 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 14:25:04,544 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L802-->L809: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_93 256) 0))) (.cse2 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_94 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_81 256) 0)))) (.cse4 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_26 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse2 (not (= (mod v_~a$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse3)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_93 (ite (= (mod (ite .cse0 0 v_~a$w_buff0_used~0_94) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse4 .cse1) 0 v_~a$w_buff1_used~0_81) 256) 0) 0 1) v_~a$w_buff1_used~0_80) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse4 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_94, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_81} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_93, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_80} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][58], [Black: 115#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 114#(= ~x~0 0), 24#P0EXITtrue, 18#L877true, 87#true, Black: 139#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 69#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 72#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 74#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 76#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 61#true, Black: 68#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 59#true, Black: 90#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 41#L842true, Black: 89#(= ~y~0 0), Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 136#true, 5#L809true, 146#(= ~x~0 1), 57#true, 112#true, 31#L782true, 55#true]) [2024-10-14 14:25:04,545 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-14 14:25:04,545 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-14 14:25:04,545 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-14 14:25:04,545 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-14 14:25:04,550 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([355] L877-->L880: Formula: (= v_~main$tmp_guard1~0_1 (ite (= (ite (not (and (= 2 v_~x~0_3) (= v_~__unbuffered_p3_EAX~0_2 0) (= v_~__unbuffered_p2_EAX~0_2 0) (= 2 v_~y~0_3))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~y~0=v_~y~0_3, ~x~0=v_~x~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~y~0=v_~y~0_3, ~x~0=v_~x~0_3} AuxVars[] AssignedVars[~main$tmp_guard1~0][80], [Black: 115#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 30#L880true, Black: 114#(= ~x~0 0), 87#true, Black: 139#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 69#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 72#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 74#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 76#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 61#true, Black: 68#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 22#L772true, 59#true, Black: 90#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 41#L842true, Black: 89#(= ~y~0 0), Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), 136#true, 57#true, 34#L802true, 112#true, 31#L782true, 55#true]) [2024-10-14 14:25:04,550 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2024-10-14 14:25:04,550 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-10-14 14:25:04,550 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-10-14 14:25:04,550 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-10-14 14:25:04,916 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([355] L877-->L880: Formula: (= v_~main$tmp_guard1~0_1 (ite (= (ite (not (and (= 2 v_~x~0_3) (= v_~__unbuffered_p3_EAX~0_2 0) (= v_~__unbuffered_p2_EAX~0_2 0) (= 2 v_~y~0_3))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~y~0=v_~y~0_3, ~x~0=v_~x~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~y~0=v_~y~0_3, ~x~0=v_~x~0_3} AuxVars[] AssignedVars[~main$tmp_guard1~0][80], [Black: 115#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 30#L880true, Black: 114#(= ~x~0 0), 24#P0EXITtrue, 87#true, Black: 139#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 69#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 72#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 74#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 76#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 61#true, Black: 68#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 59#true, Black: 90#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 41#L842true, Black: 89#(= ~y~0 0), Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), 136#true, 57#true, 34#L802true, 112#true, 31#L782true, 55#true]) [2024-10-14 14:25:04,917 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2024-10-14 14:25:04,917 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-10-14 14:25:04,917 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-10-14 14:25:04,917 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-10-14 14:25:04,922 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L802-->L809: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_93 256) 0))) (.cse2 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_94 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_81 256) 0)))) (.cse4 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_26 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse2 (not (= (mod v_~a$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse3)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_93 (ite (= (mod (ite .cse0 0 v_~a$w_buff0_used~0_94) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse4 .cse1) 0 v_~a$w_buff1_used~0_81) 256) 0) 0 1) v_~a$w_buff1_used~0_80) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse4 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_94, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_81} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_93, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_80} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][58], [Black: 115#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 114#(= ~x~0 0), 24#P0EXITtrue, 87#true, Black: 139#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 69#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 72#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 74#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 76#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 61#true, Black: 68#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 26#L871true, 59#true, Black: 90#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 89#(= ~y~0 0), Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 136#true, 57#true, 5#L809true, 146#(= ~x~0 1), 112#true, 31#L782true, 11#P3EXITtrue, 55#true]) [2024-10-14 14:25:04,922 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-14 14:25:04,922 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 14:25:04,922 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 14:25:04,923 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 14:25:04,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L802-->L809: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_93 256) 0))) (.cse2 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_94 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_81 256) 0)))) (.cse4 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_26 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse2 (not (= (mod v_~a$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse3)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_93 (ite (= (mod (ite .cse0 0 v_~a$w_buff0_used~0_94) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse4 .cse1) 0 v_~a$w_buff1_used~0_81) 256) 0) 0 1) v_~a$w_buff1_used~0_80) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse4 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_94, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_81} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_93, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_80} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][58], [Black: 115#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 114#(= ~x~0 0), 18#L877true, 87#true, Black: 139#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 69#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 72#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 74#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 76#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 61#true, Black: 68#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 22#L772true, 59#true, Black: 90#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 89#(= ~y~0 0), Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 146#(= ~x~0 1), 5#L809true, 136#true, 57#true, 112#true, 31#L782true, 11#P3EXITtrue, 55#true]) [2024-10-14 14:25:04,930 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-14 14:25:04,930 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 14:25:04,930 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 14:25:04,930 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 14:25:04,930 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([355] L877-->L880: Formula: (= v_~main$tmp_guard1~0_1 (ite (= (ite (not (and (= 2 v_~x~0_3) (= v_~__unbuffered_p3_EAX~0_2 0) (= v_~__unbuffered_p2_EAX~0_2 0) (= 2 v_~y~0_3))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~y~0=v_~y~0_3, ~x~0=v_~x~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~y~0=v_~y~0_3, ~x~0=v_~x~0_3} AuxVars[] AssignedVars[~main$tmp_guard1~0][80], [Black: 115#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 30#L880true, Black: 114#(= ~x~0 0), 87#true, Black: 139#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 69#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 72#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 74#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 76#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 61#true, Black: 68#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 22#L772true, 59#true, Black: 90#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 89#(= ~y~0 0), Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), 136#true, 57#true, 34#L802true, 112#true, 31#L782true, 11#P3EXITtrue, 55#true]) [2024-10-14 14:25:04,930 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-14 14:25:04,930 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 14:25:04,930 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 14:25:04,930 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 14:25:05,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L802-->L809: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_93 256) 0))) (.cse2 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_94 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_81 256) 0)))) (.cse4 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_26 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse2 (not (= (mod v_~a$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse3)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_93 (ite (= (mod (ite .cse0 0 v_~a$w_buff0_used~0_94) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse4 .cse1) 0 v_~a$w_buff1_used~0_81) 256) 0) 0 1) v_~a$w_buff1_used~0_80) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse4 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_94, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_81} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_93, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_80} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][58], [Black: 115#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 114#(= ~x~0 0), 24#P0EXITtrue, 18#L877true, 87#true, Black: 139#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 69#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 72#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 74#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 76#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 61#true, Black: 68#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 59#true, Black: 90#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 89#(= ~y~0 0), Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 136#true, 57#true, 5#L809true, 146#(= ~x~0 1), 112#true, 31#L782true, 11#P3EXITtrue, 55#true]) [2024-10-14 14:25:05,439 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-14 14:25:05,439 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 14:25:05,439 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 14:25:05,439 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 14:25:05,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([355] L877-->L880: Formula: (= v_~main$tmp_guard1~0_1 (ite (= (ite (not (and (= 2 v_~x~0_3) (= v_~__unbuffered_p3_EAX~0_2 0) (= v_~__unbuffered_p2_EAX~0_2 0) (= 2 v_~y~0_3))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~y~0=v_~y~0_3, ~x~0=v_~x~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~y~0=v_~y~0_3, ~x~0=v_~x~0_3} AuxVars[] AssignedVars[~main$tmp_guard1~0][80], [Black: 115#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 30#L880true, 24#P0EXITtrue, Black: 114#(= ~x~0 0), 87#true, Black: 139#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 69#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 72#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 74#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 76#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 61#true, Black: 68#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 59#true, Black: 90#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 89#(= ~y~0 0), Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), 57#true, 136#true, 34#L802true, 112#true, 31#L782true, 11#P3EXITtrue, 55#true]) [2024-10-14 14:25:05,439 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-14 14:25:05,439 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 14:25:05,440 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 14:25:05,440 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 14:25:06,895 INFO L124 PetriNetUnfolderBase]: 37038/57472 cut-off events. [2024-10-14 14:25:06,896 INFO L125 PetriNetUnfolderBase]: For 90734/94964 co-relation queries the response was YES. [2024-10-14 14:25:07,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163955 conditions, 57472 events. 37038/57472 cut-off events. For 90734/94964 co-relation queries the response was YES. Maximal size of possible extension queue 3109. Compared 496245 event pairs, 16796 based on Foata normal form. 1926/54516 useless extension candidates. Maximal degree in co-relation 163926. Up to 22558 conditions per place. [2024-10-14 14:25:07,399 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 90 selfloop transitions, 14 changer transitions 0/131 dead transitions. [2024-10-14 14:25:07,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 131 transitions, 891 flow [2024-10-14 14:25:07,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:25:07,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-14 14:25:07,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 216 transitions. [2024-10-14 14:25:07,401 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2024-10-14 14:25:07,401 INFO L175 Difference]: Start difference. First operand has 73 places, 65 transitions, 420 flow. Second operand 7 states and 216 transitions. [2024-10-14 14:25:07,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 131 transitions, 891 flow [2024-10-14 14:25:07,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 131 transitions, 885 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-10-14 14:25:07,798 INFO L231 Difference]: Finished difference. Result has 83 places, 70 transitions, 515 flow [2024-10-14 14:25:07,798 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=515, PETRI_PLACES=83, PETRI_TRANSITIONS=70} [2024-10-14 14:25:07,799 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 27 predicate places. [2024-10-14 14:25:07,799 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 70 transitions, 515 flow [2024-10-14 14:25:07,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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) [2024-10-14 14:25:07,799 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:25:07,799 INFO L204 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] [2024-10-14 14:25:07,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 14:25:07,800 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)] === [2024-10-14 14:25:07,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:25:07,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1918786101, now seen corresponding path program 1 times [2024-10-14 14:25:07,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:25:07,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335494538] [2024-10-14 14:25:07,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:25:07,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:25:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:25:07,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:25:07,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:25:07,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335494538] [2024-10-14 14:25:07,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335494538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:25:07,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:25:07,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:25:07,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938432252] [2024-10-14 14:25:07,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:25:07,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:25:07,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:25:07,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:25:07,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:25:07,920 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-10-14 14:25:07,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 70 transitions, 515 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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) [2024-10-14 14:25:07,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:25:07,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-10-14 14:25:07,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:25:14,555 INFO L124 PetriNetUnfolderBase]: 41853/61378 cut-off events. [2024-10-14 14:25:14,556 INFO L125 PetriNetUnfolderBase]: For 82857/86482 co-relation queries the response was YES. [2024-10-14 14:25:14,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171021 conditions, 61378 events. 41853/61378 cut-off events. For 82857/86482 co-relation queries the response was YES. Maximal size of possible extension queue 2584. Compared 461522 event pairs, 5463 based on Foata normal form. 3144/62575 useless extension candidates. Maximal degree in co-relation 170987. Up to 22725 conditions per place. [2024-10-14 14:25:15,042 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 77 selfloop transitions, 10 changer transitions 2/121 dead transitions. [2024-10-14 14:25:15,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 121 transitions, 873 flow [2024-10-14 14:25:15,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:25:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 14:25:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2024-10-14 14:25:15,044 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7125 [2024-10-14 14:25:15,044 INFO L175 Difference]: Start difference. First operand has 83 places, 70 transitions, 515 flow. Second operand 5 states and 171 transitions. [2024-10-14 14:25:15,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 121 transitions, 873 flow [2024-10-14 14:25:15,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 121 transitions, 850 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-10-14 14:25:15,638 INFO L231 Difference]: Finished difference. Result has 88 places, 73 transitions, 539 flow [2024-10-14 14:25:15,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=539, PETRI_PLACES=88, PETRI_TRANSITIONS=73} [2024-10-14 14:25:15,639 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 32 predicate places. [2024-10-14 14:25:15,639 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 73 transitions, 539 flow [2024-10-14 14:25:15,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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) [2024-10-14 14:25:15,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:25:15,640 INFO L204 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] [2024-10-14 14:25:15,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 14:25:15,640 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)] === [2024-10-14 14:25:15,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:25:15,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2008273483, now seen corresponding path program 1 times [2024-10-14 14:25:15,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:25:15,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045196216] [2024-10-14 14:25:15,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:25:15,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:25:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:25:15,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:25:15,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:25:15,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045196216] [2024-10-14 14:25:15,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045196216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:25:15,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:25:15,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:25:15,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581852816] [2024-10-14 14:25:15,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:25:15,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:25:15,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:25:15,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:25:15,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:25:15,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-10-14 14:25:15,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 73 transitions, 539 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:25:15,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:25:15,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-10-14 14:25:15,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand