./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/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 ../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.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.graphml --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 19245e5542f28ce8a07a1858e0d4c05190b543a3d82e804c6a4eebc044c13d81 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:47:34,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:47:34,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:47:34,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:47:34,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:47:34,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:47:34,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:47:34,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:47:34,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:47:34,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:47:34,201 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:47:34,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:47:34,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:47:34,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:47:34,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:47:34,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:47:34,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:47:34,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:47:34,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:47:34,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:47:34,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:47:34,219 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:47:34,220 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:47:34,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:47:34,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:47:34,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:47:34,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:47:34,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:47:34,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:47:34,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:47:34,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:47:34,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:47:34,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:47:34,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:47:34,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:47:34,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:47:34,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:47:34,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:47:34,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:47:34,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:47:34,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:47:34,242 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:47:34,286 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:47:34,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:47:34,287 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:47:34,287 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:47:34,288 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:47:34,288 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:47:34,289 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:47:34,289 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:47:34,289 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:47:34,289 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:47:34,290 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:47:34,290 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:47:34,290 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:47:34,290 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:47:34,291 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:47:34,291 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:47:34,291 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:47:34,291 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:47:34,291 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:47:34,291 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:47:34,292 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:47:34,292 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:47:34,292 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:47:34,292 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:47:34,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:47:34,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:47:34,293 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:47:34,293 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:47:34,293 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:47:34,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:47:34,293 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:47:34,294 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:47:34,294 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:47:34,294 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:47:34,294 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:47:34,294 INFO L138 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.graphml 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 -> 19245e5542f28ce8a07a1858e0d4c05190b543a3d82e804c6a4eebc044c13d81 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 16:47:34,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:47:34,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:47:34,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:47:34,596 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:47:34,596 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:47:34,598 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.i [2023-08-30 16:47:35,829 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:47:36,062 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:47:36,062 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.i [2023-08-30 16:47:36,075 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5be7a63e/40d8b773418147b3bdc8cff40f375faf/FLAG1360c35e0 [2023-08-30 16:47:36,091 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5be7a63e/40d8b773418147b3bdc8cff40f375faf [2023-08-30 16:47:36,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:47:36,099 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:47:36,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:47:36,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:47:36,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:47:36,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:47:36" (1/1) ... [2023-08-30 16:47:36,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@286534de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:36, skipping insertion in model container [2023-08-30 16:47:36,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:47:36" (1/1) ... [2023-08-30 16:47:36,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:47:36,158 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:47:36,286 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.i[944,957] [2023-08-30 16:47:36,554 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:47:36,566 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:47:36,575 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.i[944,957] [2023-08-30 16:47:36,626 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:47:36,651 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:47:36,651 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:47:36,657 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:47:36,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:36 WrapperNode [2023-08-30 16:47:36,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:47:36,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:47:36,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:47:36,659 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:47:36,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:36" (1/1) ... [2023-08-30 16:47:36,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:36" (1/1) ... [2023-08-30 16:47:36,710 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 282 [2023-08-30 16:47:36,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:47:36,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:47:36,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:47:36,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:47:36,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:36" (1/1) ... [2023-08-30 16:47:36,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:36" (1/1) ... [2023-08-30 16:47:36,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:36" (1/1) ... [2023-08-30 16:47:36,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:36" (1/1) ... [2023-08-30 16:47:36,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:36" (1/1) ... [2023-08-30 16:47:36,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:36" (1/1) ... [2023-08-30 16:47:36,737 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:36" (1/1) ... [2023-08-30 16:47:36,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:36" (1/1) ... [2023-08-30 16:47:36,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:47:36,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:47:36,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:47:36,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:47:36,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:36" (1/1) ... [2023-08-30 16:47:36,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:47:36,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:47:36,770 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 16:47:36,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 16:47:36,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:47:36,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:47:36,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:47:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:47:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:47:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:47:36,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:47:36,808 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:47:36,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:47:36,808 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:47:36,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:47:36,808 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 16:47:36,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 16:47:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:47:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:47:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:47:36,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:47:36,810 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:47:36,984 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:47:36,986 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:47:37,403 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:47:37,634 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:47:37,634 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:47:37,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:47:37 BoogieIcfgContainer [2023-08-30 16:47:37,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:47:37,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:47:37,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:47:37,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:47:37,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:47:36" (1/3) ... [2023-08-30 16:47:37,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8996d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:47:37, skipping insertion in model container [2023-08-30 16:47:37,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:36" (2/3) ... [2023-08-30 16:47:37,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8996d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:47:37, skipping insertion in model container [2023-08-30 16:47:37,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:47:37" (3/3) ... [2023-08-30 16:47:37,644 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_tso.i [2023-08-30 16:47:37,651 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:47:37,659 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:47:37,660 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-08-30 16:47:37,660 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:47:37,737 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:47:37,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 151 transitions, 322 flow [2023-08-30 16:47:37,859 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2023-08-30 16:47:37,860 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:47:37,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2023-08-30 16:47:37,871 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 151 transitions, 322 flow [2023-08-30 16:47:37,879 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 147 transitions, 306 flow [2023-08-30 16:47:37,883 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:47:37,899 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 147 transitions, 306 flow [2023-08-30 16:47:37,906 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 147 transitions, 306 flow [2023-08-30 16:47:37,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 147 transitions, 306 flow [2023-08-30 16:47:37,951 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2023-08-30 16:47:37,952 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:47:37,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2023-08-30 16:47:37,957 INFO L119 LiptonReduction]: Number of co-enabled transitions 3392 [2023-08-30 16:47:45,257 INFO L134 LiptonReduction]: Checked pairs total: 9980 [2023-08-30 16:47:45,257 INFO L136 LiptonReduction]: Total number of compositions: 128 [2023-08-30 16:47:45,268 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:47:45,273 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@272619e5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:47:45,273 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-08-30 16:47:45,275 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-08-30 16:47:45,275 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:47:45,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:47:45,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 16:47:45,276 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 16:47:45,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:47:45,280 INFO L85 PathProgramCache]: Analyzing trace with hash 749938511, now seen corresponding path program 1 times [2023-08-30 16:47:45,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:47:45,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673283126] [2023-08-30 16:47:45,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:47:45,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:47:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:47:45,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:47:45,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:47:45,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673283126] [2023-08-30 16:47:45,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673283126] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:47:45,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:47:45,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:47:45,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61546742] [2023-08-30 16:47:45,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:47:45,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:47:45,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:47:45,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:47:45,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:47:45,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 279 [2023-08-30 16:47:45,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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) [2023-08-30 16:47:45,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:47:45,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 279 [2023-08-30 16:47:45,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:47:47,581 INFO L130 PetriNetUnfolder]: 7477/10303 cut-off events. [2023-08-30 16:47:47,581 INFO L131 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2023-08-30 16:47:47,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20605 conditions, 10303 events. 7477/10303 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 53731 event pairs, 2413 based on Foata normal form. 0/9398 useless extension candidates. Maximal degree in co-relation 20593. Up to 8473 conditions per place. [2023-08-30 16:47:47,644 INFO L137 encePairwiseOnDemand]: 276/279 looper letters, 44 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-08-30 16:47:47,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 210 flow [2023-08-30 16:47:47,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:47:47,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:47:47,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2023-08-30 16:47:47,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5256869772998806 [2023-08-30 16:47:47,656 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2023-08-30 16:47:47,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2023-08-30 16:47:47,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:47:47,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2023-08-30 16:47:47,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 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) [2023-08-30 16:47:47,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 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) [2023-08-30 16:47:47,667 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 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) [2023-08-30 16:47:47,668 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 76 flow. Second operand 3 states and 440 transitions. [2023-08-30 16:47:47,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 210 flow [2023-08-30 16:47:47,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 16:47:47,675 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 74 flow [2023-08-30 16:47:47,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-08-30 16:47:47,680 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-08-30 16:47:47,681 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2023-08-30 16:47:47,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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) [2023-08-30 16:47:47,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:47:47,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:47:47,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:47:47,685 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 16:47:47,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:47:47,693 INFO L85 PathProgramCache]: Analyzing trace with hash -881519320, now seen corresponding path program 1 times [2023-08-30 16:47:47,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:47:47,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947750811] [2023-08-30 16:47:47,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:47:47,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:47:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:47:47,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:47:47,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:47:47,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947750811] [2023-08-30 16:47:47,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947750811] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:47:47,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:47:47,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:47:47,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344069564] [2023-08-30 16:47:47,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:47:47,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:47:47,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:47:47,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:47:47,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:47:47,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 279 [2023-08-30 16:47:47,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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) [2023-08-30 16:47:47,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:47:47,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 279 [2023-08-30 16:47:47,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:47:49,420 INFO L130 PetriNetUnfolder]: 6237/8887 cut-off events. [2023-08-30 16:47:49,420 INFO L131 PetriNetUnfolder]: For 437/437 co-relation queries the response was YES. [2023-08-30 16:47:49,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17987 conditions, 8887 events. 6237/8887 cut-off events. For 437/437 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 49383 event pairs, 1277 based on Foata normal form. 0/8466 useless extension candidates. Maximal degree in co-relation 17977. Up to 6561 conditions per place. [2023-08-30 16:47:49,467 INFO L137 encePairwiseOnDemand]: 276/279 looper letters, 36 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2023-08-30 16:47:49,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 182 flow [2023-08-30 16:47:49,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:47:49,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:47:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-08-30 16:47:49,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2023-08-30 16:47:49,470 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-08-30 16:47:49,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-08-30 16:47:49,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:47:49,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-08-30 16:47:49,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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) [2023-08-30 16:47:49,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 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) [2023-08-30 16:47:49,475 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 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) [2023-08-30 16:47:49,476 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 3 states and 434 transitions. [2023-08-30 16:47:49,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 182 flow [2023-08-30 16:47:49,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:47:49,478 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2023-08-30 16:47:49,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-08-30 16:47:49,479 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-08-30 16:47:49,479 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2023-08-30 16:47:49,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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) [2023-08-30 16:47:49,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:47:49,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:47:49,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:47:49,480 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 16:47:49,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:47:49,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1031410502, now seen corresponding path program 1 times [2023-08-30 16:47:49,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:47:49,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682474642] [2023-08-30 16:47:49,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:47:49,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:47:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:00,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:48:00,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:00,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682474642] [2023-08-30 16:48:00,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682474642] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:00,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:00,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:48:00,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514450855] [2023-08-30 16:48:00,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:00,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:48:00,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:00,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:48:00,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:48:00,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 279 [2023-08-30 16:48:00,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 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) [2023-08-30 16:48:00,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:00,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 279 [2023-08-30 16:48:00,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:02,106 INFO L130 PetriNetUnfolder]: 10027/13477 cut-off events. [2023-08-30 16:48:02,107 INFO L131 PetriNetUnfolder]: For 460/460 co-relation queries the response was YES. [2023-08-30 16:48:02,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27799 conditions, 13477 events. 10027/13477 cut-off events. For 460/460 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 64150 event pairs, 1519 based on Foata normal form. 144/13620 useless extension candidates. Maximal degree in co-relation 27789. Up to 11869 conditions per place. [2023-08-30 16:48:02,177 INFO L137 encePairwiseOnDemand]: 267/279 looper letters, 48 selfloop transitions, 12 changer transitions 0/61 dead transitions. [2023-08-30 16:48:02,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 262 flow [2023-08-30 16:48:02,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:48:02,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:48:02,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2023-08-30 16:48:02,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47491039426523296 [2023-08-30 16:48:02,180 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2023-08-30 16:48:02,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2023-08-30 16:48:02,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:02,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2023-08-30 16:48:02,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 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) [2023-08-30 16:48:02,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 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) [2023-08-30 16:48:02,185 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 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) [2023-08-30 16:48:02,185 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 4 states and 530 transitions. [2023-08-30 16:48:02,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 262 flow [2023-08-30 16:48:02,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 61 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:48:02,193 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 150 flow [2023-08-30 16:48:02,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2023-08-30 16:48:02,194 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2023-08-30 16:48:02,194 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 150 flow [2023-08-30 16:48:02,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 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) [2023-08-30 16:48:02,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:02,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:48:02,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:48:02,195 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 16:48:02,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:02,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1909040358, now seen corresponding path program 1 times [2023-08-30 16:48:02,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:02,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439072061] [2023-08-30 16:48:02,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:02,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:48:02,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:02,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439072061] [2023-08-30 16:48:02,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439072061] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:02,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:02,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:48:02,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871853949] [2023-08-30 16:48:02,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:02,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:48:02,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:02,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:48:02,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:48:02,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 279 [2023-08-30 16:48:02,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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) [2023-08-30 16:48:02,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:02,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 279 [2023-08-30 16:48:02,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:03,557 INFO L130 PetriNetUnfolder]: 6985/9839 cut-off events. [2023-08-30 16:48:03,557 INFO L131 PetriNetUnfolder]: For 3509/3733 co-relation queries the response was YES. [2023-08-30 16:48:03,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26211 conditions, 9839 events. 6985/9839 cut-off events. For 3509/3733 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 54415 event pairs, 1779 based on Foata normal form. 236/9960 useless extension candidates. Maximal degree in co-relation 26199. Up to 6451 conditions per place. [2023-08-30 16:48:03,610 INFO L137 encePairwiseOnDemand]: 276/279 looper letters, 53 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2023-08-30 16:48:03,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 339 flow [2023-08-30 16:48:03,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:48:03,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:48:03,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-08-30 16:48:03,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197132616487455 [2023-08-30 16:48:03,612 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-08-30 16:48:03,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-08-30 16:48:03,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:03,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-08-30 16:48:03,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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) [2023-08-30 16:48:03,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 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) [2023-08-30 16:48:03,616 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 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) [2023-08-30 16:48:03,616 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 150 flow. Second operand 3 states and 435 transitions. [2023-08-30 16:48:03,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 339 flow [2023-08-30 16:48:03,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 339 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:48:03,619 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 161 flow [2023-08-30 16:48:03,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2023-08-30 16:48:03,620 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2023-08-30 16:48:03,620 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 161 flow [2023-08-30 16:48:03,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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) [2023-08-30 16:48:03,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:03,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:48:03,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:48:03,621 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 16:48:03,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:03,621 INFO L85 PathProgramCache]: Analyzing trace with hash -307548249, now seen corresponding path program 1 times [2023-08-30 16:48:03,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:03,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232654514] [2023-08-30 16:48:03,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:03,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:48:03,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:03,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232654514] [2023-08-30 16:48:03,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232654514] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:03,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:03,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:48:03,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613745434] [2023-08-30 16:48:03,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:03,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:48:03,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:03,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:48:03,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:48:03,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 279 [2023-08-30 16:48:03,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 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) [2023-08-30 16:48:03,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:03,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 279 [2023-08-30 16:48:03,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:05,117 INFO L130 PetriNetUnfolder]: 6941/9827 cut-off events. [2023-08-30 16:48:05,117 INFO L131 PetriNetUnfolder]: For 5572/6116 co-relation queries the response was YES. [2023-08-30 16:48:05,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26748 conditions, 9827 events. 6941/9827 cut-off events. For 5572/6116 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 53332 event pairs, 2505 based on Foata normal form. 304/9864 useless extension candidates. Maximal degree in co-relation 26733. Up to 5215 conditions per place. [2023-08-30 16:48:05,162 INFO L137 encePairwiseOnDemand]: 276/279 looper letters, 43 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2023-08-30 16:48:05,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 292 flow [2023-08-30 16:48:05,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:48:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:48:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-08-30 16:48:05,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5149342891278376 [2023-08-30 16:48:05,166 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-08-30 16:48:05,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-08-30 16:48:05,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:05,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-08-30 16:48:05,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 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) [2023-08-30 16:48:05,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 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) [2023-08-30 16:48:05,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 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) [2023-08-30 16:48:05,171 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 161 flow. Second operand 3 states and 431 transitions. [2023-08-30 16:48:05,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 292 flow [2023-08-30 16:48:05,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 52 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:48:05,180 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 166 flow [2023-08-30 16:48:05,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-08-30 16:48:05,182 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-08-30 16:48:05,182 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 166 flow [2023-08-30 16:48:05,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 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) [2023-08-30 16:48:05,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:05,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:48:05,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:48:05,183 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 16:48:05,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:05,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1387425292, now seen corresponding path program 1 times [2023-08-30 16:48:05,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:05,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480418243] [2023-08-30 16:48:05,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:05,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:05,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:48:05,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:05,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480418243] [2023-08-30 16:48:05,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480418243] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:05,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:05,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:48:05,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048080395] [2023-08-30 16:48:05,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:05,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:48:05,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:05,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:48:05,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:48:05,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 279 [2023-08-30 16:48:05,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 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) [2023-08-30 16:48:05,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:05,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 279 [2023-08-30 16:48:05,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:06,106 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([612] L840-->L852: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_209 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_26 256) 0))) (.cse8 (not (= (mod v_~z$w_buff0_used~0_155 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_34 256) 0))) (.cse11 (not (= (mod v_~z$r_buff0_thd3~0_38 256) 0)))) (let ((.cse2 (and .cse11 (not (= (mod v_~z$w_buff0_used~0_156 256) 0)))) (.cse3 (and .cse9 (not (= (mod v_~z$w_buff1_used~0_147 256) 0)))) (.cse4 (and .cse8 .cse11)) (.cse7 (and .cse0 (not (= 0 (mod v_~x$w_buff1_used~0_199 256))))) (.cse5 (and .cse1 .cse10)) (.cse6 (and (not (= 0 (mod v_~x$w_buff0_used~0_210 256))) .cse10))) (and (= v_~x$r_buff1_thd3~0_25 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_198 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_26)) (= (ite .cse2 v_~z$w_buff0~0_87 (ite .cse3 v_~z$w_buff1~0_78 v_~z~0_148)) v_~z~0_147) (= v_~z$w_buff0_used~0_155 (ite .cse2 0 v_~z$w_buff0_used~0_156)) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_147) v_~z$w_buff1_used~0_146) (= v_~z$r_buff0_thd3~0_37 (ite .cse4 0 v_~z$r_buff0_thd3~0_38)) (= (ite .cse5 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= (ite .cse6 v_~x$w_buff0~0_95 (ite .cse7 v_~x$w_buff1~0_90 v_~x~0_146)) v_~x~0_145) (= v_~x$w_buff1_used~0_198 (ite (or .cse7 .cse5) 0 v_~x$w_buff1_used~0_199)) (= v_~x$w_buff0_used~0_209 (ite .cse6 0 v_~x$w_buff0_used~0_210)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_37 256) 0)) .cse8) (and .cse9 (not (= (mod v_~z$w_buff1_used~0_146 256) 0)))) 0 v_~z$r_buff1_thd3~0_34) v_~z$r_buff1_thd3~0_33)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_156, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_147, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z~0=v_~z~0_148, ~x~0=v_~x~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_155, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_146, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~z~0=v_~z~0_147, ~x~0=v_~x~0_145} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~z$r_buff0_thd3~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0][74], [P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 110#L872true, 91#L820true, 187#(= ~__unbuffered_p3_EAX~0 0), 173#true, 65#L3true, Black: 175#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 176#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0)))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 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)))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~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 (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (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)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))))), 195#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 182#(= ~__unbuffered_p1_EAX~0 0), 123#L852true, 144#L781true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse]) [2023-08-30 16:48:06,107 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 16:48:06,107 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:48:06,107 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:48:06,107 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:48:06,194 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([612] L840-->L852: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_209 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_26 256) 0))) (.cse8 (not (= (mod v_~z$w_buff0_used~0_155 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_34 256) 0))) (.cse11 (not (= (mod v_~z$r_buff0_thd3~0_38 256) 0)))) (let ((.cse2 (and .cse11 (not (= (mod v_~z$w_buff0_used~0_156 256) 0)))) (.cse3 (and .cse9 (not (= (mod v_~z$w_buff1_used~0_147 256) 0)))) (.cse4 (and .cse8 .cse11)) (.cse7 (and .cse0 (not (= 0 (mod v_~x$w_buff1_used~0_199 256))))) (.cse5 (and .cse1 .cse10)) (.cse6 (and (not (= 0 (mod v_~x$w_buff0_used~0_210 256))) .cse10))) (and (= v_~x$r_buff1_thd3~0_25 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_198 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_26)) (= (ite .cse2 v_~z$w_buff0~0_87 (ite .cse3 v_~z$w_buff1~0_78 v_~z~0_148)) v_~z~0_147) (= v_~z$w_buff0_used~0_155 (ite .cse2 0 v_~z$w_buff0_used~0_156)) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_147) v_~z$w_buff1_used~0_146) (= v_~z$r_buff0_thd3~0_37 (ite .cse4 0 v_~z$r_buff0_thd3~0_38)) (= (ite .cse5 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= (ite .cse6 v_~x$w_buff0~0_95 (ite .cse7 v_~x$w_buff1~0_90 v_~x~0_146)) v_~x~0_145) (= v_~x$w_buff1_used~0_198 (ite (or .cse7 .cse5) 0 v_~x$w_buff1_used~0_199)) (= v_~x$w_buff0_used~0_209 (ite .cse6 0 v_~x$w_buff0_used~0_210)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_37 256) 0)) .cse8) (and .cse9 (not (= (mod v_~z$w_buff1_used~0_146 256) 0)))) 0 v_~z$r_buff1_thd3~0_34) v_~z$r_buff1_thd3~0_33)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_156, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_147, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z~0=v_~z~0_148, ~x~0=v_~x~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_155, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_146, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~z~0=v_~z~0_147, ~x~0=v_~x~0_145} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~z$r_buff0_thd3~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0][104], [P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 193#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 110#L872true, 91#L820true, 187#(= ~__unbuffered_p3_EAX~0 0), 173#true, 65#L3true, 115#P0EXITtrue, Black: 175#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 176#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0)))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 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)))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~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 (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (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)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))))), Black: 182#(= ~__unbuffered_p1_EAX~0 0), 123#L852true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse]) [2023-08-30 16:48:06,194 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:48:06,194 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:48:06,194 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:48:06,194 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:48:06,623 INFO L130 PetriNetUnfolder]: 6282/8867 cut-off events. [2023-08-30 16:48:06,623 INFO L131 PetriNetUnfolder]: For 5752/6162 co-relation queries the response was YES. [2023-08-30 16:48:06,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25286 conditions, 8867 events. 6282/8867 cut-off events. For 5752/6162 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 48726 event pairs, 1109 based on Foata normal form. 734/9309 useless extension candidates. Maximal degree in co-relation 25270. Up to 5039 conditions per place. [2023-08-30 16:48:06,656 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 84 selfloop transitions, 8 changer transitions 15/113 dead transitions. [2023-08-30 16:48:06,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 113 transitions, 673 flow [2023-08-30 16:48:06,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:48:06,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:48:06,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 691 transitions. [2023-08-30 16:48:06,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4953405017921147 [2023-08-30 16:48:06,662 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 691 transitions. [2023-08-30 16:48:06,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 691 transitions. [2023-08-30 16:48:06,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:06,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 691 transitions. [2023-08-30 16:48:06,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.2) internal successors, (691), 5 states have internal predecessors, (691), 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) [2023-08-30 16:48:06,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 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) [2023-08-30 16:48:06,668 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 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) [2023-08-30 16:48:06,668 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 166 flow. Second operand 5 states and 691 transitions. [2023-08-30 16:48:06,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 113 transitions, 673 flow [2023-08-30 16:48:06,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 113 transitions, 655 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:48:06,681 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 227 flow [2023-08-30 16:48:06,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2023-08-30 16:48:06,684 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2023-08-30 16:48:06,684 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 227 flow [2023-08-30 16:48:06,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 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) [2023-08-30 16:48:06,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:06,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:48:06,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:48:06,686 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 16:48:06,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:06,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2044306062, now seen corresponding path program 1 times [2023-08-30 16:48:06,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:06,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746706696] [2023-08-30 16:48:06,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:06,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:48:07,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:07,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746706696] [2023-08-30 16:48:07,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746706696] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:07,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:07,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:48:07,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057598677] [2023-08-30 16:48:07,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:07,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:48:07,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:07,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:48:07,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:48:07,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 279 [2023-08-30 16:48:07,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 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) [2023-08-30 16:48:07,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:07,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 279 [2023-08-30 16:48:07,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:07,870 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([612] L840-->L852: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_209 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_26 256) 0))) (.cse8 (not (= (mod v_~z$w_buff0_used~0_155 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_34 256) 0))) (.cse11 (not (= (mod v_~z$r_buff0_thd3~0_38 256) 0)))) (let ((.cse2 (and .cse11 (not (= (mod v_~z$w_buff0_used~0_156 256) 0)))) (.cse3 (and .cse9 (not (= (mod v_~z$w_buff1_used~0_147 256) 0)))) (.cse4 (and .cse8 .cse11)) (.cse7 (and .cse0 (not (= 0 (mod v_~x$w_buff1_used~0_199 256))))) (.cse5 (and .cse1 .cse10)) (.cse6 (and (not (= 0 (mod v_~x$w_buff0_used~0_210 256))) .cse10))) (and (= v_~x$r_buff1_thd3~0_25 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_198 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_26)) (= (ite .cse2 v_~z$w_buff0~0_87 (ite .cse3 v_~z$w_buff1~0_78 v_~z~0_148)) v_~z~0_147) (= v_~z$w_buff0_used~0_155 (ite .cse2 0 v_~z$w_buff0_used~0_156)) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_147) v_~z$w_buff1_used~0_146) (= v_~z$r_buff0_thd3~0_37 (ite .cse4 0 v_~z$r_buff0_thd3~0_38)) (= (ite .cse5 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= (ite .cse6 v_~x$w_buff0~0_95 (ite .cse7 v_~x$w_buff1~0_90 v_~x~0_146)) v_~x~0_145) (= v_~x$w_buff1_used~0_198 (ite (or .cse7 .cse5) 0 v_~x$w_buff1_used~0_199)) (= v_~x$w_buff0_used~0_209 (ite .cse6 0 v_~x$w_buff0_used~0_210)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_37 256) 0)) .cse8) (and .cse9 (not (= (mod v_~z$w_buff1_used~0_146 256) 0)))) 0 v_~z$r_buff1_thd3~0_34) v_~z$r_buff1_thd3~0_33)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_156, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_147, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z~0=v_~z~0_148, ~x~0=v_~x~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_155, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_146, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~z~0=v_~z~0_147, ~x~0=v_~x~0_145} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~z$r_buff0_thd3~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0][74], [P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, Black: 193#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 110#L872true, Black: 192#(= ~__unbuffered_cnt~0 0), 91#L820true, 173#true, 65#L3true, Black: 175#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 176#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0)))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 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)))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~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 (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (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)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))))), 195#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 182#(= ~__unbuffered_p1_EAX~0 0), 123#L852true, 206#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 144#L781true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse]) [2023-08-30 16:48:07,871 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 16:48:07,871 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:48:07,871 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:48:07,871 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:48:07,963 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([612] L840-->L852: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_209 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_26 256) 0))) (.cse8 (not (= (mod v_~z$w_buff0_used~0_155 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_34 256) 0))) (.cse11 (not (= (mod v_~z$r_buff0_thd3~0_38 256) 0)))) (let ((.cse2 (and .cse11 (not (= (mod v_~z$w_buff0_used~0_156 256) 0)))) (.cse3 (and .cse9 (not (= (mod v_~z$w_buff1_used~0_147 256) 0)))) (.cse4 (and .cse8 .cse11)) (.cse7 (and .cse0 (not (= 0 (mod v_~x$w_buff1_used~0_199 256))))) (.cse5 (and .cse1 .cse10)) (.cse6 (and (not (= 0 (mod v_~x$w_buff0_used~0_210 256))) .cse10))) (and (= v_~x$r_buff1_thd3~0_25 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_198 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_26)) (= (ite .cse2 v_~z$w_buff0~0_87 (ite .cse3 v_~z$w_buff1~0_78 v_~z~0_148)) v_~z~0_147) (= v_~z$w_buff0_used~0_155 (ite .cse2 0 v_~z$w_buff0_used~0_156)) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_147) v_~z$w_buff1_used~0_146) (= v_~z$r_buff0_thd3~0_37 (ite .cse4 0 v_~z$r_buff0_thd3~0_38)) (= (ite .cse5 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= (ite .cse6 v_~x$w_buff0~0_95 (ite .cse7 v_~x$w_buff1~0_90 v_~x~0_146)) v_~x~0_145) (= v_~x$w_buff1_used~0_198 (ite (or .cse7 .cse5) 0 v_~x$w_buff1_used~0_199)) (= v_~x$w_buff0_used~0_209 (ite .cse6 0 v_~x$w_buff0_used~0_210)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_37 256) 0)) .cse8) (and .cse9 (not (= (mod v_~z$w_buff1_used~0_146 256) 0)))) 0 v_~z$r_buff1_thd3~0_34) v_~z$r_buff1_thd3~0_33)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_156, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_147, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z~0=v_~z~0_148, ~x~0=v_~x~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_155, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_146, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~z~0=v_~z~0_147, ~x~0=v_~x~0_145} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~z$r_buff0_thd3~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0][107], [P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 193#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 195#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 110#L872true, Black: 192#(= ~__unbuffered_cnt~0 0), 91#L820true, 173#true, 65#L3true, 115#P0EXITtrue, 208#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 175#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 176#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0)))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 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)))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~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 (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (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)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))))), Black: 182#(= ~__unbuffered_p1_EAX~0 0), 123#L852true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse]) [2023-08-30 16:48:07,963 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:48:07,963 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:48:07,963 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:48:07,964 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:48:08,228 INFO L130 PetriNetUnfolder]: 4875/7058 cut-off events. [2023-08-30 16:48:08,229 INFO L131 PetriNetUnfolder]: For 6803/7209 co-relation queries the response was YES. [2023-08-30 16:48:08,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23300 conditions, 7058 events. 4875/7058 cut-off events. For 6803/7209 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 39184 event pairs, 691 based on Foata normal form. 460/7297 useless extension candidates. Maximal degree in co-relation 23281. Up to 3304 conditions per place. [2023-08-30 16:48:08,263 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 102 selfloop transitions, 15 changer transitions 29/152 dead transitions. [2023-08-30 16:48:08,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 152 transitions, 978 flow [2023-08-30 16:48:08,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:48:08,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:48:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 968 transitions. [2023-08-30 16:48:08,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4956477214541731 [2023-08-30 16:48:08,267 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 968 transitions. [2023-08-30 16:48:08,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 968 transitions. [2023-08-30 16:48:08,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:08,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 968 transitions. [2023-08-30 16:48:08,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.28571428571428) internal successors, (968), 7 states have internal predecessors, (968), 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) [2023-08-30 16:48:08,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 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) [2023-08-30 16:48:08,273 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 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) [2023-08-30 16:48:08,273 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 227 flow. Second operand 7 states and 968 transitions. [2023-08-30 16:48:08,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 152 transitions, 978 flow [2023-08-30 16:48:08,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 152 transitions, 973 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:48:08,294 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 330 flow [2023-08-30 16:48:08,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=330, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2023-08-30 16:48:08,294 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2023-08-30 16:48:08,294 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 330 flow [2023-08-30 16:48:08,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 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) [2023-08-30 16:48:08,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:08,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:48:08,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:48:08,296 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 16:48:08,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:08,296 INFO L85 PathProgramCache]: Analyzing trace with hash 828471236, now seen corresponding path program 1 times [2023-08-30 16:48:08,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:08,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691230086] [2023-08-30 16:48:08,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:08,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:08,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:48:08,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:08,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691230086] [2023-08-30 16:48:08,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691230086] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:08,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:08,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:48:08,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617796218] [2023-08-30 16:48:08,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:08,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:48:08,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:08,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:48:08,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:48:08,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 279 [2023-08-30 16:48:08,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 126.16666666666667) internal successors, (757), 6 states have internal predecessors, (757), 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) [2023-08-30 16:48:08,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:08,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 279 [2023-08-30 16:48:08,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:09,335 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([612] L840-->L852: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_209 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_26 256) 0))) (.cse8 (not (= (mod v_~z$w_buff0_used~0_155 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_34 256) 0))) (.cse11 (not (= (mod v_~z$r_buff0_thd3~0_38 256) 0)))) (let ((.cse2 (and .cse11 (not (= (mod v_~z$w_buff0_used~0_156 256) 0)))) (.cse3 (and .cse9 (not (= (mod v_~z$w_buff1_used~0_147 256) 0)))) (.cse4 (and .cse8 .cse11)) (.cse7 (and .cse0 (not (= 0 (mod v_~x$w_buff1_used~0_199 256))))) (.cse5 (and .cse1 .cse10)) (.cse6 (and (not (= 0 (mod v_~x$w_buff0_used~0_210 256))) .cse10))) (and (= v_~x$r_buff1_thd3~0_25 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_198 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_26)) (= (ite .cse2 v_~z$w_buff0~0_87 (ite .cse3 v_~z$w_buff1~0_78 v_~z~0_148)) v_~z~0_147) (= v_~z$w_buff0_used~0_155 (ite .cse2 0 v_~z$w_buff0_used~0_156)) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_147) v_~z$w_buff1_used~0_146) (= v_~z$r_buff0_thd3~0_37 (ite .cse4 0 v_~z$r_buff0_thd3~0_38)) (= (ite .cse5 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= (ite .cse6 v_~x$w_buff0~0_95 (ite .cse7 v_~x$w_buff1~0_90 v_~x~0_146)) v_~x~0_145) (= v_~x$w_buff1_used~0_198 (ite (or .cse7 .cse5) 0 v_~x$w_buff1_used~0_199)) (= v_~x$w_buff0_used~0_209 (ite .cse6 0 v_~x$w_buff0_used~0_210)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_37 256) 0)) .cse8) (and .cse9 (not (= (mod v_~z$w_buff1_used~0_146 256) 0)))) 0 v_~z$r_buff1_thd3~0_34) v_~z$r_buff1_thd3~0_33)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_156, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_147, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z~0=v_~z~0_148, ~x~0=v_~x~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_155, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_146, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~z~0=v_~z~0_147, ~x~0=v_~x~0_145} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~z$r_buff0_thd3~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0][74], [P0Thread1of1ForFork1InUse, 220#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 193#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 110#L872true, Black: 192#(= ~__unbuffered_cnt~0 0), 91#L820true, 173#true, 65#L3true, Black: 208#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 175#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 203#(<= ~__unbuffered_cnt~0 1), Black: 176#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0)))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 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)))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~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 (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (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)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))))), Black: 204#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 195#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 182#(= ~__unbuffered_p1_EAX~0 0), 123#L852true, 206#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P1Thread1of1ForFork3InUse, 144#L781true, P3Thread1of1ForFork2InUse]) [2023-08-30 16:48:09,336 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 16:48:09,336 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:48:09,336 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:48:09,336 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:48:09,442 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([612] L840-->L852: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_209 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_26 256) 0))) (.cse8 (not (= (mod v_~z$w_buff0_used~0_155 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_34 256) 0))) (.cse11 (not (= (mod v_~z$r_buff0_thd3~0_38 256) 0)))) (let ((.cse2 (and .cse11 (not (= (mod v_~z$w_buff0_used~0_156 256) 0)))) (.cse3 (and .cse9 (not (= (mod v_~z$w_buff1_used~0_147 256) 0)))) (.cse4 (and .cse8 .cse11)) (.cse7 (and .cse0 (not (= 0 (mod v_~x$w_buff1_used~0_199 256))))) (.cse5 (and .cse1 .cse10)) (.cse6 (and (not (= 0 (mod v_~x$w_buff0_used~0_210 256))) .cse10))) (and (= v_~x$r_buff1_thd3~0_25 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_198 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_26)) (= (ite .cse2 v_~z$w_buff0~0_87 (ite .cse3 v_~z$w_buff1~0_78 v_~z~0_148)) v_~z~0_147) (= v_~z$w_buff0_used~0_155 (ite .cse2 0 v_~z$w_buff0_used~0_156)) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_147) v_~z$w_buff1_used~0_146) (= v_~z$r_buff0_thd3~0_37 (ite .cse4 0 v_~z$r_buff0_thd3~0_38)) (= (ite .cse5 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= (ite .cse6 v_~x$w_buff0~0_95 (ite .cse7 v_~x$w_buff1~0_90 v_~x~0_146)) v_~x~0_145) (= v_~x$w_buff1_used~0_198 (ite (or .cse7 .cse5) 0 v_~x$w_buff1_used~0_199)) (= v_~x$w_buff0_used~0_209 (ite .cse6 0 v_~x$w_buff0_used~0_210)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_37 256) 0)) .cse8) (and .cse9 (not (= (mod v_~z$w_buff1_used~0_146 256) 0)))) 0 v_~z$r_buff1_thd3~0_34) v_~z$r_buff1_thd3~0_33)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_156, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_147, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z~0=v_~z~0_148, ~x~0=v_~x~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_155, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_146, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~z~0=v_~z~0_147, ~x~0=v_~x~0_145} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~z$r_buff0_thd3~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0][107], [P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 193#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 195#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 110#L872true, Black: 192#(= ~__unbuffered_cnt~0 0), 91#L820true, 173#true, 65#L3true, 208#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 115#P0EXITtrue, Black: 175#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 203#(<= ~__unbuffered_cnt~0 1), Black: 176#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0)))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 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)))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~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 (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (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)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))))), Black: 204#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 182#(= ~__unbuffered_p1_EAX~0 0), 123#L852true, P1Thread1of1ForFork3InUse, 222#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P3Thread1of1ForFork2InUse]) [2023-08-30 16:48:09,442 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:48:09,442 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:48:09,442 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:48:09,442 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:48:09,684 INFO L130 PetriNetUnfolder]: 4306/6270 cut-off events. [2023-08-30 16:48:09,685 INFO L131 PetriNetUnfolder]: For 9554/9952 co-relation queries the response was YES. [2023-08-30 16:48:09,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22393 conditions, 6270 events. 4306/6270 cut-off events. For 9554/9952 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 34963 event pairs, 617 based on Foata normal form. 192/6262 useless extension candidates. Maximal degree in co-relation 22370. Up to 2935 conditions per place. [2023-08-30 16:48:09,714 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 113 selfloop transitions, 20 changer transitions 41/180 dead transitions. [2023-08-30 16:48:09,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 180 transitions, 1240 flow [2023-08-30 16:48:09,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:48:09,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:48:09,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1243 transitions. [2023-08-30 16:48:09,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4950219036240542 [2023-08-30 16:48:09,718 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1243 transitions. [2023-08-30 16:48:09,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1243 transitions. [2023-08-30 16:48:09,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:09,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1243 transitions. [2023-08-30 16:48:09,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 138.11111111111111) internal successors, (1243), 9 states have internal predecessors, (1243), 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) [2023-08-30 16:48:09,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 279.0) internal successors, (2790), 10 states have internal predecessors, (2790), 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) [2023-08-30 16:48:09,725 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 279.0) internal successors, (2790), 10 states have internal predecessors, (2790), 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) [2023-08-30 16:48:09,725 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 330 flow. Second operand 9 states and 1243 transitions. [2023-08-30 16:48:09,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 180 transitions, 1240 flow [2023-08-30 16:48:09,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 180 transitions, 1205 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-08-30 16:48:09,865 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 398 flow [2023-08-30 16:48:09,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=398, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-08-30 16:48:09,866 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2023-08-30 16:48:09,866 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 398 flow [2023-08-30 16:48:09,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.16666666666667) internal successors, (757), 6 states have internal predecessors, (757), 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) [2023-08-30 16:48:09,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:09,867 INFO L208 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] [2023-08-30 16:48:09,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:48:09,867 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 16:48:09,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:09,868 INFO L85 PathProgramCache]: Analyzing trace with hash 314529884, now seen corresponding path program 1 times [2023-08-30 16:48:09,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:09,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569112593] [2023-08-30 16:48:09,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:09,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:48:10,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:10,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569112593] [2023-08-30 16:48:10,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569112593] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:10,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:10,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:48:10,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992204433] [2023-08-30 16:48:10,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:10,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:48:10,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:10,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:48:10,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:48:10,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 279 [2023-08-30 16:48:10,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 398 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 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) [2023-08-30 16:48:10,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:10,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 279 [2023-08-30 16:48:10,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:10,722 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([612] L840-->L852: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_209 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_26 256) 0))) (.cse8 (not (= (mod v_~z$w_buff0_used~0_155 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_34 256) 0))) (.cse11 (not (= (mod v_~z$r_buff0_thd3~0_38 256) 0)))) (let ((.cse2 (and .cse11 (not (= (mod v_~z$w_buff0_used~0_156 256) 0)))) (.cse3 (and .cse9 (not (= (mod v_~z$w_buff1_used~0_147 256) 0)))) (.cse4 (and .cse8 .cse11)) (.cse7 (and .cse0 (not (= 0 (mod v_~x$w_buff1_used~0_199 256))))) (.cse5 (and .cse1 .cse10)) (.cse6 (and (not (= 0 (mod v_~x$w_buff0_used~0_210 256))) .cse10))) (and (= v_~x$r_buff1_thd3~0_25 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_198 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_26)) (= (ite .cse2 v_~z$w_buff0~0_87 (ite .cse3 v_~z$w_buff1~0_78 v_~z~0_148)) v_~z~0_147) (= v_~z$w_buff0_used~0_155 (ite .cse2 0 v_~z$w_buff0_used~0_156)) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_147) v_~z$w_buff1_used~0_146) (= v_~z$r_buff0_thd3~0_37 (ite .cse4 0 v_~z$r_buff0_thd3~0_38)) (= (ite .cse5 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= (ite .cse6 v_~x$w_buff0~0_95 (ite .cse7 v_~x$w_buff1~0_90 v_~x~0_146)) v_~x~0_145) (= v_~x$w_buff1_used~0_198 (ite (or .cse7 .cse5) 0 v_~x$w_buff1_used~0_199)) (= v_~x$w_buff0_used~0_209 (ite .cse6 0 v_~x$w_buff0_used~0_210)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_37 256) 0)) .cse8) (and .cse9 (not (= (mod v_~z$w_buff1_used~0_146 256) 0)))) 0 v_~z$r_buff1_thd3~0_34) v_~z$r_buff1_thd3~0_33)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_156, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_147, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z~0=v_~z~0_148, ~x~0=v_~x~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_155, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_146, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~z~0=v_~z~0_147, ~x~0=v_~x~0_145} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~z$r_buff0_thd3~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0][47], [P0Thread1of1ForFork1InUse, Black: 224#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P2Thread1of1ForFork0InUse, Black: 217#(<= ~__unbuffered_cnt~0 2), Black: 195#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 59#L927-3true, Black: 193#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 110#L872true, 91#L820true, 215#(= ~__unbuffered_cnt~0 0), 153#L771true, 173#true, Black: 208#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 175#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 203#(<= ~__unbuffered_cnt~0 1), Black: 176#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0)))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 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)))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~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 (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (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)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))))), Black: 204#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 231#(= ~a~0 1), Black: 182#(= ~__unbuffered_p1_EAX~0 0), 123#L852true, P1Thread1of1ForFork3InUse, 202#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse]) [2023-08-30 16:48:10,722 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 16:48:10,722 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 16:48:10,722 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 16:48:10,722 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 16:48:10,834 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([612] L840-->L852: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_209 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_26 256) 0))) (.cse8 (not (= (mod v_~z$w_buff0_used~0_155 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_34 256) 0))) (.cse11 (not (= (mod v_~z$r_buff0_thd3~0_38 256) 0)))) (let ((.cse2 (and .cse11 (not (= (mod v_~z$w_buff0_used~0_156 256) 0)))) (.cse3 (and .cse9 (not (= (mod v_~z$w_buff1_used~0_147 256) 0)))) (.cse4 (and .cse8 .cse11)) (.cse7 (and .cse0 (not (= 0 (mod v_~x$w_buff1_used~0_199 256))))) (.cse5 (and .cse1 .cse10)) (.cse6 (and (not (= 0 (mod v_~x$w_buff0_used~0_210 256))) .cse10))) (and (= v_~x$r_buff1_thd3~0_25 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_198 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_26)) (= (ite .cse2 v_~z$w_buff0~0_87 (ite .cse3 v_~z$w_buff1~0_78 v_~z~0_148)) v_~z~0_147) (= v_~z$w_buff0_used~0_155 (ite .cse2 0 v_~z$w_buff0_used~0_156)) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_147) v_~z$w_buff1_used~0_146) (= v_~z$r_buff0_thd3~0_37 (ite .cse4 0 v_~z$r_buff0_thd3~0_38)) (= (ite .cse5 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= (ite .cse6 v_~x$w_buff0~0_95 (ite .cse7 v_~x$w_buff1~0_90 v_~x~0_146)) v_~x~0_145) (= v_~x$w_buff1_used~0_198 (ite (or .cse7 .cse5) 0 v_~x$w_buff1_used~0_199)) (= v_~x$w_buff0_used~0_209 (ite .cse6 0 v_~x$w_buff0_used~0_210)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_37 256) 0)) .cse8) (and .cse9 (not (= (mod v_~z$w_buff1_used~0_146 256) 0)))) 0 v_~z$r_buff1_thd3~0_34) v_~z$r_buff1_thd3~0_33)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_156, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_147, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z~0=v_~z~0_148, ~x~0=v_~x~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_155, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_146, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~z~0=v_~z~0_147, ~x~0=v_~x~0_145} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~z$r_buff0_thd3~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0][47], [P0Thread1of1ForFork1InUse, Black: 224#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 220#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P2Thread1of1ForFork0InUse, Black: 217#(<= ~__unbuffered_cnt~0 2), Black: 193#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 110#L872true, Black: 192#(= ~__unbuffered_cnt~0 0), 91#L820true, 153#L771true, 173#true, 65#L3true, Black: 208#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 175#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 203#(<= ~__unbuffered_cnt~0 1), Black: 176#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0)))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 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)))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~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 (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (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)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))))), Black: 204#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 231#(= ~a~0 1), Black: 182#(= ~__unbuffered_p1_EAX~0 0), 123#L852true, 206#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse]) [2023-08-30 16:48:10,834 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 16:48:10,834 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 16:48:10,834 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 16:48:10,834 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 16:48:11,603 INFO L130 PetriNetUnfolder]: 6090/9084 cut-off events. [2023-08-30 16:48:11,603 INFO L131 PetriNetUnfolder]: For 16185/16510 co-relation queries the response was YES. [2023-08-30 16:48:11,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32471 conditions, 9084 events. 6090/9084 cut-off events. For 16185/16510 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 55956 event pairs, 1242 based on Foata normal form. 68/8882 useless extension candidates. Maximal degree in co-relation 32444. Up to 5249 conditions per place. [2023-08-30 16:48:11,638 INFO L137 encePairwiseOnDemand]: 276/279 looper letters, 107 selfloop transitions, 2 changer transitions 15/129 dead transitions. [2023-08-30 16:48:11,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 129 transitions, 1175 flow [2023-08-30 16:48:11,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:48:11,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:48:11,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 573 transitions. [2023-08-30 16:48:11,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5134408602150538 [2023-08-30 16:48:11,641 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 573 transitions. [2023-08-30 16:48:11,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 573 transitions. [2023-08-30 16:48:11,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:11,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 573 transitions. [2023-08-30 16:48:11,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 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) [2023-08-30 16:48:11,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 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) [2023-08-30 16:48:11,645 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 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) [2023-08-30 16:48:11,645 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 398 flow. Second operand 4 states and 573 transitions. [2023-08-30 16:48:11,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 129 transitions, 1175 flow [2023-08-30 16:48:11,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 129 transitions, 995 flow, removed 51 selfloop flow, removed 7 redundant places. [2023-08-30 16:48:11,887 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 329 flow [2023-08-30 16:48:11,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=329, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2023-08-30 16:48:11,887 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places. [2023-08-30 16:48:11,887 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 329 flow [2023-08-30 16:48:11,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 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) [2023-08-30 16:48:11,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:11,888 INFO L208 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] [2023-08-30 16:48:11,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:48:11,888 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 16:48:11,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:11,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1767145540, now seen corresponding path program 2 times [2023-08-30 16:48:11,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:11,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170201268] [2023-08-30 16:48:11,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:11,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:48:12,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:12,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170201268] [2023-08-30 16:48:12,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170201268] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:12,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:12,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:48:12,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327483289] [2023-08-30 16:48:12,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:12,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:48:12,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:12,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:48:12,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:48:12,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 279 [2023-08-30 16:48:12,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 329 flow. Second operand has 7 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 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) [2023-08-30 16:48:12,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:12,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 279 [2023-08-30 16:48:12,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:12,989 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([612] L840-->L852: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_209 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_26 256) 0))) (.cse8 (not (= (mod v_~z$w_buff0_used~0_155 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_34 256) 0))) (.cse11 (not (= (mod v_~z$r_buff0_thd3~0_38 256) 0)))) (let ((.cse2 (and .cse11 (not (= (mod v_~z$w_buff0_used~0_156 256) 0)))) (.cse3 (and .cse9 (not (= (mod v_~z$w_buff1_used~0_147 256) 0)))) (.cse4 (and .cse8 .cse11)) (.cse7 (and .cse0 (not (= 0 (mod v_~x$w_buff1_used~0_199 256))))) (.cse5 (and .cse1 .cse10)) (.cse6 (and (not (= 0 (mod v_~x$w_buff0_used~0_210 256))) .cse10))) (and (= v_~x$r_buff1_thd3~0_25 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_198 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_26)) (= (ite .cse2 v_~z$w_buff0~0_87 (ite .cse3 v_~z$w_buff1~0_78 v_~z~0_148)) v_~z~0_147) (= v_~z$w_buff0_used~0_155 (ite .cse2 0 v_~z$w_buff0_used~0_156)) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_147) v_~z$w_buff1_used~0_146) (= v_~z$r_buff0_thd3~0_37 (ite .cse4 0 v_~z$r_buff0_thd3~0_38)) (= (ite .cse5 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= (ite .cse6 v_~x$w_buff0~0_95 (ite .cse7 v_~x$w_buff1~0_90 v_~x~0_146)) v_~x~0_145) (= v_~x$w_buff1_used~0_198 (ite (or .cse7 .cse5) 0 v_~x$w_buff1_used~0_199)) (= v_~x$w_buff0_used~0_209 (ite .cse6 0 v_~x$w_buff0_used~0_210)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_37 256) 0)) .cse8) (and .cse9 (not (= (mod v_~z$w_buff1_used~0_146 256) 0)))) 0 v_~z$r_buff1_thd3~0_34) v_~z$r_buff1_thd3~0_33)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_156, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_147, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z~0=v_~z~0_148, ~x~0=v_~x~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_155, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_146, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~z~0=v_~z~0_147, ~x~0=v_~x~0_145} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~z$r_buff0_thd3~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0][74], [P0Thread1of1ForFork1InUse, Black: 224#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 217#(<= ~__unbuffered_cnt~0 2), Black: 193#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 110#L872true, Black: 192#(= ~__unbuffered_cnt~0 0), 91#L820true, 173#true, 246#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 234#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 65#L3true, Black: 175#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 208#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 203#(<= ~__unbuffered_cnt~0 1), Black: 176#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0)))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 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)))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~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 (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (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)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))))), 231#(= ~a~0 1), Black: 182#(= ~__unbuffered_p1_EAX~0 0), 123#L852true, 206#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P1Thread1of1ForFork3InUse, 144#L781true, P3Thread1of1ForFork2InUse]) [2023-08-30 16:48:12,989 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 16:48:12,990 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:48:12,990 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:48:12,990 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:48:13,569 INFO L130 PetriNetUnfolder]: 4973/7299 cut-off events. [2023-08-30 16:48:13,570 INFO L131 PetriNetUnfolder]: For 8286/8712 co-relation queries the response was YES. [2023-08-30 16:48:13,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24785 conditions, 7299 events. 4973/7299 cut-off events. For 8286/8712 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 43312 event pairs, 712 based on Foata normal form. 103/7161 useless extension candidates. Maximal degree in co-relation 24759. Up to 3399 conditions per place. [2023-08-30 16:48:13,592 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 84 selfloop transitions, 22 changer transitions 64/176 dead transitions. [2023-08-30 16:48:13,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 176 transitions, 1209 flow [2023-08-30 16:48:13,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 16:48:13,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 16:48:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1484 transitions. [2023-08-30 16:48:13,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.483545128706419 [2023-08-30 16:48:13,597 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1484 transitions. [2023-08-30 16:48:13,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1484 transitions. [2023-08-30 16:48:13,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:13,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1484 transitions. [2023-08-30 16:48:13,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 134.9090909090909) internal successors, (1484), 11 states have internal predecessors, (1484), 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) [2023-08-30 16:48:13,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 279.0) internal successors, (3348), 12 states have internal predecessors, (3348), 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) [2023-08-30 16:48:13,607 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 279.0) internal successors, (3348), 12 states have internal predecessors, (3348), 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) [2023-08-30 16:48:13,607 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 329 flow. Second operand 11 states and 1484 transitions. [2023-08-30 16:48:13,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 176 transitions, 1209 flow [2023-08-30 16:48:13,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 176 transitions, 1163 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-30 16:48:13,707 INFO L231 Difference]: Finished difference. Result has 74 places, 55 transitions, 359 flow [2023-08-30 16:48:13,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=359, PETRI_PLACES=74, PETRI_TRANSITIONS=55} [2023-08-30 16:48:13,708 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2023-08-30 16:48:13,708 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 55 transitions, 359 flow [2023-08-30 16:48:13,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 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) [2023-08-30 16:48:13,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:13,709 INFO L208 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] [2023-08-30 16:48:13,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:48:13,709 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 16:48:13,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:13,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2140264249, now seen corresponding path program 1 times [2023-08-30 16:48:13,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:13,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101712257] [2023-08-30 16:48:13,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:13,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:48:21,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:21,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101712257] [2023-08-30 16:48:21,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101712257] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:21,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:21,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 16:48:21,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287856244] [2023-08-30 16:48:21,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:21,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:48:21,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:21,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:48:21,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:48:21,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 279 [2023-08-30 16:48:21,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 55 transitions, 359 flow. Second operand has 8 states, 8 states have (on average 118.375) internal successors, (947), 8 states have internal predecessors, (947), 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) [2023-08-30 16:48:21,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:21,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 279 [2023-08-30 16:48:21,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:22,518 INFO L130 PetriNetUnfolder]: 6300/9679 cut-off events. [2023-08-30 16:48:22,518 INFO L131 PetriNetUnfolder]: For 15457/15560 co-relation queries the response was YES. [2023-08-30 16:48:22,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34792 conditions, 9679 events. 6300/9679 cut-off events. For 15457/15560 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 61681 event pairs, 570 based on Foata normal form. 37/9711 useless extension candidates. Maximal degree in co-relation 34771. Up to 4208 conditions per place. [2023-08-30 16:48:22,549 INFO L137 encePairwiseOnDemand]: 270/279 looper letters, 74 selfloop transitions, 4 changer transitions 115/196 dead transitions. [2023-08-30 16:48:22,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 196 transitions, 1698 flow [2023-08-30 16:48:22,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:48:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:48:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1023 transitions. [2023-08-30 16:48:22,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2023-08-30 16:48:22,552 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1023 transitions. [2023-08-30 16:48:22,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1023 transitions. [2023-08-30 16:48:22,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:22,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1023 transitions. [2023-08-30 16:48:22,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.875) internal successors, (1023), 8 states have internal predecessors, (1023), 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) [2023-08-30 16:48:22,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 279.0) internal successors, (2511), 9 states have internal predecessors, (2511), 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) [2023-08-30 16:48:22,558 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 279.0) internal successors, (2511), 9 states have internal predecessors, (2511), 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) [2023-08-30 16:48:22,559 INFO L175 Difference]: Start difference. First operand has 74 places, 55 transitions, 359 flow. Second operand 8 states and 1023 transitions. [2023-08-30 16:48:22,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 196 transitions, 1698 flow [2023-08-30 16:48:22,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 196 transitions, 1398 flow, removed 73 selfloop flow, removed 9 redundant places. [2023-08-30 16:48:22,677 INFO L231 Difference]: Finished difference. Result has 75 places, 55 transitions, 318 flow [2023-08-30 16:48:22,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=318, PETRI_PLACES=75, PETRI_TRANSITIONS=55} [2023-08-30 16:48:22,678 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2023-08-30 16:48:22,678 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 55 transitions, 318 flow [2023-08-30 16:48:22,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 118.375) internal successors, (947), 8 states have internal predecessors, (947), 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) [2023-08-30 16:48:22,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:22,679 INFO L208 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] [2023-08-30 16:48:22,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:48:22,679 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 16:48:22,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:22,680 INFO L85 PathProgramCache]: Analyzing trace with hash 441029205, now seen corresponding path program 2 times [2023-08-30 16:48:22,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:22,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744456189] [2023-08-30 16:48:22,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:22,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:48:25,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:25,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744456189] [2023-08-30 16:48:25,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744456189] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:25,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:25,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-30 16:48:25,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416388479] [2023-08-30 16:48:25,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:25,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 16:48:25,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:25,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 16:48:25,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-30 16:48:25,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 279 [2023-08-30 16:48:25,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 55 transitions, 318 flow. Second operand has 11 states, 11 states have (on average 124.45454545454545) internal successors, (1369), 11 states have internal predecessors, (1369), 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) [2023-08-30 16:48:25,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:25,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 279 [2023-08-30 16:48:25,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:27,330 INFO L130 PetriNetUnfolder]: 9657/14687 cut-off events. [2023-08-30 16:48:27,330 INFO L131 PetriNetUnfolder]: For 26905/26921 co-relation queries the response was YES. [2023-08-30 16:48:27,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55297 conditions, 14687 events. 9657/14687 cut-off events. For 26905/26921 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 92613 event pairs, 1317 based on Foata normal form. 5/14614 useless extension candidates. Maximal degree in co-relation 55269. Up to 5607 conditions per place. [2023-08-30 16:48:27,423 INFO L137 encePairwiseOnDemand]: 267/279 looper letters, 132 selfloop transitions, 28 changer transitions 150/313 dead transitions. [2023-08-30 16:48:27,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 313 transitions, 2382 flow [2023-08-30 16:48:27,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-30 16:48:27,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-30 16:48:27,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2142 transitions. [2023-08-30 16:48:27,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4798387096774194 [2023-08-30 16:48:27,429 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2142 transitions. [2023-08-30 16:48:27,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2142 transitions. [2023-08-30 16:48:27,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:27,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2142 transitions. [2023-08-30 16:48:27,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 133.875) internal successors, (2142), 16 states have internal predecessors, (2142), 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) [2023-08-30 16:48:27,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 279.0) internal successors, (4743), 17 states have internal predecessors, (4743), 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) [2023-08-30 16:48:27,439 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 279.0) internal successors, (4743), 17 states have internal predecessors, (4743), 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) [2023-08-30 16:48:27,439 INFO L175 Difference]: Start difference. First operand has 75 places, 55 transitions, 318 flow. Second operand 16 states and 2142 transitions. [2023-08-30 16:48:27,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 313 transitions, 2382 flow [2023-08-30 16:48:27,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 313 transitions, 2238 flow, removed 72 selfloop flow, removed 4 redundant places. [2023-08-30 16:48:27,775 INFO L231 Difference]: Finished difference. Result has 93 places, 75 transitions, 540 flow [2023-08-30 16:48:27,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=540, PETRI_PLACES=93, PETRI_TRANSITIONS=75} [2023-08-30 16:48:27,776 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 48 predicate places. [2023-08-30 16:48:27,776 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 75 transitions, 540 flow [2023-08-30 16:48:27,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 124.45454545454545) internal successors, (1369), 11 states have internal predecessors, (1369), 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) [2023-08-30 16:48:27,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:27,777 INFO L208 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] [2023-08-30 16:48:27,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:48:27,777 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 16:48:27,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:27,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1357980891, now seen corresponding path program 3 times [2023-08-30 16:48:27,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:27,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264952852] [2023-08-30 16:48:27,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:27,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:48:30,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:30,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264952852] [2023-08-30 16:48:30,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264952852] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:30,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:30,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-30 16:48:30,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834453335] [2023-08-30 16:48:30,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:30,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 16:48:30,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:30,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 16:48:30,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-08-30 16:48:30,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 279 [2023-08-30 16:48:30,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 75 transitions, 540 flow. Second operand has 11 states, 11 states have (on average 123.36363636363636) internal successors, (1357), 11 states have internal predecessors, (1357), 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) [2023-08-30 16:48:30,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:30,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 279 [2023-08-30 16:48:30,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:32,700 INFO L130 PetriNetUnfolder]: 8180/13003 cut-off events. [2023-08-30 16:48:32,701 INFO L131 PetriNetUnfolder]: For 58609/58842 co-relation queries the response was YES. [2023-08-30 16:48:32,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61257 conditions, 13003 events. 8180/13003 cut-off events. For 58609/58842 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 89924 event pairs, 2103 based on Foata normal form. 46/12900 useless extension candidates. Maximal degree in co-relation 61218. Up to 7674 conditions per place. [2023-08-30 16:48:32,750 INFO L137 encePairwiseOnDemand]: 270/279 looper letters, 92 selfloop transitions, 28 changer transitions 119/245 dead transitions. [2023-08-30 16:48:32,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 245 transitions, 2134 flow [2023-08-30 16:48:32,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:48:32,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:48:32,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1086 transitions. [2023-08-30 16:48:32,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48655913978494625 [2023-08-30 16:48:32,754 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1086 transitions. [2023-08-30 16:48:32,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1086 transitions. [2023-08-30 16:48:32,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:32,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1086 transitions. [2023-08-30 16:48:32,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 135.75) internal successors, (1086), 8 states have internal predecessors, (1086), 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) [2023-08-30 16:48:32,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 279.0) internal successors, (2511), 9 states have internal predecessors, (2511), 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) [2023-08-30 16:48:32,760 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 279.0) internal successors, (2511), 9 states have internal predecessors, (2511), 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) [2023-08-30 16:48:32,760 INFO L175 Difference]: Start difference. First operand has 93 places, 75 transitions, 540 flow. Second operand 8 states and 1086 transitions. [2023-08-30 16:48:32,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 245 transitions, 2134 flow [2023-08-30 16:48:33,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 245 transitions, 2039 flow, removed 40 selfloop flow, removed 6 redundant places. [2023-08-30 16:48:33,073 INFO L231 Difference]: Finished difference. Result has 96 places, 94 transitions, 780 flow [2023-08-30 16:48:33,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=780, PETRI_PLACES=96, PETRI_TRANSITIONS=94} [2023-08-30 16:48:33,074 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 51 predicate places. [2023-08-30 16:48:33,074 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 94 transitions, 780 flow [2023-08-30 16:48:33,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 123.36363636363636) internal successors, (1357), 11 states have internal predecessors, (1357), 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) [2023-08-30 16:48:33,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:33,075 INFO L208 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] [2023-08-30 16:48:33,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:48:33,075 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 16:48:33,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:33,076 INFO L85 PathProgramCache]: Analyzing trace with hash -162056023, now seen corresponding path program 4 times [2023-08-30 16:48:33,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:33,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220804459] [2023-08-30 16:48:33,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:33,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:34,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:48:34,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:34,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220804459] [2023-08-30 16:48:34,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220804459] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:34,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:34,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:48:34,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962721647] [2023-08-30 16:48:34,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:34,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:48:34,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:34,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:48:34,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:48:34,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 279 [2023-08-30 16:48:34,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 94 transitions, 780 flow. Second operand has 7 states, 7 states have (on average 131.71428571428572) internal successors, (922), 7 states have internal predecessors, (922), 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) [2023-08-30 16:48:34,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:34,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 279 [2023-08-30 16:48:34,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:35,601 INFO L130 PetriNetUnfolder]: 7206/11621 cut-off events. [2023-08-30 16:48:35,601 INFO L131 PetriNetUnfolder]: For 56791/57310 co-relation queries the response was YES. [2023-08-30 16:48:35,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57713 conditions, 11621 events. 7206/11621 cut-off events. For 56791/57310 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 81953 event pairs, 2257 based on Foata normal form. 190/11548 useless extension candidates. Maximal degree in co-relation 57672. Up to 6483 conditions per place. [2023-08-30 16:48:35,646 INFO L137 encePairwiseOnDemand]: 274/279 looper letters, 95 selfloop transitions, 10 changer transitions 34/149 dead transitions. [2023-08-30 16:48:35,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 149 transitions, 1499 flow [2023-08-30 16:48:35,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:48:35,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:48:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-08-30 16:48:35,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4982078853046595 [2023-08-30 16:48:35,648 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-08-30 16:48:35,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-08-30 16:48:35,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:35,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-08-30 16:48:35,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 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) [2023-08-30 16:48:35,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 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) [2023-08-30 16:48:35,652 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 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) [2023-08-30 16:48:35,652 INFO L175 Difference]: Start difference. First operand has 96 places, 94 transitions, 780 flow. Second operand 4 states and 556 transitions. [2023-08-30 16:48:35,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 149 transitions, 1499 flow [2023-08-30 16:48:35,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 149 transitions, 1485 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-30 16:48:35,841 INFO L231 Difference]: Finished difference. Result has 96 places, 92 transitions, 781 flow [2023-08-30 16:48:35,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=781, PETRI_PLACES=96, PETRI_TRANSITIONS=92} [2023-08-30 16:48:35,842 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 51 predicate places. [2023-08-30 16:48:35,842 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 92 transitions, 781 flow [2023-08-30 16:48:35,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 131.71428571428572) internal successors, (922), 7 states have internal predecessors, (922), 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) [2023-08-30 16:48:35,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:35,842 INFO L208 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] [2023-08-30 16:48:35,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 16:48:35,843 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 16:48:35,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:35,843 INFO L85 PathProgramCache]: Analyzing trace with hash -574301949, now seen corresponding path program 5 times [2023-08-30 16:48:35,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:35,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749624046] [2023-08-30 16:48:35,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:35,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:48:35,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:48:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:48:36,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:48:36,031 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:48:36,032 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2023-08-30 16:48:36,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2023-08-30 16:48:36,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2023-08-30 16:48:36,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2023-08-30 16:48:36,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2023-08-30 16:48:36,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2023-08-30 16:48:36,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-08-30 16:48:36,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2023-08-30 16:48:36,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2023-08-30 16:48:36,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 16:48:36,053 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:48:36,058 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:48:36,058 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:48:36,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:48:36 BasicIcfg [2023-08-30 16:48:36,171 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:48:36,172 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:48:36,172 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:48:36,172 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:48:36,172 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:47:37" (3/4) ... [2023-08-30 16:48:36,174 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:48:36,270 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:48:36,270 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:48:36,271 INFO L158 Benchmark]: Toolchain (without parser) took 60171.81ms. Allocated memory was 67.1MB in the beginning and 3.4GB in the end (delta: 3.4GB). Free memory was 36.9MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 862.1MB. Max. memory is 16.1GB. [2023-08-30 16:48:36,271 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory is still 32.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:48:36,271 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.82ms. Allocated memory is still 67.1MB. Free memory was 36.6MB in the beginning and 38.6MB in the end (delta: -2.0MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2023-08-30 16:48:36,272 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.33ms. Allocated memory is still 67.1MB. Free memory was 38.6MB in the beginning and 34.3MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 16:48:36,272 INFO L158 Benchmark]: Boogie Preprocessor took 30.75ms. Allocated memory is still 67.1MB. Free memory was 34.3MB in the beginning and 31.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:48:36,272 INFO L158 Benchmark]: RCFGBuilder took 893.91ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 31.6MB in the beginning and 42.3MB in the end (delta: -10.7MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2023-08-30 16:48:36,273 INFO L158 Benchmark]: TraceAbstraction took 58533.41ms. Allocated memory was 81.8MB in the beginning and 3.4GB in the end (delta: 3.4GB). Free memory was 41.5MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 830.8MB. Max. memory is 16.1GB. [2023-08-30 16:48:36,273 INFO L158 Benchmark]: Witness Printer took 98.64ms. Allocated memory is still 3.4GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-08-30 16:48:36,274 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory is still 32.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 557.82ms. Allocated memory is still 67.1MB. Free memory was 36.6MB in the beginning and 38.6MB in the end (delta: -2.0MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.33ms. Allocated memory is still 67.1MB. Free memory was 38.6MB in the beginning and 34.3MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.75ms. Allocated memory is still 67.1MB. Free memory was 34.3MB in the beginning and 31.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 893.91ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 31.6MB in the beginning and 42.3MB in the end (delta: -10.7MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * TraceAbstraction took 58533.41ms. Allocated memory was 81.8MB in the beginning and 3.4GB in the end (delta: 3.4GB). Free memory was 41.5MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 830.8MB. Max. memory is 16.1GB. * Witness Printer took 98.64ms. Allocated memory is still 3.4GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.4s, 158 PlacesBefore, 45 PlacesAfterwards, 147 TransitionsBefore, 32 TransitionsAfterwards, 3392 CoEnabledTransitionPairs, 7 FixpointIterations, 61 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 128 TotalNumberOfCompositions, 9980 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3806, independent: 3544, independent conditional: 0, independent unconditional: 3544, dependent: 262, dependent conditional: 0, dependent unconditional: 262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1803, independent: 1751, independent conditional: 0, independent unconditional: 1751, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3806, independent: 1793, independent conditional: 0, independent unconditional: 1793, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 1803, unknown conditional: 0, unknown unconditional: 1803] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice2; [L920] 0 pthread_t t625; [L921] FCALL, FORK 0 pthread_create(&t625, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t625, ((void *)0), P0, ((void *)0))=-3, t625={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=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] [L922] 0 pthread_t t626; [L923] FCALL, FORK 0 pthread_create(&t626, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t626, ((void *)0), P1, ((void *)0))=-2, t625={5:0}, t626={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=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] [L790] 2 x$w_buff1 = x$w_buff0 [L791] 2 x$w_buff0 = 2 [L792] 2 x$w_buff1_used = x$w_buff0_used [L793] 2 x$w_buff0_used = (_Bool)1 [L794] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L794] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L795] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L796] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L797] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L798] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L799] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L800] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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] [L924] 0 pthread_t t627; [L803] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 2 x$flush_delayed = weak$$choice2 [L806] 2 x$mem_tmp = x [L807] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L808] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L809] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L810] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L811] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L812] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L813] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L814] 2 __unbuffered_p1_EAX = x [L815] 2 x = x$flush_delayed ? x$mem_tmp : x [L816] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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] [L925] FCALL, FORK 0 pthread_create(&t627, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t627, ((void *)0), P2, ((void *)0))=-1, t625={5:0}, t626={6:0}, t627={7:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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] [L926] 0 pthread_t t628; [L819] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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] [L836] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, 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=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] [L927] FCALL, FORK 0 pthread_create(&t628, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t628, ((void *)0), P3, ((void *)0))=0, t625={5:0}, t626={6:0}, t627={7:0}, t628={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, 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=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] [L839] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, 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=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=1] [L861] 4 z$w_buff1 = z$w_buff0 [L862] 4 z$w_buff0 = 2 [L863] 4 z$w_buff1_used = z$w_buff0_used [L864] 4 z$w_buff0_used = (_Bool)1 [L865] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L865] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L866] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L867] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L868] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L869] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L870] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L871] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, 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] [L874] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 4 z$flush_delayed = weak$$choice2 [L877] 4 z$mem_tmp = z [L878] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L879] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L880] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L881] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L882] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L883] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L884] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L885] 4 __unbuffered_p3_EAX = z [L886] 4 z = z$flush_delayed ? z$mem_tmp : z [L887] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, 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] [L890] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, 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] [L770] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, 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] [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=1, 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] [L776] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L777] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L778] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L779] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L780] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=1, 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] [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 1 return 0; [L893] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L894] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L895] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L896] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L897] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L898] 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) [L899] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L900] 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 [L901] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L902] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=1, 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] [L822] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L823] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L824] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L825] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L826] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, 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] [L842] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L843] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L844] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L845] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L846] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L847] 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) [L848] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L849] 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 [L850] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L851] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, 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] [L905] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L907] 4 return 0; [L854] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 3 return 0; [L829] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 2 return 0; [L929] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L931] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L931] RET 0 assume_abort_if_not(main$tmp_guard0) [L933] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L934] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L935] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L936] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L937] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L938] 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) [L939] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L940] 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 [L941] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L942] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t625={5:0}, t626={6:0}, t627={7:0}, t628={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, 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] [L945] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L946] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L947] 0 z$flush_delayed = weak$$choice2 [L948] 0 z$mem_tmp = z [L949] 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) [L950] 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)) [L951] 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)) [L952] 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)) [L953] 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)) [L954] 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)) [L955] 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)) [L956] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L957] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L958] 0 x$flush_delayed = weak$$choice2 [L959] 0 x$mem_tmp = x [L960] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L961] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L962] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L963] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L964] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L965] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L966] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L967] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L968] 0 z = z$flush_delayed ? z$mem_tmp : z [L969] 0 z$flush_delayed = (_Bool)0 [L970] 0 x = x$flush_delayed ? x$mem_tmp : x [L971] 0 x$flush_delayed = (_Bool)0 [L973] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, 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 call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 923]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 927]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 921]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 925]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 190 locations, 9 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: 58.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 22.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1130 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 957 mSDsluCounter, 635 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 548 mSDsCounter, 286 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2810 IncrementalHoareTripleChecker+Invalid, 3096 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 286 mSolverCounterUnsat, 87 mSDtfsCounter, 2810 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=781occurred in iteration=14, InterpolantAutomatonStates: 88, 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.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 27.1s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 4134 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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! [2023-08-30 16:48:36,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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