./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/mix044.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix044.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 bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 14:24:10,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 14:24:10,937 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 14:24:10,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 14:24:10,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 14:24:10,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 14:24:10,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 14:24:10,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 14:24:10,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 14:24:10,974 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 14:24:10,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 14:24:10,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 14:24:10,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 14:24:10,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 14:24:10,976 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 14:24:10,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 14:24:10,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 14:24:10,977 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 14:24:10,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 14:24:10,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 14:24:10,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 14:24:10,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 14:24:10,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 14:24:10,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 14:24:10,978 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 14:24:10,978 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 14:24:10,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 14:24:10,979 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 14:24:10,979 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 14:24:10,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 14:24:10,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 14:24:10,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 14:24:10,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:24:10,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 14:24:10,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 14:24:10,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 14:24:10,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 14:24:10,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 14:24:10,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 14:24:10,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 14:24:10,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 14:24:10,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 14:24:10,981 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 -> bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 [2024-10-14 14:24:11,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 14:24:11,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 14:24:11,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 14:24:11,177 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 14:24:11,177 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 14:24:11,178 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix044.opt.i [2024-10-14 14:24:12,386 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 14:24:12,586 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 14:24:12,587 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix044.opt.i [2024-10-14 14:24:12,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d9412c9f/ef79ffb8fe924a409ba07cc768b886cb/FLAG4ce11aefb [2024-10-14 14:24:12,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d9412c9f/ef79ffb8fe924a409ba07cc768b886cb [2024-10-14 14:24:12,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 14:24:12,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 14:24:12,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 14:24:12,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 14:24:12,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 14:24:12,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:24:12" (1/1) ... [2024-10-14 14:24:12,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@294a42d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:12, skipping insertion in model container [2024-10-14 14:24:12,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:24:12" (1/1) ... [2024-10-14 14:24:12,655 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 14:24:12,791 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/mix044.opt.i[944,957] [2024-10-14 14:24:12,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:24:12,928 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 14:24:12,939 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/mix044.opt.i[944,957] [2024-10-14 14:24:12,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:24:13,023 INFO L204 MainTranslator]: Completed translation [2024-10-14 14:24:13,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:13 WrapperNode [2024-10-14 14:24:13,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 14:24:13,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 14:24:13,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 14:24:13,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 14:24:13,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:13" (1/1) ... [2024-10-14 14:24:13,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:13" (1/1) ... [2024-10-14 14:24:13,075 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2024-10-14 14:24:13,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 14:24:13,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 14:24:13,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 14:24:13,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 14:24:13,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:13" (1/1) ... [2024-10-14 14:24:13,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:13" (1/1) ... [2024-10-14 14:24:13,091 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:13" (1/1) ... [2024-10-14 14:24:13,110 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 14:24:13,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:13" (1/1) ... [2024-10-14 14:24:13,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:13" (1/1) ... [2024-10-14 14:24:13,115 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:13" (1/1) ... [2024-10-14 14:24:13,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:13" (1/1) ... [2024-10-14 14:24:13,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:13" (1/1) ... [2024-10-14 14:24:13,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:13" (1/1) ... [2024-10-14 14:24:13,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 14:24:13,123 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 14:24:13,123 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 14:24:13,123 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 14:24:13,124 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:13" (1/1) ... [2024-10-14 14:24:13,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:24:13,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:24:13,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 14:24:13,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 14:24:13,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 14:24:13,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 14:24:13,192 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-14 14:24:13,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-14 14:24:13,193 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-14 14:24:13,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-14 14:24:13,193 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-14 14:24:13,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-14 14:24:13,194 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-14 14:24:13,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-14 14:24:13,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 14:24:13,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 14:24:13,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 14:24:13,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 14:24:13,196 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 14:24:13,322 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 14:24:13,324 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 14:24:13,614 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 14:24:13,614 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 14:24:13,759 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 14:24:13,759 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 14:24:13,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:24:13 BoogieIcfgContainer [2024-10-14 14:24:13,760 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 14:24:13,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 14:24:13,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 14:24:13,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 14:24:13,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:24:12" (1/3) ... [2024-10-14 14:24:13,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b0f69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:24:13, skipping insertion in model container [2024-10-14 14:24:13,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:24:13" (2/3) ... [2024-10-14 14:24:13,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b0f69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:24:13, skipping insertion in model container [2024-10-14 14:24:13,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:24:13" (3/3) ... [2024-10-14 14:24:13,769 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044.opt.i [2024-10-14 14:24:13,783 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 14:24:13,783 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 14:24:13,784 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 14:24:13,832 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-14 14:24:13,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2024-10-14 14:24:13,881 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-10-14 14:24:13,882 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 14:24:13,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2024-10-14 14:24:13,885 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2024-10-14 14:24:13,887 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2024-10-14 14:24:13,894 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 14:24:13,901 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;@3e10b5d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 14:24:13,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-14 14:24:13,913 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 14:24:13,913 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-10-14 14:24:13,913 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 14:24:13,914 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:24:13,914 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:24:13,915 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-14 14:24:13,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:24:13,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1408845310, now seen corresponding path program 1 times [2024-10-14 14:24:13,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:24:13,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851380443] [2024-10-14 14:24:13,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:24:13,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:24:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:24:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:24:14,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:24:14,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851380443] [2024-10-14 14:24:14,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851380443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:24:14,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:24:14,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 14:24:14,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956661174] [2024-10-14 14:24:14,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:24:14,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 14:24:14,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:24:14,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 14:24:14,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:24:14,356 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 50 [2024-10-14 14:24:14,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:24:14,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:24:14,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 50 [2024-10-14 14:24:14,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:24:14,666 INFO L124 PetriNetUnfolderBase]: 815/1615 cut-off events. [2024-10-14 14:24:14,667 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 14:24:14,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2847 conditions, 1615 events. 815/1615 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11840 event pairs, 179 based on Foata normal form. 48/1609 useless extension candidates. Maximal degree in co-relation 2835. Up to 889 conditions per place. [2024-10-14 14:24:14,682 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 27 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2024-10-14 14:24:14,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 54 transitions, 182 flow [2024-10-14 14:24:14,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 14:24:14,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 14:24:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2024-10-14 14:24:14,692 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2024-10-14 14:24:14,694 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 115 transitions. [2024-10-14 14:24:14,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 54 transitions, 182 flow [2024-10-14 14:24:14,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 178 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-14 14:24:14,699 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2024-10-14 14:24:14,701 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-10-14 14:24:14,704 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2024-10-14 14:24:14,704 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2024-10-14 14:24:14,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:24:14,704 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:24:14,705 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:24:14,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 14:24:14,705 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-14 14:24:14,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:24:14,707 INFO L85 PathProgramCache]: Analyzing trace with hash 931124390, now seen corresponding path program 1 times [2024-10-14 14:24:14,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:24:14,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400812161] [2024-10-14 14:24:14,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:24:14,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:24:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:24:14,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:24:14,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:24:14,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400812161] [2024-10-14 14:24:14,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400812161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:24:14,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:24:14,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 14:24:14,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700814514] [2024-10-14 14:24:14,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:24:14,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:24:14,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:24:14,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:24:14,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:24:14,952 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-10-14 14:24:14,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:24:14,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:24:14,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-10-14 14:24:14,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:24:15,575 INFO L124 PetriNetUnfolderBase]: 3857/5905 cut-off events. [2024-10-14 14:24:15,576 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2024-10-14 14:24:15,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11649 conditions, 5905 events. 3857/5905 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 39444 event pairs, 536 based on Foata normal form. 180/5891 useless extension candidates. Maximal degree in co-relation 11639. Up to 3346 conditions per place. [2024-10-14 14:24:15,610 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 44 selfloop transitions, 6 changer transitions 1/69 dead transitions. [2024-10-14 14:24:15,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 262 flow [2024-10-14 14:24:15,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:24:15,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 14:24:15,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2024-10-14 14:24:15,613 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.705 [2024-10-14 14:24:15,614 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 4 states and 141 transitions. [2024-10-14 14:24:15,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 262 flow [2024-10-14 14:24:15,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 14:24:15,618 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow [2024-10-14 14:24:15,618 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2024-10-14 14:24:15,619 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2024-10-14 14:24:15,619 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow [2024-10-14 14:24:15,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:24:15,619 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:24:15,619 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-14 14:24:15,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 14:24:15,620 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-14 14:24:15,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:24:15,620 INFO L85 PathProgramCache]: Analyzing trace with hash 674539450, now seen corresponding path program 1 times [2024-10-14 14:24:15,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:24:15,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137747907] [2024-10-14 14:24:15,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:24:15,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:24:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:24:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:24:15,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:24:15,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137747907] [2024-10-14 14:24:15,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137747907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:24:15,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:24:15,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:24:15,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273291343] [2024-10-14 14:24:15,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:24:15,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:24:15,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:24:15,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:24:15,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:24:15,841 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-10-14 14:24:15,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:24:15,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:24:15,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-10-14 14:24:15,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:24:16,333 INFO L124 PetriNetUnfolderBase]: 3272/5042 cut-off events. [2024-10-14 14:24:16,333 INFO L125 PetriNetUnfolderBase]: For 1393/1393 co-relation queries the response was YES. [2024-10-14 14:24:16,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11673 conditions, 5042 events. 3272/5042 cut-off events. For 1393/1393 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 32835 event pairs, 192 based on Foata normal form. 174/5058 useless extension candidates. Maximal degree in co-relation 11661. Up to 2581 conditions per place. [2024-10-14 14:24:16,353 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 56 selfloop transitions, 10 changer transitions 1/85 dead transitions. [2024-10-14 14:24:16,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 85 transitions, 375 flow [2024-10-14 14:24:16,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:24:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 14:24:16,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2024-10-14 14:24:16,355 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.716 [2024-10-14 14:24:16,355 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 136 flow. Second operand 5 states and 179 transitions. [2024-10-14 14:24:16,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 85 transitions, 375 flow [2024-10-14 14:24:16,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 85 transitions, 364 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-14 14:24:16,358 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow [2024-10-14 14:24:16,358 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-10-14 14:24:16,359 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2024-10-14 14:24:16,359 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow [2024-10-14 14:24:16,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:24:16,359 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:24:16,359 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:24:16,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 14:24:16,360 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-14 14:24:16,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:24:16,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1017175972, now seen corresponding path program 1 times [2024-10-14 14:24:16,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:24:16,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749095963] [2024-10-14 14:24:16,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:24:16,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:24:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:24:16,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:24:16,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:24:16,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749095963] [2024-10-14 14:24:16,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749095963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:24:16,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:24:16,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:24:16,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532740070] [2024-10-14 14:24:16,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:24:16,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:24:16,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:24:16,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:24:16,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:24:16,551 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-10-14 14:24:16,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:24:16,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:24:16,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-10-14 14:24:16,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:24:16,903 INFO L124 PetriNetUnfolderBase]: 2201/3393 cut-off events. [2024-10-14 14:24:16,903 INFO L125 PetriNetUnfolderBase]: For 2769/2769 co-relation queries the response was YES. [2024-10-14 14:24:16,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8895 conditions, 3393 events. 2201/3393 cut-off events. For 2769/2769 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 19590 event pairs, 69 based on Foata normal form. 140/3444 useless extension candidates. Maximal degree in co-relation 8881. Up to 1221 conditions per place. [2024-10-14 14:24:16,919 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 66 selfloop transitions, 14 changer transitions 1/99 dead transitions. [2024-10-14 14:24:16,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 99 transitions, 494 flow [2024-10-14 14:24:16,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:24:16,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 14:24:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2024-10-14 14:24:16,921 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2024-10-14 14:24:16,922 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 188 flow. Second operand 6 states and 215 transitions. [2024-10-14 14:24:16,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 99 transitions, 494 flow [2024-10-14 14:24:16,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 99 transitions, 464 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-14 14:24:16,931 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow [2024-10-14 14:24:16,931 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-10-14 14:24:16,932 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2024-10-14 14:24:16,932 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow [2024-10-14 14:24:16,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:24:16,933 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:24:16,933 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:24:16,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 14:24:16,933 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-14 14:24:16,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:24:16,934 INFO L85 PathProgramCache]: Analyzing trace with hash 910395632, now seen corresponding path program 1 times [2024-10-14 14:24:16,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:24:16,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273175116] [2024-10-14 14:24:16,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:24:16,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:24:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:24:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:24:17,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:24:17,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273175116] [2024-10-14 14:24:17,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273175116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:24:17,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:24:17,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:24:17,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964053772] [2024-10-14 14:24:17,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:24:17,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:24:17,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:24:17,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:24:17,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:24:17,163 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-10-14 14:24:17,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:24:17,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:24:17,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-10-14 14:24:17,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:24:17,483 INFO L124 PetriNetUnfolderBase]: 1353/2029 cut-off events. [2024-10-14 14:24:17,484 INFO L125 PetriNetUnfolderBase]: For 3115/3115 co-relation queries the response was YES. [2024-10-14 14:24:17,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6040 conditions, 2029 events. 1353/2029 cut-off events. For 3115/3115 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9823 event pairs, 39 based on Foata normal form. 72/2068 useless extension candidates. Maximal degree in co-relation 6025. Up to 668 conditions per place. [2024-10-14 14:24:17,497 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 60 selfloop transitions, 18 changer transitions 1/97 dead transitions. [2024-10-14 14:24:17,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 97 transitions, 496 flow [2024-10-14 14:24:17,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:24:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-14 14:24:17,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 235 transitions. [2024-10-14 14:24:17,498 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6714285714285714 [2024-10-14 14:24:17,498 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 238 flow. Second operand 7 states and 235 transitions. [2024-10-14 14:24:17,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 97 transitions, 496 flow [2024-10-14 14:24:17,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 97 transitions, 450 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-10-14 14:24:17,510 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow [2024-10-14 14:24:17,510 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2024-10-14 14:24:17,511 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2024-10-14 14:24:17,512 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow [2024-10-14 14:24:17,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:24:17,513 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:24:17,513 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:24:17,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 14:24:17,514 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-14 14:24:17,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:24:17,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2076356925, now seen corresponding path program 1 times [2024-10-14 14:24:17,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:24:17,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418646266] [2024-10-14 14:24:17,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:24:17,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:24:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:24:18,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:24:18,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:24:18,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418646266] [2024-10-14 14:24:18,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418646266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:24:18,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:24:18,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 14:24:18,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422329521] [2024-10-14 14:24:18,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:24:18,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:24:18,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:24:18,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:24:18,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:24:18,312 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2024-10-14 14:24:18,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:24:18,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:24:18,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2024-10-14 14:24:18,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:24:19,066 INFO L124 PetriNetUnfolderBase]: 5355/8998 cut-off events. [2024-10-14 14:24:19,066 INFO L125 PetriNetUnfolderBase]: For 4327/4562 co-relation queries the response was YES. [2024-10-14 14:24:19,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20705 conditions, 8998 events. 5355/8998 cut-off events. For 4327/4562 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 65571 event pairs, 639 based on Foata normal form. 16/8582 useless extension candidates. Maximal degree in co-relation 20689. Up to 2853 conditions per place. [2024-10-14 14:24:19,122 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 66 selfloop transitions, 20 changer transitions 12/126 dead transitions. [2024-10-14 14:24:19,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 126 transitions, 616 flow [2024-10-14 14:24:19,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 14:24:19,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-14 14:24:19,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 259 transitions. [2024-10-14 14:24:19,124 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6475 [2024-10-14 14:24:19,124 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 8 states and 259 transitions. [2024-10-14 14:24:19,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 126 transitions, 616 flow [2024-10-14 14:24:19,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 126 transitions, 500 flow, removed 27 selfloop flow, removed 10 redundant places. [2024-10-14 14:24:19,177 INFO L231 Difference]: Finished difference. Result has 71 places, 73 transitions, 304 flow [2024-10-14 14:24:19,177 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=304, PETRI_PLACES=71, PETRI_TRANSITIONS=73} [2024-10-14 14:24:19,178 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 13 predicate places. [2024-10-14 14:24:19,178 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 73 transitions, 304 flow [2024-10-14 14:24:19,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:24:19,179 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:24:19,179 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:24:19,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 14:24:19,179 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-14 14:24:19,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:24:19,180 INFO L85 PathProgramCache]: Analyzing trace with hash -890418345, now seen corresponding path program 2 times [2024-10-14 14:24:19,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:24:19,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609287276] [2024-10-14 14:24:19,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:24:19,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:24:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:24:19,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:24:19,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:24:19,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609287276] [2024-10-14 14:24:19,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609287276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:24:19,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:24:19,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:24:19,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878238603] [2024-10-14 14:24:19,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:24:19,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:24:19,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:24:19,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:24:19,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:24:19,398 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50 [2024-10-14 14:24:19,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 73 transitions, 304 flow. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:24:19,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:24:19,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50 [2024-10-14 14:24:19,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:24:19,834 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([375] L776-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_1| 0) (= |v_P1Thread1of1ForFork1_#res.base_1| 0)) InVars {} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_1|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#res.base][77], [18#L783true, 33#L761true, Black: 120#(= ~y~0 1), 59#true, Black: 130#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), 32#L822true, Black: 132#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), 16#L853-4true, 63#true, Black: 122#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 118#true, Black: 126#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (= ~y~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 57#true, 147#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 61#true, 21#P1EXITtrue, 128#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 98#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)))]) [2024-10-14 14:24:19,834 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-14 14:24:19,834 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-14 14:24:19,834 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-14 14:24:19,834 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-14 14:24:19,867 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([375] L776-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_1| 0) (= |v_P1Thread1of1ForFork1_#res.base_1| 0)) InVars {} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_1|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#res.base][77], [9#L829true, 18#L783true, 33#L761true, 59#true, Black: 120#(= ~y~0 1), Black: 130#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 132#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), 16#L853-4true, 63#true, Black: 122#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 118#true, Black: 126#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (= ~y~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 57#true, 147#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 61#true, 21#P1EXITtrue, 128#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 98#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)))]) [2024-10-14 14:24:19,867 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-14 14:24:19,867 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 14:24:19,867 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 14:24:19,867 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 14:24:19,879 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([375] L776-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_1| 0) (= |v_P1Thread1of1ForFork1_#res.base_1| 0)) InVars {} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_1|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#res.base][77], [18#L783true, 33#L761true, Black: 120#(= ~y~0 1), 59#true, Black: 130#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), 32#L822true, Black: 132#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), 63#true, Black: 122#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 118#true, Black: 126#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (= ~y~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 57#true, 147#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 61#true, 49#L854true, 128#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 21#P1EXITtrue, 98#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)))]) [2024-10-14 14:24:19,880 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-14 14:24:19,880 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 14:24:19,880 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 14:24:19,880 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 14:24:19,910 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([375] L776-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_1| 0) (= |v_P1Thread1of1ForFork1_#res.base_1| 0)) InVars {} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_1|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#res.base][77], [9#L829true, 18#L783true, 33#L761true, 59#true, Black: 120#(= ~y~0 1), Black: 130#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 132#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), 63#true, Black: 122#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 118#true, Black: 126#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (= ~y~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 57#true, 147#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 61#true, 49#L854true, 21#P1EXITtrue, 128#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 98#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)))]) [2024-10-14 14:24:19,911 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-14 14:24:19,911 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 14:24:19,911 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 14:24:19,911 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 14:24:19,913 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L829-->L832: Formula: (= (+ v_~__unbuffered_cnt~0_8 1) v_~__unbuffered_cnt~0_7) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~__unbuffered_cnt~0][84], [18#L783true, 33#L761true, 59#true, Black: 120#(= ~y~0 1), Black: 130#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 132#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), 16#L853-4true, 63#true, Black: 122#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 118#true, Black: 126#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (= ~y~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 36#L776true, 57#true, 115#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 17#L832true, 147#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 61#true, 128#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1))]) [2024-10-14 14:24:19,913 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is not cut-off event [2024-10-14 14:24:19,913 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-10-14 14:24:19,913 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-10-14 14:24:19,913 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-10-14 14:24:19,954 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L829-->L832: Formula: (= (+ v_~__unbuffered_cnt~0_8 1) v_~__unbuffered_cnt~0_7) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~__unbuffered_cnt~0][84], [18#L783true, 33#L761true, 59#true, Black: 120#(= ~y~0 1), Black: 130#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 132#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), 63#true, Black: 122#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 118#true, 36#L776true, Black: 126#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (= ~y~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 57#true, 115#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 17#L832true, 147#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 61#true, 49#L854true, 128#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1))]) [2024-10-14 14:24:19,954 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2024-10-14 14:24:19,955 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-10-14 14:24:19,955 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-10-14 14:24:19,955 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-10-14 14:24:20,251 INFO L124 PetriNetUnfolderBase]: 6489/11289 cut-off events. [2024-10-14 14:24:20,251 INFO L125 PetriNetUnfolderBase]: For 4132/4493 co-relation queries the response was YES. [2024-10-14 14:24:20,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26543 conditions, 11289 events. 6489/11289 cut-off events. For 4132/4493 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 90278 event pairs, 1540 based on Foata normal form. 155/10386 useless extension candidates. Maximal degree in co-relation 26525. Up to 4147 conditions per place. [2024-10-14 14:24:20,300 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 54 selfloop transitions, 4 changer transitions 13/113 dead transitions. [2024-10-14 14:24:20,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 113 transitions, 586 flow [2024-10-14 14:24:20,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:24:20,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 14:24:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2024-10-14 14:24:20,301 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.67 [2024-10-14 14:24:20,301 INFO L175 Difference]: Start difference. First operand has 71 places, 73 transitions, 304 flow. Second operand 6 states and 201 transitions. [2024-10-14 14:24:20,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 113 transitions, 586 flow [2024-10-14 14:24:20,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 113 transitions, 580 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-10-14 14:24:20,310 INFO L231 Difference]: Finished difference. Result has 76 places, 74 transitions, 329 flow [2024-10-14 14:24:20,310 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=329, PETRI_PLACES=76, PETRI_TRANSITIONS=74} [2024-10-14 14:24:20,311 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 18 predicate places. [2024-10-14 14:24:20,311 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 74 transitions, 329 flow [2024-10-14 14:24:20,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:24:20,312 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:24:20,312 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:24:20,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 14:24:20,312 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-14 14:24:20,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:24:20,312 INFO L85 PathProgramCache]: Analyzing trace with hash -338760927, now seen corresponding path program 3 times [2024-10-14 14:24:20,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:24:20,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526827112] [2024-10-14 14:24:20,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:24:20,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:24:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:24:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:24:20,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:24:20,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526827112] [2024-10-14 14:24:20,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526827112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:24:20,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:24:20,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:24:20,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256567802] [2024-10-14 14:24:20,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:24:20,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:24:20,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:24:20,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:24:20,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:24:20,988 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2024-10-14 14:24:20,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 74 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:24:20,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:24:20,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2024-10-14 14:24:20,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:24:22,210 INFO L124 PetriNetUnfolderBase]: 10115/17027 cut-off events. [2024-10-14 14:24:22,211 INFO L125 PetriNetUnfolderBase]: For 10167/10506 co-relation queries the response was YES. [2024-10-14 14:24:22,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42753 conditions, 17027 events. 10115/17027 cut-off events. For 10167/10506 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 137425 event pairs, 3346 based on Foata normal form. 232/16124 useless extension candidates. Maximal degree in co-relation 42732. Up to 7203 conditions per place. [2024-10-14 14:24:22,272 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 38 selfloop transitions, 9 changer transitions 39/116 dead transitions. [2024-10-14 14:24:22,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 116 transitions, 659 flow [2024-10-14 14:24:22,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:24:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 14:24:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2024-10-14 14:24:22,274 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.64 [2024-10-14 14:24:22,274 INFO L175 Difference]: Start difference. First operand has 76 places, 74 transitions, 329 flow. Second operand 6 states and 192 transitions. [2024-10-14 14:24:22,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 116 transitions, 659 flow [2024-10-14 14:24:22,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 116 transitions, 652 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-10-14 14:24:22,298 INFO L231 Difference]: Finished difference. Result has 80 places, 68 transitions, 317 flow [2024-10-14 14:24:22,299 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=80, PETRI_TRANSITIONS=68} [2024-10-14 14:24:22,299 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 22 predicate places. [2024-10-14 14:24:22,299 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 68 transitions, 317 flow [2024-10-14 14:24:22,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:24:22,300 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:24:22,300 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:24:22,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 14:24:22,300 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-14 14:24:22,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:24:22,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2091835999, now seen corresponding path program 4 times [2024-10-14 14:24:22,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:24:22,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829980746] [2024-10-14 14:24:22,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:24:22,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:24:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 14:24:22,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 14:24:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 14:24:22,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 14:24:22,416 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 14:24:22,418 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-10-14 14:24:22,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-10-14 14:24:22,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-10-14 14:24:22,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-14 14:24:22,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-14 14:24:22,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-14 14:24:22,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-10-14 14:24:22,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 14:24:22,420 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-10-14 14:24:22,498 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 14:24:22,498 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 14:24:22,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:24:22 BasicIcfg [2024-10-14 14:24:22,502 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 14:24:22,502 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 14:24:22,502 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 14:24:22,503 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 14:24:22,503 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:24:13" (3/4) ... [2024-10-14 14:24:22,506 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 14:24:22,590 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 14:24:22,590 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 14:24:22,590 INFO L158 Benchmark]: Toolchain (without parser) took 9977.56ms. Allocated memory was 176.2MB in the beginning and 947.9MB in the end (delta: 771.8MB). Free memory was 117.8MB in the beginning and 319.8MB in the end (delta: -201.9MB). Peak memory consumption was 571.4MB. Max. memory is 16.1GB. [2024-10-14 14:24:22,590 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 176.2MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 14:24:22,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.54ms. Allocated memory is still 176.2MB. Free memory was 117.8MB in the beginning and 92.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-14 14:24:22,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.06ms. Allocated memory is still 176.2MB. Free memory was 92.7MB in the beginning and 89.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 14:24:22,591 INFO L158 Benchmark]: Boogie Preprocessor took 46.43ms. Allocated memory is still 176.2MB. Free memory was 89.4MB in the beginning and 86.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 14:24:22,591 INFO L158 Benchmark]: RCFGBuilder took 637.10ms. Allocated memory was 176.2MB in the beginning and 262.1MB in the end (delta: 86.0MB). Free memory was 86.4MB in the beginning and 195.7MB in the end (delta: -109.3MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2024-10-14 14:24:22,591 INFO L158 Benchmark]: TraceAbstraction took 8739.30ms. Allocated memory was 262.1MB in the beginning and 947.9MB in the end (delta: 685.8MB). Free memory was 194.6MB in the beginning and 337.6MB in the end (delta: -143.0MB). Peak memory consumption was 542.8MB. Max. memory is 16.1GB. [2024-10-14 14:24:22,592 INFO L158 Benchmark]: Witness Printer took 87.55ms. Allocated memory is still 947.9MB. Free memory was 337.6MB in the beginning and 319.8MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 14:24:22,593 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 176.2MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.54ms. Allocated memory is still 176.2MB. Free memory was 117.8MB in the beginning and 92.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.06ms. Allocated memory is still 176.2MB. Free memory was 92.7MB in the beginning and 89.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.43ms. Allocated memory is still 176.2MB. Free memory was 89.4MB in the beginning and 86.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 637.10ms. Allocated memory was 176.2MB in the beginning and 262.1MB in the end (delta: 86.0MB). Free memory was 86.4MB in the beginning and 195.7MB in the end (delta: -109.3MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8739.30ms. Allocated memory was 262.1MB in the beginning and 947.9MB in the end (delta: 685.8MB). Free memory was 194.6MB in the beginning and 337.6MB in the end (delta: -143.0MB). Peak memory consumption was 542.8MB. Max. memory is 16.1GB. * Witness Printer took 87.55ms. Allocated memory is still 947.9MB. Free memory was 337.6MB in the beginning and 319.8MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1165; [L847] FCALL, FORK 0 pthread_create(&t1165, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1166; [L849] FCALL, FORK 0 pthread_create(&t1166, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165=-1, t1166=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1167; [L851] FCALL, FORK 0 pthread_create(&t1167, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165=-1, t1166=0, t1167=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L852] 0 pthread_t t1168; [L853] FCALL, FORK 0 pthread_create(&t1168, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165=-1, t1166=0, t1167=1, t1168=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 4 __unbuffered_p3_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165=-1, t1166=0, t1167=1, t1168=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165=-1, t1166=0, t1167=1, t1168=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165=-1, t1166=0, t1167=1, t1168=2, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 535 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 513 mSDsluCounter, 172 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1003 IncrementalHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 18 mSDtfsCounter, 1003 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=329occurred in iteration=7, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 884 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-14 14:24:22,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE