./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/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.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 a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:16:37,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:16:37,804 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 12:16:37,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:16:37,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:16:37,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:16:37,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:16:37,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:16:37,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:16:37,841 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:16:37,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:16:37,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:16:37,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:16:37,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:16:37,844 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:16:37,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:16:37,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:16:37,845 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 12:16:37,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:16:37,848 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 12:16:37,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:16:37,848 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:16:37,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:16:37,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:16:37,849 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:16:37,849 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 12:16:37,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:16:37,850 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:16:37,850 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:16:37,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:16:37,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:16:37,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:16:37,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:16:37,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:16:37,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:16:37,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:16:37,853 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:16:37,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:16:37,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:16:37,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:16:37,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:16:37,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:16:37,855 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 -> a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 [2024-10-24 12:16:38,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:16:38,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:16:38,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:16:38,148 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:16:38,149 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:16:38,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-10-24 12:16:39,659 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:16:39,966 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:16:39,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-10-24 12:16:39,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24034360a/5ae17c21026145218e05a9b1c60be85e/FLAG1bdc9e7b1 [2024-10-24 12:16:40,011 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24034360a/5ae17c21026145218e05a9b1c60be85e [2024-10-24 12:16:40,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:16:40,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:16:40,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:16:40,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:16:40,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:16:40,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:16:40" (1/1) ... [2024-10-24 12:16:40,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f43fb25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:16:40, skipping insertion in model container [2024-10-24 12:16:40,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:16:40" (1/1) ... [2024-10-24 12:16:40,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:16:40,296 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/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2024-10-24 12:16:40,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:16:40,498 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:16:40,508 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/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2024-10-24 12:16:40,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:16:40,588 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:16:40,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:16:40 WrapperNode [2024-10-24 12:16:40,589 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:16:40,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:16:40,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:16:40,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:16:40,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:16:40" (1/1) ... [2024-10-24 12:16:40,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:16:40" (1/1) ... [2024-10-24 12:16:40,646 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2024-10-24 12:16:40,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:16:40,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:16:40,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:16:40,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:16:40,663 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:16:40" (1/1) ... [2024-10-24 12:16:40,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:16:40" (1/1) ... [2024-10-24 12:16:40,667 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:16:40" (1/1) ... [2024-10-24 12:16:40,693 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-24 12:16:40,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:16:40" (1/1) ... [2024-10-24 12:16:40,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:16:40" (1/1) ... [2024-10-24 12:16:40,703 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:16:40" (1/1) ... [2024-10-24 12:16:40,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:16:40" (1/1) ... [2024-10-24 12:16:40,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:16:40" (1/1) ... [2024-10-24 12:16:40,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:16:40" (1/1) ... [2024-10-24 12:16:40,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:16:40,714 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:16:40,714 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:16:40,714 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:16:40,715 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:16:40" (1/1) ... [2024-10-24 12:16:40,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:16:40,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:16:40,767 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-24 12:16:40,771 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-24 12:16:40,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-24 12:16:40,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:16:40,832 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-24 12:16:40,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-24 12:16:40,832 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-24 12:16:40,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-24 12:16:40,832 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-24 12:16:40,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-24 12:16:40,832 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-24 12:16:40,833 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-24 12:16:40,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:16:40,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-24 12:16:40,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:16:40,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:16:40,835 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 12:16:41,020 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:16:41,022 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:16:41,327 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 12:16:41,327 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:16:41,553 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:16:41,553 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 12:16:41,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:16:41 BoogieIcfgContainer [2024-10-24 12:16:41,555 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:16:41,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:16:41,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:16:41,562 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:16:41,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:16:40" (1/3) ... [2024-10-24 12:16:41,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aabd266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:16:41, skipping insertion in model container [2024-10-24 12:16:41,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:16:40" (2/3) ... [2024-10-24 12:16:41,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aabd266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:16:41, skipping insertion in model container [2024-10-24 12:16:41,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:16:41" (3/3) ... [2024-10-24 12:16:41,568 INFO L112 eAbstractionObserver]: Analyzing ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-10-24 12:16:41,585 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:16:41,586 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 12:16:41,586 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 12:16:41,642 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 12:16:41,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 48 transitions, 112 flow [2024-10-24 12:16:41,725 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2024-10-24 12:16:41,726 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 12:16:41,729 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 87 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-24 12:16:41,731 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 48 transitions, 112 flow [2024-10-24 12:16:41,734 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 44 transitions, 100 flow [2024-10-24 12:16:41,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:16:41,753 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;@5e2fbff5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:16:41,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-24 12:16:41,766 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 12:16:41,766 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-10-24 12:16:41,766 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 12:16:41,766 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:16:41,767 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:16:41,768 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:16:41,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:16:41,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1793883208, now seen corresponding path program 1 times [2024-10-24 12:16:41,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:16:41,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485520065] [2024-10-24 12:16:41,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:16:41,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:16:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:16:42,450 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-24 12:16:42,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:16:42,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485520065] [2024-10-24 12:16:42,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485520065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:16:42,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:16:42,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 12:16:42,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063504058] [2024-10-24 12:16:42,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:16:42,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:16:42,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:16:42,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:16:42,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:16:42,500 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 48 [2024-10-24 12:16:42,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-24 12:16:42,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:16:42,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 48 [2024-10-24 12:16:42,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:16:42,975 INFO L124 PetriNetUnfolderBase]: 815/1447 cut-off events. [2024-10-24 12:16:42,976 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 12:16:42,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2679 conditions, 1447 events. 815/1447 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9993 event pairs, 179 based on Foata normal form. 48/1452 useless extension candidates. Maximal degree in co-relation 2667. Up to 889 conditions per place. [2024-10-24 12:16:42,999 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 27 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2024-10-24 12:16:42,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 52 transitions, 178 flow [2024-10-24 12:16:43,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:16:43,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 12:16:43,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-10-24 12:16:43,014 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2024-10-24 12:16:43,016 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 109 transitions. [2024-10-24 12:16:43,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 52 transitions, 178 flow [2024-10-24 12:16:43,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 174 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 12:16:43,024 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 94 flow [2024-10-24 12:16:43,027 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-24 12:16:43,031 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places. [2024-10-24 12:16:43,032 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 94 flow [2024-10-24 12:16:43,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-24 12:16:43,032 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:16:43,033 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:16:43,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 12:16:43,034 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:16:43,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:16:43,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2094359865, now seen corresponding path program 1 times [2024-10-24 12:16:43,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:16:43,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376155885] [2024-10-24 12:16:43,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:16:43,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:16:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:16:44,064 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-24 12:16:44,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:16:44,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376155885] [2024-10-24 12:16:44,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376155885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:16:44,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:16:44,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:16:44,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855908150] [2024-10-24 12:16:44,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:16:44,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:16:44,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:16:44,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:16:44,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:16:44,094 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-10-24 12:16:44,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-24 12:16:44,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:16:44,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-10-24 12:16:44,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:16:47,076 INFO L124 PetriNetUnfolderBase]: 12743/19380 cut-off events. [2024-10-24 12:16:47,076 INFO L125 PetriNetUnfolderBase]: For 872/872 co-relation queries the response was YES. [2024-10-24 12:16:47,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37942 conditions, 19380 events. 12743/19380 cut-off events. For 872/872 co-relation queries the response was YES. Maximal size of possible extension queue 1079. Compared 145048 event pairs, 411 based on Foata normal form. 0/18919 useless extension candidates. Maximal degree in co-relation 37932. Up to 6976 conditions per place. [2024-10-24 12:16:47,231 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 53 selfloop transitions, 12 changer transitions 99/178 dead transitions. [2024-10-24 12:16:47,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 178 transitions, 726 flow [2024-10-24 12:16:47,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 12:16:47,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-24 12:16:47,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 383 transitions. [2024-10-24 12:16:47,235 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6649305555555556 [2024-10-24 12:16:47,237 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 12 states and 383 transitions. [2024-10-24 12:16:47,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 178 transitions, 726 flow [2024-10-24 12:16:47,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 178 transitions, 702 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 12:16:47,246 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 228 flow [2024-10-24 12:16:47,246 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=228, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2024-10-24 12:16:47,247 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 16 predicate places. [2024-10-24 12:16:47,247 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 228 flow [2024-10-24 12:16:47,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-24 12:16:47,248 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:16:47,248 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-24 12:16:47,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 12:16:47,248 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:16:47,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:16:47,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1563188216, now seen corresponding path program 1 times [2024-10-24 12:16:47,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:16:47,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183644740] [2024-10-24 12:16:47,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:16:47,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:16:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:16:48,054 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-24 12:16:48,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:16:48,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183644740] [2024-10-24 12:16:48,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183644740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:16:48,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:16:48,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:16:48,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878826397] [2024-10-24 12:16:48,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:16:48,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:16:48,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:16:48,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:16:48,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:16:48,080 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-10-24 12:16:48,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-24 12:16:48,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:16:48,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-10-24 12:16:48,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:16:50,323 INFO L124 PetriNetUnfolderBase]: 9456/15774 cut-off events. [2024-10-24 12:16:50,323 INFO L125 PetriNetUnfolderBase]: For 29496/29502 co-relation queries the response was YES. [2024-10-24 12:16:50,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50095 conditions, 15774 events. 9456/15774 cut-off events. For 29496/29502 co-relation queries the response was YES. Maximal size of possible extension queue 902. Compared 128395 event pairs, 618 based on Foata normal form. 380/16085 useless extension candidates. Maximal degree in co-relation 50074. Up to 6405 conditions per place. [2024-10-24 12:16:50,481 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 57 selfloop transitions, 15 changer transitions 78/164 dead transitions. [2024-10-24 12:16:50,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 164 transitions, 1170 flow [2024-10-24 12:16:50,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 12:16:50,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-24 12:16:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 312 transitions. [2024-10-24 12:16:50,489 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-10-24 12:16:50,491 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 228 flow. Second operand 10 states and 312 transitions. [2024-10-24 12:16:50,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 164 transitions, 1170 flow [2024-10-24 12:16:50,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 164 transitions, 1090 flow, removed 40 selfloop flow, removed 4 redundant places. [2024-10-24 12:16:50,667 INFO L231 Difference]: Finished difference. Result has 77 places, 62 transitions, 398 flow [2024-10-24 12:16:50,667 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=398, PETRI_PLACES=77, PETRI_TRANSITIONS=62} [2024-10-24 12:16:50,669 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 21 predicate places. [2024-10-24 12:16:50,669 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 62 transitions, 398 flow [2024-10-24 12:16:50,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-24 12:16:50,671 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:16:50,671 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:16:50,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 12:16:50,671 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:16:50,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:16:50,673 INFO L85 PathProgramCache]: Analyzing trace with hash 88273458, now seen corresponding path program 1 times [2024-10-24 12:16:50,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:16:50,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297520996] [2024-10-24 12:16:50,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:16:50,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:16:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:16:51,470 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-24 12:16:51,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:16:51,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297520996] [2024-10-24 12:16:51,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297520996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:16:51,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:16:51,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 12:16:51,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747417335] [2024-10-24 12:16:51,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:16:51,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:16:51,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:16:51,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:16:51,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:16:51,500 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-10-24 12:16:51,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 62 transitions, 398 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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-24 12:16:51,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:16:51,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-10-24 12:16:51,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:16:54,085 INFO L124 PetriNetUnfolderBase]: 11217/18234 cut-off events. [2024-10-24 12:16:54,085 INFO L125 PetriNetUnfolderBase]: For 56757/56757 co-relation queries the response was YES. [2024-10-24 12:16:54,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66284 conditions, 18234 events. 11217/18234 cut-off events. For 56757/56757 co-relation queries the response was YES. Maximal size of possible extension queue 1041. Compared 149156 event pairs, 2140 based on Foata normal form. 350/18310 useless extension candidates. Maximal degree in co-relation 66256. Up to 5814 conditions per place. [2024-10-24 12:16:54,255 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 61 selfloop transitions, 27 changer transitions 68/170 dead transitions. [2024-10-24 12:16:54,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 170 transitions, 1408 flow [2024-10-24 12:16:54,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 12:16:54,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-24 12:16:54,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 307 transitions. [2024-10-24 12:16:54,258 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6395833333333333 [2024-10-24 12:16:54,258 INFO L175 Difference]: Start difference. First operand has 77 places, 62 transitions, 398 flow. Second operand 10 states and 307 transitions. [2024-10-24 12:16:54,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 170 transitions, 1408 flow [2024-10-24 12:16:54,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 170 transitions, 1362 flow, removed 23 selfloop flow, removed 0 redundant places. [2024-10-24 12:16:54,547 INFO L231 Difference]: Finished difference. Result has 89 places, 73 transitions, 646 flow [2024-10-24 12:16:54,547 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=646, PETRI_PLACES=89, PETRI_TRANSITIONS=73} [2024-10-24 12:16:54,548 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 33 predicate places. [2024-10-24 12:16:54,549 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 73 transitions, 646 flow [2024-10-24 12:16:54,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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-24 12:16:54,550 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:16:54,550 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-24 12:16:54,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 12:16:54,551 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:16:54,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:16:54,551 INFO L85 PathProgramCache]: Analyzing trace with hash 2101487005, now seen corresponding path program 1 times [2024-10-24 12:16:54,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:16:54,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358528801] [2024-10-24 12:16:54,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:16:54,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:16:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:16:55,310 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-24 12:16:55,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:16:55,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358528801] [2024-10-24 12:16:55,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358528801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:16:55,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:16:55,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:16:55,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567145663] [2024-10-24 12:16:55,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:16:55,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:16:55,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:16:55,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:16:55,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:16:55,319 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 48 [2024-10-24 12:16:55,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 73 transitions, 646 flow. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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-24 12:16:55,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:16:55,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 48 [2024-10-24 12:16:55,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:16:57,916 INFO L124 PetriNetUnfolderBase]: 10743/18721 cut-off events. [2024-10-24 12:16:57,917 INFO L125 PetriNetUnfolderBase]: For 96053/97665 co-relation queries the response was YES. [2024-10-24 12:16:58,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74572 conditions, 18721 events. 10743/18721 cut-off events. For 96053/97665 co-relation queries the response was YES. Maximal size of possible extension queue 1221. Compared 168009 event pairs, 3158 based on Foata normal form. 622/18334 useless extension candidates. Maximal degree in co-relation 74533. Up to 10870 conditions per place. [2024-10-24 12:16:58,108 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 58 selfloop transitions, 14 changer transitions 20/130 dead transitions. [2024-10-24 12:16:58,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 130 transitions, 1312 flow [2024-10-24 12:16:58,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:16:58,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-24 12:16:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2024-10-24 12:16:58,111 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6369047619047619 [2024-10-24 12:16:58,111 INFO L175 Difference]: Start difference. First operand has 89 places, 73 transitions, 646 flow. Second operand 7 states and 214 transitions. [2024-10-24 12:16:58,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 130 transitions, 1312 flow [2024-10-24 12:16:58,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 130 transitions, 1268 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-10-24 12:16:58,263 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 784 flow [2024-10-24 12:16:58,263 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=784, PETRI_PLACES=85, PETRI_TRANSITIONS=84} [2024-10-24 12:16:58,264 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 29 predicate places. [2024-10-24 12:16:58,264 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 784 flow [2024-10-24 12:16:58,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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-24 12:16:58,265 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:16:58,265 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] [2024-10-24 12:16:58,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 12:16:58,265 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:16:58,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:16:58,266 INFO L85 PathProgramCache]: Analyzing trace with hash 319451581, now seen corresponding path program 1 times [2024-10-24 12:16:58,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:16:58,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461699213] [2024-10-24 12:16:58,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:16:58,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:16:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:16:58,860 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-24 12:16:58,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:16:58,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461699213] [2024-10-24 12:16:58,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461699213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:16:58,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:16:58,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 12:16:58,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940713896] [2024-10-24 12:16:58,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:16:58,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 12:16:58,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:16:58,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 12:16:58,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:16:58,869 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 48 [2024-10-24 12:16:58,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 84 transitions, 784 flow. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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-24 12:16:58,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:16:58,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 48 [2024-10-24 12:16:58,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:17:01,780 INFO L124 PetriNetUnfolderBase]: 11678/20663 cut-off events. [2024-10-24 12:17:01,780 INFO L125 PetriNetUnfolderBase]: For 117080/118606 co-relation queries the response was YES. [2024-10-24 12:17:01,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86252 conditions, 20663 events. 11678/20663 cut-off events. For 117080/118606 co-relation queries the response was YES. Maximal size of possible extension queue 1396. Compared 192448 event pairs, 2097 based on Foata normal form. 565/20244 useless extension candidates. Maximal degree in co-relation 86215. Up to 11097 conditions per place. [2024-10-24 12:17:01,980 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 71 selfloop transitions, 30 changer transitions 26/165 dead transitions. [2024-10-24 12:17:01,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 165 transitions, 1842 flow [2024-10-24 12:17:01,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 12:17:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-24 12:17:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 297 transitions. [2024-10-24 12:17:01,984 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.61875 [2024-10-24 12:17:01,985 INFO L175 Difference]: Start difference. First operand has 85 places, 84 transitions, 784 flow. Second operand 10 states and 297 transitions. [2024-10-24 12:17:01,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 165 transitions, 1842 flow [2024-10-24 12:17:02,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 165 transitions, 1767 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-10-24 12:17:02,167 INFO L231 Difference]: Finished difference. Result has 98 places, 101 transitions, 1083 flow [2024-10-24 12:17:02,167 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1083, PETRI_PLACES=98, PETRI_TRANSITIONS=101} [2024-10-24 12:17:02,168 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 42 predicate places. [2024-10-24 12:17:02,168 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 101 transitions, 1083 flow [2024-10-24 12:17:02,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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-24 12:17:02,170 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:17:02,170 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] [2024-10-24 12:17:02,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 12:17:02,170 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:17:02,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:17:02,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1473979817, now seen corresponding path program 1 times [2024-10-24 12:17:02,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:17:02,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421195641] [2024-10-24 12:17:02,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:17:02,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:17:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:17:02,982 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-24 12:17:02,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:17:02,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421195641] [2024-10-24 12:17:02,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421195641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:17:02,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:17:02,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 12:17:02,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724013365] [2024-10-24 12:17:02,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:17:02,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 12:17:02,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:17:02,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 12:17:02,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:17:02,989 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 48 [2024-10-24 12:17:02,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 101 transitions, 1083 flow. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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-24 12:17:02,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:17:02,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 48 [2024-10-24 12:17:02,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:17:06,983 INFO L124 PetriNetUnfolderBase]: 14778/26289 cut-off events. [2024-10-24 12:17:06,983 INFO L125 PetriNetUnfolderBase]: For 183646/185503 co-relation queries the response was YES. [2024-10-24 12:17:07,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115898 conditions, 26289 events. 14778/26289 cut-off events. For 183646/185503 co-relation queries the response was YES. Maximal size of possible extension queue 1890. Compared 255317 event pairs, 2553 based on Foata normal form. 719/25859 useless extension candidates. Maximal degree in co-relation 115855. Up to 11125 conditions per place. [2024-10-24 12:17:07,303 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 86 selfloop transitions, 57 changer transitions 40/221 dead transitions. [2024-10-24 12:17:07,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 221 transitions, 2724 flow [2024-10-24 12:17:07,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 12:17:07,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-24 12:17:07,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 386 transitions. [2024-10-24 12:17:07,306 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6185897435897436 [2024-10-24 12:17:07,306 INFO L175 Difference]: Start difference. First operand has 98 places, 101 transitions, 1083 flow. Second operand 13 states and 386 transitions. [2024-10-24 12:17:07,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 221 transitions, 2724 flow [2024-10-24 12:17:07,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 221 transitions, 2576 flow, removed 74 selfloop flow, removed 0 redundant places. [2024-10-24 12:17:07,985 INFO L231 Difference]: Finished difference. Result has 117 places, 136 transitions, 1644 flow [2024-10-24 12:17:07,985 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1644, PETRI_PLACES=117, PETRI_TRANSITIONS=136} [2024-10-24 12:17:07,986 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 61 predicate places. [2024-10-24 12:17:07,986 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 136 transitions, 1644 flow [2024-10-24 12:17:07,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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-24 12:17:07,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:17:07,987 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] [2024-10-24 12:17:07,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 12:17:07,988 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:17:07,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:17:07,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1354845608, now seen corresponding path program 1 times [2024-10-24 12:17:07,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:17:07,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368029256] [2024-10-24 12:17:07,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:17:07,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:17:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:17:09,011 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-24 12:17:09,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:17:09,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368029256] [2024-10-24 12:17:09,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368029256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:17:09,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:17:09,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 12:17:09,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666997743] [2024-10-24 12:17:09,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:17:09,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:17:09,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:17:09,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:17:09,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:17:09,023 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 48 [2024-10-24 12:17:09,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 136 transitions, 1644 flow. Second operand has 8 states, 8 states have (on average 24.0) internal successors, (192), 8 states have internal predecessors, (192), 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-24 12:17:09,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:17:09,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 48 [2024-10-24 12:17:09,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:17:12,992 INFO L124 PetriNetUnfolderBase]: 14236/25758 cut-off events. [2024-10-24 12:17:12,993 INFO L125 PetriNetUnfolderBase]: For 240096/242127 co-relation queries the response was YES. [2024-10-24 12:17:13,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122399 conditions, 25758 events. 14236/25758 cut-off events. For 240096/242127 co-relation queries the response was YES. Maximal size of possible extension queue 1874. Compared 254260 event pairs, 2293 based on Foata normal form. 532/25024 useless extension candidates. Maximal degree in co-relation 122347. Up to 13640 conditions per place. [2024-10-24 12:17:13,345 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 104 selfloop transitions, 35 changer transitions 24/201 dead transitions. [2024-10-24 12:17:13,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 201 transitions, 2739 flow [2024-10-24 12:17:13,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:17:13,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-24 12:17:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 244 transitions. [2024-10-24 12:17:13,347 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2024-10-24 12:17:13,347 INFO L175 Difference]: Start difference. First operand has 117 places, 136 transitions, 1644 flow. Second operand 8 states and 244 transitions. [2024-10-24 12:17:13,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 201 transitions, 2739 flow [2024-10-24 12:17:14,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 201 transitions, 2620 flow, removed 52 selfloop flow, removed 3 redundant places. [2024-10-24 12:17:14,414 INFO L231 Difference]: Finished difference. Result has 125 places, 140 transitions, 1750 flow [2024-10-24 12:17:14,414 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1565, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1750, PETRI_PLACES=125, PETRI_TRANSITIONS=140} [2024-10-24 12:17:14,415 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 69 predicate places. [2024-10-24 12:17:14,415 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 140 transitions, 1750 flow [2024-10-24 12:17:14,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.0) internal successors, (192), 8 states have internal predecessors, (192), 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-24 12:17:14,416 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:17:14,416 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-24 12:17:14,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 12:17:14,416 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:17:14,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:17:14,416 INFO L85 PathProgramCache]: Analyzing trace with hash -817172865, now seen corresponding path program 1 times [2024-10-24 12:17:14,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:17:14,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13962406] [2024-10-24 12:17:14,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:17:14,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:17:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:17:15,296 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-24 12:17:15,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:17:15,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13962406] [2024-10-24 12:17:15,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13962406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:17:15,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:17:15,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 12:17:15,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464082714] [2024-10-24 12:17:15,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:17:15,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:17:15,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:17:15,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:17:15,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:17:15,330 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-10-24 12:17:15,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 140 transitions, 1750 flow. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 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-24 12:17:15,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:17:15,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-10-24 12:17:15,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:17:20,839 INFO L124 PetriNetUnfolderBase]: 19986/33620 cut-off events. [2024-10-24 12:17:20,839 INFO L125 PetriNetUnfolderBase]: For 340981/342194 co-relation queries the response was YES. [2024-10-24 12:17:21,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166532 conditions, 33620 events. 19986/33620 cut-off events. For 340981/342194 co-relation queries the response was YES. Maximal size of possible extension queue 2362. Compared 316141 event pairs, 8526 based on Foata normal form. 713/32874 useless extension candidates. Maximal degree in co-relation 166475. Up to 21968 conditions per place. [2024-10-24 12:17:21,221 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 90 selfloop transitions, 48 changer transitions 102/264 dead transitions. [2024-10-24 12:17:21,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 264 transitions, 3765 flow [2024-10-24 12:17:21,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 12:17:21,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-24 12:17:21,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 277 transitions. [2024-10-24 12:17:21,223 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5770833333333333 [2024-10-24 12:17:21,223 INFO L175 Difference]: Start difference. First operand has 125 places, 140 transitions, 1750 flow. Second operand 10 states and 277 transitions. [2024-10-24 12:17:21,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 264 transitions, 3765 flow [2024-10-24 12:17:22,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 264 transitions, 3651 flow, removed 38 selfloop flow, removed 4 redundant places. [2024-10-24 12:17:22,770 INFO L231 Difference]: Finished difference. Result has 137 places, 141 transitions, 1970 flow [2024-10-24 12:17:22,770 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1643, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1970, PETRI_PLACES=137, PETRI_TRANSITIONS=141} [2024-10-24 12:17:22,771 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 81 predicate places. [2024-10-24 12:17:22,771 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 141 transitions, 1970 flow [2024-10-24 12:17:22,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 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-24 12:17:22,771 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:17:22,771 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-24 12:17:22,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 12:17:22,772 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:17:22,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:17:22,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1797812301, now seen corresponding path program 2 times [2024-10-24 12:17:22,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:17:22,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049180369] [2024-10-24 12:17:22,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:17:22,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:17:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:17:23,902 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-24 12:17:23,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:17:23,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049180369] [2024-10-24 12:17:23,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049180369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:17:23,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:17:23,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 12:17:23,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875561064] [2024-10-24 12:17:23,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:17:23,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:17:23,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:17:23,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:17:23,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:17:23,948 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-10-24 12:17:23,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 141 transitions, 1970 flow. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 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-24 12:17:23,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:17:23,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-10-24 12:17:23,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:17:27,670 INFO L124 PetriNetUnfolderBase]: 14601/23804 cut-off events. [2024-10-24 12:17:27,670 INFO L125 PetriNetUnfolderBase]: For 319646/321105 co-relation queries the response was YES. [2024-10-24 12:17:27,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137230 conditions, 23804 events. 14601/23804 cut-off events. For 319646/321105 co-relation queries the response was YES. Maximal size of possible extension queue 1429. Compared 201948 event pairs, 2054 based on Foata normal form. 798/23561 useless extension candidates. Maximal degree in co-relation 137168. Up to 13712 conditions per place. [2024-10-24 12:17:27,930 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 122 selfloop transitions, 61 changer transitions 53/260 dead transitions. [2024-10-24 12:17:27,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 260 transitions, 4040 flow [2024-10-24 12:17:27,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 12:17:27,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-24 12:17:27,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 259 transitions. [2024-10-24 12:17:27,932 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5995370370370371 [2024-10-24 12:17:27,932 INFO L175 Difference]: Start difference. First operand has 137 places, 141 transitions, 1970 flow. Second operand 9 states and 259 transitions. [2024-10-24 12:17:27,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 260 transitions, 4040 flow [2024-10-24 12:17:29,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 260 transitions, 3759 flow, removed 129 selfloop flow, removed 16 redundant places. [2024-10-24 12:17:29,984 INFO L231 Difference]: Finished difference. Result has 110 places, 162 transitions, 2393 flow [2024-10-24 12:17:29,985 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2393, PETRI_PLACES=110, PETRI_TRANSITIONS=162} [2024-10-24 12:17:29,985 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 54 predicate places. [2024-10-24 12:17:29,985 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 162 transitions, 2393 flow [2024-10-24 12:17:29,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 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-24 12:17:29,986 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:17:29,986 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-24 12:17:29,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 12:17:29,987 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:17:29,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:17:29,987 INFO L85 PathProgramCache]: Analyzing trace with hash -813808039, now seen corresponding path program 3 times [2024-10-24 12:17:29,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:17:29,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216323236] [2024-10-24 12:17:29,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:17:29,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:17:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:17:30,159 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-24 12:17:30,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:17:30,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216323236] [2024-10-24 12:17:30,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216323236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:17:30,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:17:30,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:17:30,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138874910] [2024-10-24 12:17:30,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:17:30,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:17:30,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:17:30,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:17:30,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:17:30,169 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-10-24 12:17:30,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 162 transitions, 2393 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-24 12:17:30,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:17:30,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-10-24 12:17:30,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:17:37,178 INFO L124 PetriNetUnfolderBase]: 33481/50034 cut-off events. [2024-10-24 12:17:37,178 INFO L125 PetriNetUnfolderBase]: For 659211/686184 co-relation queries the response was YES. [2024-10-24 12:17:37,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242306 conditions, 50034 events. 33481/50034 cut-off events. For 659211/686184 co-relation queries the response was YES. Maximal size of possible extension queue 2715. Compared 396574 event pairs, 4975 based on Foata normal form. 7917/56044 useless extension candidates. Maximal degree in co-relation 242253. Up to 26466 conditions per place. [2024-10-24 12:17:37,904 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 188 selfloop transitions, 6 changer transitions 8/261 dead transitions. [2024-10-24 12:17:37,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 261 transitions, 4373 flow [2024-10-24 12:17:37,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:17:37,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 12:17:37,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2024-10-24 12:17:37,906 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6927083333333334 [2024-10-24 12:17:37,906 INFO L175 Difference]: Start difference. First operand has 110 places, 162 transitions, 2393 flow. Second operand 4 states and 133 transitions. [2024-10-24 12:17:37,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 261 transitions, 4373 flow [2024-10-24 12:17:38,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 261 transitions, 4165 flow, removed 61 selfloop flow, removed 4 redundant places. [2024-10-24 12:17:38,921 INFO L231 Difference]: Finished difference. Result has 107 places, 156 transitions, 2095 flow [2024-10-24 12:17:38,922 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2197, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2095, PETRI_PLACES=107, PETRI_TRANSITIONS=156} [2024-10-24 12:17:38,923 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 51 predicate places. [2024-10-24 12:17:38,923 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 156 transitions, 2095 flow [2024-10-24 12:17:38,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-24 12:17:38,923 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:17:38,923 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] [2024-10-24 12:17:38,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 12:17:38,923 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:17:38,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:17:38,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1616565650, now seen corresponding path program 1 times [2024-10-24 12:17:38,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:17:38,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603981960] [2024-10-24 12:17:38,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:17:38,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:17:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:17:39,637 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-24 12:17:39,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:17:39,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603981960] [2024-10-24 12:17:39,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603981960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:17:39,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:17:39,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:17:39,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367113315] [2024-10-24 12:17:39,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:17:39,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:17:39,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:17:39,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:17:39,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:17:39,643 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 48 [2024-10-24 12:17:39,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 156 transitions, 2095 flow. Second operand has 9 states, 9 states have (on average 23.88888888888889) internal successors, (215), 9 states have internal predecessors, (215), 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-24 12:17:39,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:17:39,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 48 [2024-10-24 12:17:39,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:17:40,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([369] L780-->L787: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_41 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_14 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_22 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_42 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_37 256) 0)))) (.cse2 (and .cse5 .cse4))) (and (= v_~z$w_buff0_used~0_41 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_42) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_37) 256) 0) 0 1) v_~z$w_buff1_used~0_36) (= (ite (= 0 (mod (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_36 256) 0))) (and (not (= (mod v_~z$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~z$r_buff1_thd3~0_14) 256)) 0 1) v_~z$r_buff1_thd3~0_13) (= v_~z~0_19 (ite .cse0 v_~z$w_buff0~0_12 (ite .cse1 v_~z$w_buff1~0_11 v_~z~0_20))) (= v_~z$r_buff0_thd3~0_21 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd3~0_22) 256) 0) 0 1))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_42, ~z$w_buff0~0=v_~z$w_buff0~0_12, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_14, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_37, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_22, ~z$w_buff1~0=v_~z$w_buff1~0_11, ~z~0=v_~z~0_20} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_41, ~z$w_buff0~0=v_~z$w_buff0~0_12, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_13, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_36, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~z$w_buff1~0=v_~z$w_buff1~0_11, ~z~0=v_~z~0_19} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][89], [Black: 248#(and (= ~z$w_buff0_used~0 1) (or (not (= 2 ~y~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0))), Black: 250#(and (= ~z$w_buff0_used~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0))), Black: 244#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0)), 299#(and (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), Black: 246#(and (= ~z~0 1) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0))), Black: 252#(and (= ~z$w_buff0_used~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0))), Black: 120#true, Black: 124#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 66#true, Black: 123#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 (mod ~z$w_buff0_used~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256))))), 187#true, 290#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 131#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 135#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 (mod ~z$w_buff0_used~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256))))), 95#true, Black: 133#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 (mod ~z$w_buff0_used~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256))))), 237#(= ~z$r_buff0_thd0~0 0), Black: 205#(and (<= 0 (div ~z$r_buff0_thd0~0 256)) (= ~z$w_buff0_used~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= (mod ~z$r_buff0_thd0~0 256) 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 190#(or (not (= 0 (mod ~z$w_buff0_used~0 256))) (and (<= 0 (div ~z$r_buff0_thd0~0 256)) (<= (mod ~z$r_buff0_thd0~0 256) 0) (= ~z~0 0))), Black: 191#(and (<= 0 (div ~z$r_buff0_thd0~0 256)) (= ~z$w_buff0_used~0 1) (<= (mod ~z$r_buff0_thd0~0 256) 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0)), Black: 69#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 (mod ~z$w_buff0_used~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256))))), 61#true, Black: 75#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 (mod ~z$w_buff0_used~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256))))), Black: 79#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 277#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 269#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= 0 (mod ~z$r_buff0_thd0~0 256)) (= ~z$r_buff1_thd0~0 0)), Black: 279#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 68#(= ~x~0 0), Black: 81#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 (mod ~z$w_buff0_used~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256))))), Black: 152#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), 59#true, Black: 292#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 224#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 122#(= ~y~0 1), 53#L841-4true, 36#L810true, 52#$Ultimate##0true, 57#true, 25#P1EXITtrue, Black: 102#(and (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 98#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 (mod ~z$w_buff0_used~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256))))), Black: 171#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 97#(= ~y~0 0), Black: 177#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 28#L787true, 55#true]) [2024-10-24 12:17:40,445 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-10-24 12:17:40,445 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-24 12:17:40,445 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-24 12:17:40,445 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-24 12:17:40,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([369] L780-->L787: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_41 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_14 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_22 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_42 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_37 256) 0)))) (.cse2 (and .cse5 .cse4))) (and (= v_~z$w_buff0_used~0_41 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_42) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_37) 256) 0) 0 1) v_~z$w_buff1_used~0_36) (= (ite (= 0 (mod (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_36 256) 0))) (and (not (= (mod v_~z$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~z$r_buff1_thd3~0_14) 256)) 0 1) v_~z$r_buff1_thd3~0_13) (= v_~z~0_19 (ite .cse0 v_~z$w_buff0~0_12 (ite .cse1 v_~z$w_buff1~0_11 v_~z~0_20))) (= v_~z$r_buff0_thd3~0_21 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd3~0_22) 256) 0) 0 1))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_42, ~z$w_buff0~0=v_~z$w_buff0~0_12, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_14, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_37, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_22, ~z$w_buff1~0=v_~z$w_buff1~0_11, ~z~0=v_~z~0_20} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_41, ~z$w_buff0~0=v_~z$w_buff0~0_12, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_13, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_36, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~z$w_buff1~0=v_~z$w_buff1~0_11, ~z~0=v_~z~0_19} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][89], [Black: 248#(and (= ~z$w_buff0_used~0 1) (or (not (= 2 ~y~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0))), Black: 250#(and (= ~z$w_buff0_used~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0))), 42#L842true, Black: 244#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0)), 299#(and (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), Black: 246#(and (= ~z~0 1) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0))), Black: 252#(and (= ~z$w_buff0_used~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0))), Black: 120#true, Black: 124#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 66#true, 187#true, Black: 123#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 (mod ~z$w_buff0_used~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256))))), 290#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 131#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 135#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 (mod ~z$w_buff0_used~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256))))), 95#true, Black: 133#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 (mod ~z$w_buff0_used~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256))))), 237#(= ~z$r_buff0_thd0~0 0), Black: 205#(and (<= 0 (div ~z$r_buff0_thd0~0 256)) (= ~z$w_buff0_used~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= (mod ~z$r_buff0_thd0~0 256) 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 190#(or (not (= 0 (mod ~z$w_buff0_used~0 256))) (and (<= 0 (div ~z$r_buff0_thd0~0 256)) (<= (mod ~z$r_buff0_thd0~0 256) 0) (= ~z~0 0))), Black: 191#(and (<= 0 (div ~z$r_buff0_thd0~0 256)) (= ~z$w_buff0_used~0 1) (<= (mod ~z$r_buff0_thd0~0 256) 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0)), Black: 69#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 (mod ~z$w_buff0_used~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256))))), 61#true, Black: 75#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 (mod ~z$w_buff0_used~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256))))), Black: 79#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 277#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 269#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= 0 (mod ~z$r_buff0_thd0~0 256)) (= ~z$r_buff1_thd0~0 0)), Black: 279#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 68#(= ~x~0 0), Black: 81#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 (mod ~z$w_buff0_used~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256))))), Black: 152#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), 59#true, Black: 292#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 224#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 122#(= ~y~0 1), 36#L810true, 52#$Ultimate##0true, 57#true, 25#P1EXITtrue, Black: 102#(and (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 98#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 (mod ~z$w_buff0_used~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256))))), Black: 97#(= ~y~0 0), Black: 171#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 177#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 28#L787true, 55#true]) [2024-10-24 12:17:40,646 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-10-24 12:17:40,646 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-24 12:17:40,646 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-24 12:17:40,646 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-24 12:17:40,659 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L810-->L817: Formula: (let ((.cse2 (not (= 0 (mod v_~z$r_buff1_thd4~0_20 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_25 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_75 256) 0)))) (let ((.cse0 (and .cse5 .cse1)) (.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse2)) (.cse4 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_76 256) 0))))) (and (= v_~z$r_buff0_thd4~0_24 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd4~0_25) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and .cse1 (not (= (mod v_~z$r_buff0_thd4~0_24 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse2)) 0 v_~z$r_buff1_thd4~0_20) 256) 0) 0 1) v_~z$r_buff1_thd4~0_19) (= (ite (= (mod (ite (or .cse3 .cse0) 0 v_~z$w_buff1_used~0_61) 256) 0) 0 1) v_~z$w_buff1_used~0_60) (= v_~z~0_23 (ite .cse4 v_~z$w_buff0~0_26 (ite .cse3 v_~z$w_buff1~0_19 v_~z~0_24))) (= v_~z$w_buff0_used~0_75 (ite (= (mod (ite .cse4 0 v_~z$w_buff0_used~0_76) 256) 0) 0 1))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_76, ~z$w_buff0~0=v_~z$w_buff0~0_26, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_25, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_19, ~z~0=v_~z~0_24} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_75, ~z$w_buff0~0=v_~z$w_buff0~0_26, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_19, ~z~0=v_~z~0_23} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 248#(and (= ~z$w_buff0_used~0 1) (or (not (= 2 ~y~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0))), Black: 250#(and (= ~z$w_buff0_used~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0))), Black: 244#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0)), Black: 246#(and (= ~z~0 1) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0))), Black: 252#(and (= ~z$w_buff0_used~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0))), Black: 120#true, Black: 124#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 66#true, Black: 123#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 (mod ~z$w_buff0_used~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256))))), 187#true, 290#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 131#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 135#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 (mod ~z$w_buff0_used~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256))))), 95#true, Black: 133#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 (mod ~z$w_buff0_used~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256))))), 237#(= ~z$r_buff0_thd0~0 0), Black: 205#(and (<= 0 (div ~z$r_buff0_thd0~0 256)) (= ~z$w_buff0_used~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= (mod ~z$r_buff0_thd0~0 256) 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 190#(or (not (= 0 (mod ~z$w_buff0_used~0 256))) (and (<= 0 (div ~z$r_buff0_thd0~0 256)) (<= (mod ~z$r_buff0_thd0~0 256) 0) (= ~z~0 0))), Black: 191#(and (<= 0 (div ~z$r_buff0_thd0~0 256)) (= ~z$w_buff0_used~0 1) (<= (mod ~z$r_buff0_thd0~0 256) 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0)), Black: 69#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 (mod ~z$w_buff0_used~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256))))), 61#true, Black: 75#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 (mod ~z$w_buff0_used~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256))))), Black: 79#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 277#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 269#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= 0 (mod ~z$r_buff0_thd0~0 256)) (= ~z$r_buff1_thd0~0 0)), Black: 279#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 68#(= ~x~0 0), Black: 81#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 (mod ~z$w_buff0_used~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256))))), Black: 152#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), 59#true, Black: 292#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 224#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 122#(= ~y~0 1), 41#L817true, 53#L841-4true, 52#$Ultimate##0true, 295#true, 57#true, 34#L780true, 25#P1EXITtrue, Black: 102#(and (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 98#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0)) (= 0 (mod ~z$w_buff0_used~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256))))), Black: 171#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 97#(= ~y~0 0), Black: 177#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 55#true]) [2024-10-24 12:17:40,659 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2024-10-24 12:17:40,659 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-10-24 12:17:40,660 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-10-24 12:17:40,660 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event