./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:42:33,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:42:33,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:42:33,546 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:42:33,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:42:33,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:42:33,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:42:33,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:42:33,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:42:33,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:42:33,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:42:33,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:42:33,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:42:33,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:42:33,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:42:33,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:42:33,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:42:33,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:42:33,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:42:33,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:42:33,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:42:33,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:42:33,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:42:33,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:42:33,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:42:33,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:42:33,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:42:33,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:42:33,599 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:42:33,600 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:42:33,600 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:42:33,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:42:33,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:42:33,609 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:42:33,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:42:33,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:42:33,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:42:33,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:42:33,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:42:33,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:42:33,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:42:33,615 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 02:42:33,650 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:42:33,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:42:33,652 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:42:33,652 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:42:33,653 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:42:33,654 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:42:33,654 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:42:33,655 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:42:33,655 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:42:33,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:42:33,656 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:42:33,656 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:42:33,656 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:42:33,656 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:42:33,657 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:42:33,657 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:42:33,657 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:42:33,657 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:42:33,657 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:42:33,657 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:42:33,657 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:42:33,657 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:42:33,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:42:33,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:42:33,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:42:33,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:42:33,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:42:33,658 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:42:33,658 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:42:33,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:42:33,659 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:42:33,659 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:42:33,659 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:42:33,659 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:42:33,659 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 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 -> TOGETHER [2023-08-30 02:42:34,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:42:34,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:42:34,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:42:34,027 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:42:34,028 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:42:34,029 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2023-08-30 02:42:35,309 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:42:35,635 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:42:35,636 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2023-08-30 02:42:35,648 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/956f09eb3/317ea384e4c940929dc51aa4793019f7/FLAGfbee37ebd [2023-08-30 02:42:35,664 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/956f09eb3/317ea384e4c940929dc51aa4793019f7 [2023-08-30 02:42:35,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:42:35,671 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:42:35,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:42:35,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:42:35,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:42:35,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:42:35" (1/1) ... [2023-08-30 02:42:35,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6273ec15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:42:35, skipping insertion in model container [2023-08-30 02:42:35,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:42:35" (1/1) ... [2023-08-30 02:42:35,684 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:42:35,746 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:42:35,871 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/mix005_tso.oepc.i[949,962] [2023-08-30 02:42:36,118 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:42:36,137 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:42:36,149 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/mix005_tso.oepc.i[949,962] [2023-08-30 02:42:36,225 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:42:36,263 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:42:36,263 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:42:36,269 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:42:36,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:42:36 WrapperNode [2023-08-30 02:42:36,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:42:36,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:42:36,271 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:42:36,271 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:42:36,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:42:36" (1/1) ... [2023-08-30 02:42:36,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:42:36" (1/1) ... [2023-08-30 02:42:36,354 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2023-08-30 02:42:36,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:42:36,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:42:36,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:42:36,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:42:36,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:42:36" (1/1) ... [2023-08-30 02:42:36,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:42:36" (1/1) ... [2023-08-30 02:42:36,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:42:36" (1/1) ... [2023-08-30 02:42:36,381 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:42:36" (1/1) ... [2023-08-30 02:42:36,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:42:36" (1/1) ... [2023-08-30 02:42:36,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:42:36" (1/1) ... [2023-08-30 02:42:36,407 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:42:36" (1/1) ... [2023-08-30 02:42:36,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:42:36" (1/1) ... [2023-08-30 02:42:36,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:42:36,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:42:36,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:42:36,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:42:36,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:42:36" (1/1) ... [2023-08-30 02:42:36,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:42:36,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:42:36,460 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 02:42:36,484 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 02:42:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:42:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:42:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:42:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:42:36,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:42:36,497 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:42:36,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:42:36,497 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:42:36,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:42:36,497 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:42:36,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:42:36,498 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:42:36,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:42:36,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:42:36,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:42:36,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:42:36,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:42:36,500 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 02:42:36,698 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:42:36,699 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:42:37,058 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:42:37,178 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:42:37,179 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:42:37,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:42:37 BoogieIcfgContainer [2023-08-30 02:42:37,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:42:37,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:42:37,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:42:37,186 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:42:37,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:42:35" (1/3) ... [2023-08-30 02:42:37,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2a38e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:42:37, skipping insertion in model container [2023-08-30 02:42:37,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:42:36" (2/3) ... [2023-08-30 02:42:37,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2a38e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:42:37, skipping insertion in model container [2023-08-30 02:42:37,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:42:37" (3/3) ... [2023-08-30 02:42:37,188 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2023-08-30 02:42:37,205 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:42:37,205 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:42:37,206 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:42:37,263 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:42:37,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 310 flow [2023-08-30 02:42:37,382 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-30 02:42:37,382 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:42:37,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-30 02:42:37,389 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 145 transitions, 310 flow [2023-08-30 02:42:37,396 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 141 transitions, 294 flow [2023-08-30 02:42:37,401 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:42:37,423 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-30 02:42:37,427 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-30 02:42:37,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 294 flow [2023-08-30 02:42:37,477 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-30 02:42:37,478 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:42:37,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-30 02:42:37,483 INFO L119 LiptonReduction]: Number of co-enabled transitions 3638 [2023-08-30 02:42:42,834 INFO L134 LiptonReduction]: Checked pairs total: 12096 [2023-08-30 02:42:42,835 INFO L136 LiptonReduction]: Total number of compositions: 127 [2023-08-30 02:42:42,847 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:42:42,853 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@1a78a617, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:42:42,854 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:42:42,855 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:42:42,856 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:42:42,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:42:42,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:42:42,857 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:42:42,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:42:42,862 INFO L85 PathProgramCache]: Analyzing trace with hash 605, now seen corresponding path program 1 times [2023-08-30 02:42:42,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:42:42,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516989396] [2023-08-30 02:42:42,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:42:42,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:42:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:42:42,962 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 02:42:42,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:42:42,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516989396] [2023-08-30 02:42:42,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516989396] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:42:42,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:42:42,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:42:42,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27184614] [2023-08-30 02:42:42,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:42:42,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:42:42,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:42:43,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:42:43,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:42:43,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 272 [2023-08-30 02:42:43,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 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 02:42:43,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:42:43,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 272 [2023-08-30 02:42:43,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:42:44,275 INFO L130 PetriNetUnfolder]: 6949/9709 cut-off events. [2023-08-30 02:42:44,276 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-30 02:42:44,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19323 conditions, 9709 events. 6949/9709 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 53465 event pairs, 6949 based on Foata normal form. 0/8335 useless extension candidates. Maximal degree in co-relation 19311. Up to 9399 conditions per place. [2023-08-30 02:42:44,341 INFO L137 encePairwiseOnDemand]: 263/272 looper letters, 27 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-08-30 02:42:44,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 132 flow [2023-08-30 02:42:44,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:42:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:42:44,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 296 transitions. [2023-08-30 02:42:44,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5441176470588235 [2023-08-30 02:42:44,360 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 296 transitions. [2023-08-30 02:42:44,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 296 transitions. [2023-08-30 02:42:44,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:42:44,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 296 transitions. [2023-08-30 02:42:44,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.0) internal successors, (296), 2 states have internal predecessors, (296), 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 02:42:44,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 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 02:42:44,375 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 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 02:42:44,376 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 296 transitions. [2023-08-30 02:42:44,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 132 flow [2023-08-30 02:42:44,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:42:44,386 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2023-08-30 02:42:44,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-30 02:42:44,392 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-08-30 02:42:44,392 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2023-08-30 02:42:44,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 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 02:42:44,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:42:44,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:42:44,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:42:44,397 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:42:44,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:42:44,405 INFO L85 PathProgramCache]: Analyzing trace with hash 571540232, now seen corresponding path program 1 times [2023-08-30 02:42:44,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:42:44,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901962456] [2023-08-30 02:42:44,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:42:44,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:42:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:42:44,774 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 02:42:44,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:42:44,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901962456] [2023-08-30 02:42:44,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901962456] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:42:44,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:42:44,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:42:44,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769777254] [2023-08-30 02:42:44,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:42:44,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:42:44,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:42:44,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:42:44,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:42:44,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 272 [2023-08-30 02:42:44,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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 02:42:44,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:42:44,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 272 [2023-08-30 02:42:44,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:42:45,689 INFO L130 PetriNetUnfolder]: 5463/7625 cut-off events. [2023-08-30 02:42:45,690 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:42:45,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15222 conditions, 7625 events. 5463/7625 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 40026 event pairs, 2045 based on Foata normal form. 0/7052 useless extension candidates. Maximal degree in co-relation 15219. Up to 5923 conditions per place. [2023-08-30 02:42:45,800 INFO L137 encePairwiseOnDemand]: 269/272 looper letters, 41 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2023-08-30 02:42:45,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 204 flow [2023-08-30 02:42:45,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:42:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:42:45,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-08-30 02:42:45,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306372549019608 [2023-08-30 02:42:45,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-08-30 02:42:45,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-08-30 02:42:45,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:42:45,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-08-30 02:42:45,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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 02:42:45,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 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 02:42:45,810 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 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 02:42:45,810 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 433 transitions. [2023-08-30 02:42:45,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 204 flow [2023-08-30 02:42:45,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 204 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:42:45,812 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 74 flow [2023-08-30 02:42:45,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-30 02:42:45,813 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2023-08-30 02:42:45,813 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 74 flow [2023-08-30 02:42:45,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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 02:42:45,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:42:45,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:42:45,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:42:45,814 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:42:45,816 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:42:45,817 INFO L85 PathProgramCache]: Analyzing trace with hash -788898861, now seen corresponding path program 1 times [2023-08-30 02:42:45,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:42:45,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281595452] [2023-08-30 02:42:45,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:42:45,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:42:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:42:46,596 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 02:42:46,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:42:46,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281595452] [2023-08-30 02:42:46,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281595452] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:42:46,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:42:46,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:42:46,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343681874] [2023-08-30 02:42:46,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:42:46,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:42:46,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:42:46,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:42:46,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:42:46,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 272 [2023-08-30 02:42:46,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 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 02:42:46,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:42:46,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 272 [2023-08-30 02:42:46,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:42:48,631 INFO L130 PetriNetUnfolder]: 14509/19359 cut-off events. [2023-08-30 02:42:48,631 INFO L131 PetriNetUnfolder]: For 965/965 co-relation queries the response was YES. [2023-08-30 02:42:48,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39980 conditions, 19359 events. 14509/19359 cut-off events. For 965/965 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 95780 event pairs, 3197 based on Foata normal form. 0/18878 useless extension candidates. Maximal degree in co-relation 39976. Up to 9801 conditions per place. [2023-08-30 02:42:48,755 INFO L137 encePairwiseOnDemand]: 267/272 looper letters, 71 selfloop transitions, 5 changer transitions 0/77 dead transitions. [2023-08-30 02:42:48,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 77 transitions, 324 flow [2023-08-30 02:42:48,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:42:48,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:42:48,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 653 transitions. [2023-08-30 02:42:48,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4801470588235294 [2023-08-30 02:42:48,758 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 653 transitions. [2023-08-30 02:42:48,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 653 transitions. [2023-08-30 02:42:48,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:42:48,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 653 transitions. [2023-08-30 02:42:48,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 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 02:42:48,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 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 02:42:48,764 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 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 02:42:48,764 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 74 flow. Second operand 5 states and 653 transitions. [2023-08-30 02:42:48,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 77 transitions, 324 flow [2023-08-30 02:42:48,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 77 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:42:48,767 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 104 flow [2023-08-30 02:42:48,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2023-08-30 02:42:48,768 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2023-08-30 02:42:48,771 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 104 flow [2023-08-30 02:42:48,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 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 02:42:48,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:42:48,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:42:48,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:42:48,773 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:42:48,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:42:48,773 INFO L85 PathProgramCache]: Analyzing trace with hash -788898826, now seen corresponding path program 1 times [2023-08-30 02:42:48,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:42:48,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284399284] [2023-08-30 02:42:48,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:42:48,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:42:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:42:49,430 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 02:42:49,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:42:49,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284399284] [2023-08-30 02:42:49,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284399284] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:42:49,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:42:49,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:42:49,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10840453] [2023-08-30 02:42:49,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:42:49,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:42:49,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:42:49,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:42:49,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:42:49,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 272 [2023-08-30 02:42:49,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 104 flow. Second operand has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 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 02:42:49,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:42:49,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 272 [2023-08-30 02:42:49,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:42:51,070 INFO L130 PetriNetUnfolder]: 8951/13060 cut-off events. [2023-08-30 02:42:51,070 INFO L131 PetriNetUnfolder]: For 2928/3008 co-relation queries the response was YES. [2023-08-30 02:42:51,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28183 conditions, 13060 events. 8951/13060 cut-off events. For 2928/3008 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 81460 event pairs, 1944 based on Foata normal form. 608/13492 useless extension candidates. Maximal degree in co-relation 28176. Up to 5193 conditions per place. [2023-08-30 02:42:51,160 INFO L137 encePairwiseOnDemand]: 266/272 looper letters, 70 selfloop transitions, 6 changer transitions 2/84 dead transitions. [2023-08-30 02:42:51,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 84 transitions, 384 flow [2023-08-30 02:42:51,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:42:51,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:42:51,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 860 transitions. [2023-08-30 02:42:51,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45168067226890757 [2023-08-30 02:42:51,164 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 860 transitions. [2023-08-30 02:42:51,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 860 transitions. [2023-08-30 02:42:51,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:42:51,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 860 transitions. [2023-08-30 02:42:51,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.85714285714286) internal successors, (860), 7 states have internal predecessors, (860), 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 02:42:51,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 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 02:42:51,172 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 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 02:42:51,172 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 104 flow. Second operand 7 states and 860 transitions. [2023-08-30 02:42:51,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 84 transitions, 384 flow [2023-08-30 02:42:51,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 84 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:42:51,201 INFO L231 Difference]: Finished difference. Result has 58 places, 36 transitions, 136 flow [2023-08-30 02:42:51,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=58, PETRI_TRANSITIONS=36} [2023-08-30 02:42:51,203 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2023-08-30 02:42:51,203 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 36 transitions, 136 flow [2023-08-30 02:42:51,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 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 02:42:51,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:42:51,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:42:51,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:42:51,205 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:42:51,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:42:51,205 INFO L85 PathProgramCache]: Analyzing trace with hash 2021985666, now seen corresponding path program 1 times [2023-08-30 02:42:51,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:42:51,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428537029] [2023-08-30 02:42:51,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:42:51,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:42:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:42:51,726 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 02:42:51,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:42:51,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428537029] [2023-08-30 02:42:51,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428537029] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:42:51,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:42:51,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:42:51,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193973422] [2023-08-30 02:42:51,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:42:51,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:42:51,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:42:51,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:42:51,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:42:51,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 272 [2023-08-30 02:42:51,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 36 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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 02:42:51,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:42:51,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 272 [2023-08-30 02:42:51,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:42:54,113 INFO L130 PetriNetUnfolder]: 22041/29931 cut-off events. [2023-08-30 02:42:54,113 INFO L131 PetriNetUnfolder]: For 11985/11985 co-relation queries the response was YES. [2023-08-30 02:42:54,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69229 conditions, 29931 events. 22041/29931 cut-off events. For 11985/11985 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 168311 event pairs, 6249 based on Foata normal form. 480/30410 useless extension candidates. Maximal degree in co-relation 69218. Up to 20649 conditions per place. [2023-08-30 02:42:54,310 INFO L137 encePairwiseOnDemand]: 267/272 looper letters, 60 selfloop transitions, 5 changer transitions 16/82 dead transitions. [2023-08-30 02:42:54,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 82 transitions, 414 flow [2023-08-30 02:42:54,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:42:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:42:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 653 transitions. [2023-08-30 02:42:54,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4801470588235294 [2023-08-30 02:42:54,313 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 653 transitions. [2023-08-30 02:42:54,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 653 transitions. [2023-08-30 02:42:54,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:42:54,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 653 transitions. [2023-08-30 02:42:54,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 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 02:42:54,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 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 02:42:54,318 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 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 02:42:54,318 INFO L175 Difference]: Start difference. First operand has 58 places, 36 transitions, 136 flow. Second operand 5 states and 653 transitions. [2023-08-30 02:42:54,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 82 transitions, 414 flow [2023-08-30 02:42:54,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 82 transitions, 408 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:42:54,444 INFO L231 Difference]: Finished difference. Result has 62 places, 36 transitions, 153 flow [2023-08-30 02:42:54,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=62, PETRI_TRANSITIONS=36} [2023-08-30 02:42:54,446 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 8 predicate places. [2023-08-30 02:42:54,446 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 36 transitions, 153 flow [2023-08-30 02:42:54,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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 02:42:54,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:42:54,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:42:54,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:42:54,448 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:42:54,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:42:54,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1450839797, now seen corresponding path program 1 times [2023-08-30 02:42:54,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:42:54,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999639852] [2023-08-30 02:42:54,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:42:54,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:42:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:42:55,071 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 02:42:55,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:42:55,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999639852] [2023-08-30 02:42:55,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999639852] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:42:55,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:42:55,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:42:55,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983790961] [2023-08-30 02:42:55,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:42:55,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:42:55,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:42:55,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:42:55,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:42:55,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 272 [2023-08-30 02:42:55,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 36 transitions, 153 flow. Second operand has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 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 02:42:55,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:42:55,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 272 [2023-08-30 02:42:55,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:42:56,348 INFO L130 PetriNetUnfolder]: 7735/11188 cut-off events. [2023-08-30 02:42:56,348 INFO L131 PetriNetUnfolder]: For 9294/9294 co-relation queries the response was YES. [2023-08-30 02:42:56,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25567 conditions, 11188 events. 7735/11188 cut-off events. For 9294/9294 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 67054 event pairs, 968 based on Foata normal form. 384/11524 useless extension candidates. Maximal degree in co-relation 25553. Up to 7032 conditions per place. [2023-08-30 02:42:56,415 INFO L137 encePairwiseOnDemand]: 266/272 looper letters, 49 selfloop transitions, 6 changer transitions 2/63 dead transitions. [2023-08-30 02:42:56,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 301 flow [2023-08-30 02:42:56,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:42:56,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:42:56,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 841 transitions. [2023-08-30 02:42:56,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4417016806722689 [2023-08-30 02:42:56,419 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 841 transitions. [2023-08-30 02:42:56,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 841 transitions. [2023-08-30 02:42:56,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:42:56,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 841 transitions. [2023-08-30 02:42:56,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.14285714285714) internal successors, (841), 7 states have internal predecessors, (841), 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 02:42:56,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 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 02:42:56,425 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 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 02:42:56,425 INFO L175 Difference]: Start difference. First operand has 62 places, 36 transitions, 153 flow. Second operand 7 states and 841 transitions. [2023-08-30 02:42:56,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 301 flow [2023-08-30 02:42:56,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 63 transitions, 284 flow, removed 2 selfloop flow, removed 8 redundant places. [2023-08-30 02:42:56,509 INFO L231 Difference]: Finished difference. Result has 57 places, 32 transitions, 110 flow [2023-08-30 02:42:56,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=57, PETRI_TRANSITIONS=32} [2023-08-30 02:42:56,510 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2023-08-30 02:42:56,510 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 32 transitions, 110 flow [2023-08-30 02:42:56,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 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 02:42:56,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:42:56,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:42:56,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:42:56,511 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:42:56,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:42:56,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1894093157, now seen corresponding path program 1 times [2023-08-30 02:42:56,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:42:56,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804147826] [2023-08-30 02:42:56,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:42:56,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:42:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:42:57,037 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 02:42:57,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:42:57,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804147826] [2023-08-30 02:42:57,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804147826] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:42:57,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:42:57,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:42:57,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982399388] [2023-08-30 02:42:57,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:42:57,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:42:57,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:42:57,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:42:57,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:42:57,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 272 [2023-08-30 02:42:57,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 32 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 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 02:42:57,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:42:57,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 272 [2023-08-30 02:42:57,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:42:58,287 INFO L130 PetriNetUnfolder]: 7822/11037 cut-off events. [2023-08-30 02:42:58,287 INFO L131 PetriNetUnfolder]: For 2876/2886 co-relation queries the response was YES. [2023-08-30 02:42:58,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23974 conditions, 11037 events. 7822/11037 cut-off events. For 2876/2886 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 61587 event pairs, 4369 based on Foata normal form. 364/11346 useless extension candidates. Maximal degree in co-relation 23965. Up to 9697 conditions per place. [2023-08-30 02:42:58,347 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 37 selfloop transitions, 5 changer transitions 17/65 dead transitions. [2023-08-30 02:42:58,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 65 transitions, 319 flow [2023-08-30 02:42:58,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:42:58,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:42:58,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 694 transitions. [2023-08-30 02:42:58,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102941176470588 [2023-08-30 02:42:58,351 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 694 transitions. [2023-08-30 02:42:58,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 694 transitions. [2023-08-30 02:42:58,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:42:58,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 694 transitions. [2023-08-30 02:42:58,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 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 02:42:58,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 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 02:42:58,356 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 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 02:42:58,357 INFO L175 Difference]: Start difference. First operand has 57 places, 32 transitions, 110 flow. Second operand 5 states and 694 transitions. [2023-08-30 02:42:58,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 65 transitions, 319 flow [2023-08-30 02:42:58,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 65 transitions, 294 flow, removed 2 selfloop flow, removed 8 redundant places. [2023-08-30 02:42:58,419 INFO L231 Difference]: Finished difference. Result has 54 places, 36 transitions, 138 flow [2023-08-30 02:42:58,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=54, PETRI_TRANSITIONS=36} [2023-08-30 02:42:58,420 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2023-08-30 02:42:58,420 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 138 flow [2023-08-30 02:42:58,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 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 02:42:58,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:42:58,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:42:58,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:42:58,421 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:42:58,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:42:58,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1433141223, now seen corresponding path program 1 times [2023-08-30 02:42:58,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:42:58,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443844691] [2023-08-30 02:42:58,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:42:58,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:42:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:42:59,063 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 02:42:59,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:42:59,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443844691] [2023-08-30 02:42:59,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443844691] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:42:59,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:42:59,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:42:59,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510013673] [2023-08-30 02:42:59,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:42:59,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:42:59,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:42:59,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:42:59,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:42:59,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 272 [2023-08-30 02:42:59,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 36 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 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 02:42:59,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:42:59,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 272 [2023-08-30 02:42:59,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:43:00,432 INFO L130 PetriNetUnfolder]: 8114/11572 cut-off events. [2023-08-30 02:43:00,432 INFO L131 PetriNetUnfolder]: For 8138/8592 co-relation queries the response was YES. [2023-08-30 02:43:00,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31148 conditions, 11572 events. 8114/11572 cut-off events. For 8138/8592 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 66380 event pairs, 4044 based on Foata normal form. 432/11944 useless extension candidates. Maximal degree in co-relation 31138. Up to 8956 conditions per place. [2023-08-30 02:43:00,500 INFO L137 encePairwiseOnDemand]: 264/272 looper letters, 55 selfloop transitions, 9 changer transitions 27/97 dead transitions. [2023-08-30 02:43:00,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 97 transitions, 550 flow [2023-08-30 02:43:00,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:43:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:43:00,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 955 transitions. [2023-08-30 02:43:00,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015756302521008 [2023-08-30 02:43:00,504 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 955 transitions. [2023-08-30 02:43:00,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 955 transitions. [2023-08-30 02:43:00,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:43:00,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 955 transitions. [2023-08-30 02:43:00,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.42857142857142) internal successors, (955), 7 states have internal predecessors, (955), 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 02:43:00,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 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 02:43:00,511 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 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 02:43:00,511 INFO L175 Difference]: Start difference. First operand has 54 places, 36 transitions, 138 flow. Second operand 7 states and 955 transitions. [2023-08-30 02:43:00,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 97 transitions, 550 flow [2023-08-30 02:43:00,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 97 transitions, 543 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:43:00,542 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 220 flow [2023-08-30 02:43:00,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2023-08-30 02:43:00,543 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2023-08-30 02:43:00,544 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 220 flow [2023-08-30 02:43:00,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 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 02:43:00,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:43:00,544 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 02:43:00,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:43:00,545 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:43:00,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:43:00,545 INFO L85 PathProgramCache]: Analyzing trace with hash -394192417, now seen corresponding path program 1 times [2023-08-30 02:43:00,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:43:00,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469059566] [2023-08-30 02:43:00,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:43:00,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:43:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:43:01,252 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 02:43:01,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:43:01,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469059566] [2023-08-30 02:43:01,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469059566] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:43:01,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:43:01,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:43:01,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782595276] [2023-08-30 02:43:01,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:43:01,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:43:01,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:43:01,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:43:01,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:43:01,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 272 [2023-08-30 02:43:01,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 220 flow. Second operand has 7 states, 7 states have (on average 115.57142857142857) internal successors, (809), 7 states have internal predecessors, (809), 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 02:43:01,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:43:01,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 272 [2023-08-30 02:43:01,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:43:03,818 INFO L130 PetriNetUnfolder]: 23663/32018 cut-off events. [2023-08-30 02:43:03,819 INFO L131 PetriNetUnfolder]: For 53884/53884 co-relation queries the response was YES. [2023-08-30 02:43:04,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101027 conditions, 32018 events. 23663/32018 cut-off events. For 53884/53884 co-relation queries the response was YES. Maximal size of possible extension queue 862. Compared 170902 event pairs, 9244 based on Foata normal form. 616/32634 useless extension candidates. Maximal degree in co-relation 101013. Up to 25442 conditions per place. [2023-08-30 02:43:04,121 INFO L137 encePairwiseOnDemand]: 261/272 looper letters, 71 selfloop transitions, 15 changer transitions 24/110 dead transitions. [2023-08-30 02:43:04,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 110 transitions, 736 flow [2023-08-30 02:43:04,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:43:04,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:43:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 887 transitions. [2023-08-30 02:43:04,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46586134453781514 [2023-08-30 02:43:04,124 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 887 transitions. [2023-08-30 02:43:04,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 887 transitions. [2023-08-30 02:43:04,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:43:04,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 887 transitions. [2023-08-30 02:43:04,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.71428571428571) internal successors, (887), 7 states have internal predecessors, (887), 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 02:43:04,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 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 02:43:04,131 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 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 02:43:04,131 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 220 flow. Second operand 7 states and 887 transitions. [2023-08-30 02:43:04,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 110 transitions, 736 flow [2023-08-30 02:43:04,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 110 transitions, 704 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-30 02:43:04,630 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 335 flow [2023-08-30 02:43:04,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=335, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2023-08-30 02:43:04,631 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places. [2023-08-30 02:43:04,631 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 335 flow [2023-08-30 02:43:04,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.57142857142857) internal successors, (809), 7 states have internal predecessors, (809), 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 02:43:04,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:43:04,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:43:04,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:43:04,632 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:43:04,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:43:04,632 INFO L85 PathProgramCache]: Analyzing trace with hash 664854663, now seen corresponding path program 1 times [2023-08-30 02:43:04,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:43:04,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213812225] [2023-08-30 02:43:04,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:43:04,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:43:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:43:05,168 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 02:43:05,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:43:05,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213812225] [2023-08-30 02:43:05,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213812225] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:43:05,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:43:05,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:43:05,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975526599] [2023-08-30 02:43:05,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:43:05,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:43:05,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:43:05,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:43:05,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:43:05,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 272 [2023-08-30 02:43:05,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 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 02:43:05,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:43:05,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 272 [2023-08-30 02:43:05,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:43:08,201 INFO L130 PetriNetUnfolder]: 24802/33589 cut-off events. [2023-08-30 02:43:08,201 INFO L131 PetriNetUnfolder]: For 90363/90363 co-relation queries the response was YES. [2023-08-30 02:43:08,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123042 conditions, 33589 events. 24802/33589 cut-off events. For 90363/90363 co-relation queries the response was YES. Maximal size of possible extension queue 918. Compared 180588 event pairs, 9084 based on Foata normal form. 516/34105 useless extension candidates. Maximal degree in co-relation 123025. Up to 26609 conditions per place. [2023-08-30 02:43:08,516 INFO L137 encePairwiseOnDemand]: 259/272 looper letters, 103 selfloop transitions, 22 changer transitions 30/155 dead transitions. [2023-08-30 02:43:08,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 155 transitions, 1220 flow [2023-08-30 02:43:08,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:43:08,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:43:08,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1028 transitions. [2023-08-30 02:43:08,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4724264705882353 [2023-08-30 02:43:08,519 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1028 transitions. [2023-08-30 02:43:08,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1028 transitions. [2023-08-30 02:43:08,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:43:08,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1028 transitions. [2023-08-30 02:43:08,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 128.5) internal successors, (1028), 8 states have internal predecessors, (1028), 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 02:43:08,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 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 02:43:08,526 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 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 02:43:08,526 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 335 flow. Second operand 8 states and 1028 transitions. [2023-08-30 02:43:08,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 155 transitions, 1220 flow [2023-08-30 02:43:09,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 155 transitions, 1197 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-30 02:43:09,118 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 530 flow [2023-08-30 02:43:09,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=530, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2023-08-30 02:43:09,119 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places. [2023-08-30 02:43:09,119 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 530 flow [2023-08-30 02:43:09,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 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 02:43:09,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:43:09,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:43:09,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:43:09,120 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:43:09,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:43:09,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1225396729, now seen corresponding path program 2 times [2023-08-30 02:43:09,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:43:09,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97732185] [2023-08-30 02:43:09,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:43:09,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:43:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:43:09,954 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 02:43:09,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:43:09,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97732185] [2023-08-30 02:43:09,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97732185] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:43:09,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:43:09,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:43:09,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677097654] [2023-08-30 02:43:09,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:43:09,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:43:09,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:43:09,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:43:09,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:43:09,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 272 [2023-08-30 02:43:09,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 530 flow. Second operand has 7 states, 7 states have (on average 129.42857142857142) internal successors, (906), 7 states have internal predecessors, (906), 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 02:43:09,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:43:10,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 272 [2023-08-30 02:43:10,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:43:12,665 INFO L130 PetriNetUnfolder]: 15880/23260 cut-off events. [2023-08-30 02:43:12,665 INFO L131 PetriNetUnfolder]: For 115571/119242 co-relation queries the response was YES. [2023-08-30 02:43:12,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99683 conditions, 23260 events. 15880/23260 cut-off events. For 115571/119242 co-relation queries the response was YES. Maximal size of possible extension queue 963. Compared 148270 event pairs, 6451 based on Foata normal form. 568/23059 useless extension candidates. Maximal degree in co-relation 99662. Up to 16650 conditions per place. [2023-08-30 02:43:12,831 INFO L137 encePairwiseOnDemand]: 267/272 looper letters, 73 selfloop transitions, 10 changer transitions 16/117 dead transitions. [2023-08-30 02:43:12,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 117 transitions, 1021 flow [2023-08-30 02:43:12,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:43:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:43:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 836 transitions. [2023-08-30 02:43:12,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5122549019607843 [2023-08-30 02:43:12,834 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 836 transitions. [2023-08-30 02:43:12,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 836 transitions. [2023-08-30 02:43:12,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:43:12,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 836 transitions. [2023-08-30 02:43:12,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.33333333333334) internal successors, (836), 6 states have internal predecessors, (836), 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 02:43:12,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 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 02:43:12,838 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 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 02:43:12,838 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 530 flow. Second operand 6 states and 836 transitions. [2023-08-30 02:43:12,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 117 transitions, 1021 flow [2023-08-30 02:43:13,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 117 transitions, 991 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-08-30 02:43:13,064 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 533 flow [2023-08-30 02:43:13,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=533, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2023-08-30 02:43:13,065 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 22 predicate places. [2023-08-30 02:43:13,065 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 533 flow [2023-08-30 02:43:13,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 129.42857142857142) internal successors, (906), 7 states have internal predecessors, (906), 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 02:43:13,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:43:13,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:43:13,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:43:13,066 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:43:13,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:43:13,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1872960424, now seen corresponding path program 1 times [2023-08-30 02:43:13,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:43:13,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939408119] [2023-08-30 02:43:13,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:43:13,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:43:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:43:13,260 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 02:43:13,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:43:13,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939408119] [2023-08-30 02:43:13,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939408119] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:43:13,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:43:13,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:43:13,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035797260] [2023-08-30 02:43:13,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:43:13,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:43:13,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:43:13,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:43:13,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:43:13,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 272 [2023-08-30 02:43:13,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 533 flow. Second operand has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 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 02:43:13,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:43:13,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 272 [2023-08-30 02:43:13,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:43:15,184 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][110], [288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 273#true, 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, 7#L841true, 46#P2EXITtrue, Black: 281#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), P2Thread1of1ForFork2InUse, 68#L758true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), 13#L785true, Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:15,184 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 02:43:15,184 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:43:15,184 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:43:15,184 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:43:15,189 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][110], [288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 273#true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 7#L841true, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, Black: 281#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 68#L758true, Black: 279#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), P2Thread1of1ForFork2InUse, 122#L818true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 13#L785true, 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:15,189 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 02:43:15,189 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:15,189 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:15,189 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:15,620 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][114], [292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 273#true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 7#L841true, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, Black: 281#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 68#L758true, Black: 279#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), P2Thread1of1ForFork2InUse, 23#L788true, 122#L818true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:15,620 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 02:43:15,621 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:43:15,621 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:43:15,621 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:43:15,624 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][110], [288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 273#true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 7#L841true, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, 46#P2EXITtrue, Black: 281#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 68#L758true, Black: 279#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), P2Thread1of1ForFork2InUse, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 13#L785true, 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:15,624 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 02:43:15,624 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:43:15,624 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:43:15,624 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:43:15,625 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:43:15,841 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][114], [292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 273#true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork0InUse, 7#L841true, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 46#P2EXITtrue, Black: 281#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 68#L758true, Black: 279#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), P2Thread1of1ForFork2InUse, 23#L788true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:15,842 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 02:43:15,842 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:43:15,842 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:43:15,842 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:43:16,045 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][114], [292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 273#true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork0InUse, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 7#L841true, 46#P2EXITtrue, Black: 281#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), P2Thread1of1ForFork2InUse, 68#L758true, 23#L788true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:16,045 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 02:43:16,046 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:43:16,046 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:43:16,046 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:43:16,046 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:43:16,051 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][114], [292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 273#true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 7#L841true, P3Thread1of1ForFork0InUse, 46#P2EXITtrue, Black: 281#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 68#L758true, Black: 279#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), P2Thread1of1ForFork2InUse, 23#L788true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:16,051 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 02:43:16,051 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:43:16,051 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:43:16,051 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:43:17,087 INFO L130 PetriNetUnfolder]: 23399/33837 cut-off events. [2023-08-30 02:43:17,088 INFO L131 PetriNetUnfolder]: For 187221/192627 co-relation queries the response was YES. [2023-08-30 02:43:17,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147607 conditions, 33837 events. 23399/33837 cut-off events. For 187221/192627 co-relation queries the response was YES. Maximal size of possible extension queue 1456. Compared 227784 event pairs, 6071 based on Foata normal form. 1443/34182 useless extension candidates. Maximal degree in co-relation 147585. Up to 15702 conditions per place. [2023-08-30 02:43:17,383 INFO L137 encePairwiseOnDemand]: 268/272 looper letters, 94 selfloop transitions, 3 changer transitions 14/133 dead transitions. [2023-08-30 02:43:17,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 133 transitions, 1208 flow [2023-08-30 02:43:17,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:43:17,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:43:17,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 690 transitions. [2023-08-30 02:43:17,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073529411764706 [2023-08-30 02:43:17,386 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 690 transitions. [2023-08-30 02:43:17,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 690 transitions. [2023-08-30 02:43:17,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:43:17,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 690 transitions. [2023-08-30 02:43:17,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 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 02:43:17,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 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 02:43:17,389 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 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 02:43:17,389 INFO L175 Difference]: Start difference. First operand has 76 places, 67 transitions, 533 flow. Second operand 5 states and 690 transitions. [2023-08-30 02:43:17,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 133 transitions, 1208 flow [2023-08-30 02:43:17,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 133 transitions, 1169 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-30 02:43:17,777 INFO L231 Difference]: Finished difference. Result has 77 places, 69 transitions, 539 flow [2023-08-30 02:43:17,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=539, PETRI_PLACES=77, PETRI_TRANSITIONS=69} [2023-08-30 02:43:17,778 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 23 predicate places. [2023-08-30 02:43:17,778 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 69 transitions, 539 flow [2023-08-30 02:43:17,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 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 02:43:17,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:43:17,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:43:17,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 02:43:17,779 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:43:17,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:43:17,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1901069766, now seen corresponding path program 2 times [2023-08-30 02:43:17,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:43:17,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12712035] [2023-08-30 02:43:17,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:43:17,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:43:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:43:17,960 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 02:43:17,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:43:17,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12712035] [2023-08-30 02:43:17,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12712035] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:43:17,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:43:17,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:43:17,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133015981] [2023-08-30 02:43:17,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:43:17,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:43:17,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:43:17,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:43:17,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:43:17,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 272 [2023-08-30 02:43:17,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 69 transitions, 539 flow. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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 02:43:17,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:43:17,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 272 [2023-08-30 02:43:17,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:43:19,540 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][135], [288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 302#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 61#L869true, P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork0InUse, 7#L841true, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 46#P2EXITtrue, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 68#L758true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 294#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), 13#L785true, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:19,541 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 02:43:19,541 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:19,541 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:19,541 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:19,610 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([497] L876-->L893: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd0~0_68 256) 0)) (.cse8 (= (mod v_~x$r_buff0_thd0~0_70 256) 0))) (let ((.cse9 (not .cse8)) (.cse13 (= (mod v_~x$w_buff0_used~0_174 256) 0)) (.cse5 (and .cse8 .cse4)) (.cse6 (and .cse8 (= 0 (mod v_~x$w_buff1_used~0_147 256))))) (let ((.cse11 (or .cse13 .cse5 .cse6)) (.cse12 (and (not .cse13) .cse9))) (let ((.cse2 (= (mod v_~x$w_buff1_used~0_146 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_173 256) 0)) (.cse7 (ite .cse11 v_~x~0_100 (ite .cse12 v_~x$w_buff0~0_91 v_~x$w_buff1~0_70))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0)))) (and (= v_~x$r_buff1_thd0~0_67 (ite .cse0 v_~x$r_buff1_thd0~0_68 (ite (let ((.cse3 (= (mod v_~x$r_buff0_thd0~0_69 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse3 .cse4))) v_~x$r_buff1_thd0~0_68 0))) (= v_~x$w_buff1~0_69 v_~x$w_buff1~0_70) (= v_~x$mem_tmp~0_24 v_~x~0_100) (= v_~x$w_buff1_used~0_146 (ite .cse0 v_~x$w_buff1_used~0_147 (ite (or .cse1 .cse5 .cse6) v_~x$w_buff1_used~0_147 0))) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$mem_tmp~0_24 .cse7) v_~x~0_99) (= (ite .cse0 v_~x$r_buff0_thd0~0_70 (ite (or .cse1 .cse5 (and .cse2 .cse8)) v_~x$r_buff0_thd0~0_70 (ite (and (not .cse1) .cse9) 0 v_~x$r_buff0_thd0~0_70))) v_~x$r_buff0_thd0~0_69) (= (ite (= (ite (not (and (= 2 .cse7) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_16))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16) (= v_~x$flush_delayed~0_33 0) (= (let ((.cse10 (mod (mod v_~main$tmp_guard1~0_16 256) 4294967296))) (ite (<= .cse10 2147483647) .cse10 (+ .cse10 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= (ite .cse0 v_~x$w_buff0_used~0_174 (ite .cse11 v_~x$w_buff0_used~0_174 (ite .cse12 0 v_~x$w_buff0_used~0_174))) v_~x$w_buff0_used~0_173)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_70, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_147, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x~0=v_~x~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_174} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~x$flush_delayed~0=v_~x$flush_delayed~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_69, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_33|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_173, ~weak$$choice0~0=v_~weak$$choice0~0_15, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_99} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][146], [299#true, 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 107#L831true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 110#L811true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 294#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, 85#L893true, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 13#L785true, 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:19,610 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 02:43:19,611 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:19,611 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:19,611 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:19,611 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([428] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][81], [299#true, 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 107#L831true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 122#L818true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 294#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 13#L785true, 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:19,612 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 02:43:19,612 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:19,612 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:19,612 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:19,615 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][123], [299#true, 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 50#L808true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork0InUse, 7#L841true, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 294#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 13#L785true, 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:19,615 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 02:43:19,615 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:19,615 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:19,615 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:19,616 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([497] L876-->L893: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd0~0_68 256) 0)) (.cse8 (= (mod v_~x$r_buff0_thd0~0_70 256) 0))) (let ((.cse9 (not .cse8)) (.cse13 (= (mod v_~x$w_buff0_used~0_174 256) 0)) (.cse5 (and .cse8 .cse4)) (.cse6 (and .cse8 (= 0 (mod v_~x$w_buff1_used~0_147 256))))) (let ((.cse11 (or .cse13 .cse5 .cse6)) (.cse12 (and (not .cse13) .cse9))) (let ((.cse2 (= (mod v_~x$w_buff1_used~0_146 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_173 256) 0)) (.cse7 (ite .cse11 v_~x~0_100 (ite .cse12 v_~x$w_buff0~0_91 v_~x$w_buff1~0_70))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0)))) (and (= v_~x$r_buff1_thd0~0_67 (ite .cse0 v_~x$r_buff1_thd0~0_68 (ite (let ((.cse3 (= (mod v_~x$r_buff0_thd0~0_69 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse3 .cse4))) v_~x$r_buff1_thd0~0_68 0))) (= v_~x$w_buff1~0_69 v_~x$w_buff1~0_70) (= v_~x$mem_tmp~0_24 v_~x~0_100) (= v_~x$w_buff1_used~0_146 (ite .cse0 v_~x$w_buff1_used~0_147 (ite (or .cse1 .cse5 .cse6) v_~x$w_buff1_used~0_147 0))) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$mem_tmp~0_24 .cse7) v_~x~0_99) (= (ite .cse0 v_~x$r_buff0_thd0~0_70 (ite (or .cse1 .cse5 (and .cse2 .cse8)) v_~x$r_buff0_thd0~0_70 (ite (and (not .cse1) .cse9) 0 v_~x$r_buff0_thd0~0_70))) v_~x$r_buff0_thd0~0_69) (= (ite (= (ite (not (and (= 2 .cse7) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_16))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16) (= v_~x$flush_delayed~0_33 0) (= (let ((.cse10 (mod (mod v_~main$tmp_guard1~0_16 256) 4294967296))) (ite (<= .cse10 2147483647) .cse10 (+ .cse10 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= (ite .cse0 v_~x$w_buff0_used~0_174 (ite .cse11 v_~x$w_buff0_used~0_174 (ite .cse12 0 v_~x$w_buff0_used~0_174))) v_~x$w_buff0_used~0_173)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_70, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_147, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x~0=v_~x~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_174} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~x$flush_delayed~0=v_~x$flush_delayed~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_69, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_33|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_173, ~weak$$choice0~0=v_~weak$$choice0~0_15, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_99} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][146], [299#true, 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 88#L834true, 50#L808true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork0InUse, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 294#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, 85#L893true, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 13#L785true, 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:19,617 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 02:43:19,617 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:19,617 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:19,617 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:20,073 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][123], [299#true, 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 7#L841true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 110#L811true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 294#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 13#L785true, 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:20,073 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 02:43:20,073 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:43:20,073 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:43:20,074 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:43:20,074 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([497] L876-->L893: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd0~0_68 256) 0)) (.cse8 (= (mod v_~x$r_buff0_thd0~0_70 256) 0))) (let ((.cse9 (not .cse8)) (.cse13 (= (mod v_~x$w_buff0_used~0_174 256) 0)) (.cse5 (and .cse8 .cse4)) (.cse6 (and .cse8 (= 0 (mod v_~x$w_buff1_used~0_147 256))))) (let ((.cse11 (or .cse13 .cse5 .cse6)) (.cse12 (and (not .cse13) .cse9))) (let ((.cse2 (= (mod v_~x$w_buff1_used~0_146 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_173 256) 0)) (.cse7 (ite .cse11 v_~x~0_100 (ite .cse12 v_~x$w_buff0~0_91 v_~x$w_buff1~0_70))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0)))) (and (= v_~x$r_buff1_thd0~0_67 (ite .cse0 v_~x$r_buff1_thd0~0_68 (ite (let ((.cse3 (= (mod v_~x$r_buff0_thd0~0_69 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse3 .cse4))) v_~x$r_buff1_thd0~0_68 0))) (= v_~x$w_buff1~0_69 v_~x$w_buff1~0_70) (= v_~x$mem_tmp~0_24 v_~x~0_100) (= v_~x$w_buff1_used~0_146 (ite .cse0 v_~x$w_buff1_used~0_147 (ite (or .cse1 .cse5 .cse6) v_~x$w_buff1_used~0_147 0))) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$mem_tmp~0_24 .cse7) v_~x~0_99) (= (ite .cse0 v_~x$r_buff0_thd0~0_70 (ite (or .cse1 .cse5 (and .cse2 .cse8)) v_~x$r_buff0_thd0~0_70 (ite (and (not .cse1) .cse9) 0 v_~x$r_buff0_thd0~0_70))) v_~x$r_buff0_thd0~0_69) (= (ite (= (ite (not (and (= 2 .cse7) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_16))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16) (= v_~x$flush_delayed~0_33 0) (= (let ((.cse10 (mod (mod v_~main$tmp_guard1~0_16 256) 4294967296))) (ite (<= .cse10 2147483647) .cse10 (+ .cse10 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= (ite .cse0 v_~x$w_buff0_used~0_174 (ite .cse11 v_~x$w_buff0_used~0_174 (ite .cse12 0 v_~x$w_buff0_used~0_174))) v_~x$w_buff0_used~0_173)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_70, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_147, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x~0=v_~x~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_174} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~x$flush_delayed~0=v_~x$flush_delayed~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_69, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_33|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_173, ~weak$$choice0~0=v_~weak$$choice0~0_15, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_99} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][146], [299#true, 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 88#L834true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 110#L811true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 294#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, 85#L893true, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 13#L785true, 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:20,074 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 02:43:20,074 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:43:20,074 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:43:20,074 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:43:20,092 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][123], [299#true, 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork0InUse, 7#L841true, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 110#L811true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 294#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), 13#L785true, Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:20,093 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 02:43:20,093 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:43:20,093 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:43:20,093 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:43:20,093 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([497] L876-->L893: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd0~0_68 256) 0)) (.cse8 (= (mod v_~x$r_buff0_thd0~0_70 256) 0))) (let ((.cse9 (not .cse8)) (.cse13 (= (mod v_~x$w_buff0_used~0_174 256) 0)) (.cse5 (and .cse8 .cse4)) (.cse6 (and .cse8 (= 0 (mod v_~x$w_buff1_used~0_147 256))))) (let ((.cse11 (or .cse13 .cse5 .cse6)) (.cse12 (and (not .cse13) .cse9))) (let ((.cse2 (= (mod v_~x$w_buff1_used~0_146 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_173 256) 0)) (.cse7 (ite .cse11 v_~x~0_100 (ite .cse12 v_~x$w_buff0~0_91 v_~x$w_buff1~0_70))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0)))) (and (= v_~x$r_buff1_thd0~0_67 (ite .cse0 v_~x$r_buff1_thd0~0_68 (ite (let ((.cse3 (= (mod v_~x$r_buff0_thd0~0_69 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse3 .cse4))) v_~x$r_buff1_thd0~0_68 0))) (= v_~x$w_buff1~0_69 v_~x$w_buff1~0_70) (= v_~x$mem_tmp~0_24 v_~x~0_100) (= v_~x$w_buff1_used~0_146 (ite .cse0 v_~x$w_buff1_used~0_147 (ite (or .cse1 .cse5 .cse6) v_~x$w_buff1_used~0_147 0))) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$mem_tmp~0_24 .cse7) v_~x~0_99) (= (ite .cse0 v_~x$r_buff0_thd0~0_70 (ite (or .cse1 .cse5 (and .cse2 .cse8)) v_~x$r_buff0_thd0~0_70 (ite (and (not .cse1) .cse9) 0 v_~x$r_buff0_thd0~0_70))) v_~x$r_buff0_thd0~0_69) (= (ite (= (ite (not (and (= 2 .cse7) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_16))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16) (= v_~x$flush_delayed~0_33 0) (= (let ((.cse10 (mod (mod v_~main$tmp_guard1~0_16 256) 4294967296))) (ite (<= .cse10 2147483647) .cse10 (+ .cse10 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= (ite .cse0 v_~x$w_buff0_used~0_174 (ite .cse11 v_~x$w_buff0_used~0_174 (ite .cse12 0 v_~x$w_buff0_used~0_174))) v_~x$w_buff0_used~0_173)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_70, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_147, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x~0=v_~x~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_174} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~x$flush_delayed~0=v_~x$flush_delayed~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_69, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_33|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_173, ~weak$$choice0~0=v_~weak$$choice0~0_15, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_99} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][146], [299#true, 288#(= ~y~0 1), 88#L834true, Black: 191#(= ~__unbuffered_p2_EAX~0 0), Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork0InUse, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 110#L811true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 294#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, 85#L893true, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), 13#L785true, Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:20,094 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 02:43:20,094 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:43:20,094 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:43:20,094 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:43:20,529 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][123], [299#true, 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 95#L795true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork0InUse, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 7#L841true, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 110#L811true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 288#(= ~y~0 1), Black: 294#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:20,529 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-30 02:43:20,529 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:43:20,529 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:43:20,529 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:43:20,838 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][123], [299#true, 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 191#(= ~__unbuffered_p2_EAX~0 0), Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork0InUse, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 7#L841true, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 110#L811true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 288#(= ~y~0 1), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 294#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 117#P1EXITtrue, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:20,838 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-30 02:43:20,838 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:43:20,838 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:43:20,838 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:43:21,135 INFO L130 PetriNetUnfolder]: 17970/26520 cut-off events. [2023-08-30 02:43:21,135 INFO L131 PetriNetUnfolder]: For 147585/153241 co-relation queries the response was YES. [2023-08-30 02:43:21,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112914 conditions, 26520 events. 17970/26520 cut-off events. For 147585/153241 co-relation queries the response was YES. Maximal size of possible extension queue 1544. Compared 186603 event pairs, 4631 based on Foata normal form. 3015/28652 useless extension candidates. Maximal degree in co-relation 112891. Up to 16737 conditions per place. [2023-08-30 02:43:21,350 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 118 selfloop transitions, 10 changer transitions 2/156 dead transitions. [2023-08-30 02:43:21,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 156 transitions, 1392 flow [2023-08-30 02:43:21,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:43:21,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:43:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 689 transitions. [2023-08-30 02:43:21,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066176470588235 [2023-08-30 02:43:21,352 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 689 transitions. [2023-08-30 02:43:21,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 689 transitions. [2023-08-30 02:43:21,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:43:21,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 689 transitions. [2023-08-30 02:43:21,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.8) internal successors, (689), 5 states have internal predecessors, (689), 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 02:43:21,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 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 02:43:21,356 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 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 02:43:21,357 INFO L175 Difference]: Start difference. First operand has 77 places, 69 transitions, 539 flow. Second operand 5 states and 689 transitions. [2023-08-30 02:43:21,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 156 transitions, 1392 flow [2023-08-30 02:43:21,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 156 transitions, 1386 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:43:21,435 INFO L231 Difference]: Finished difference. Result has 81 places, 78 transitions, 615 flow [2023-08-30 02:43:21,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=615, PETRI_PLACES=81, PETRI_TRANSITIONS=78} [2023-08-30 02:43:21,436 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 27 predicate places. [2023-08-30 02:43:21,436 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 78 transitions, 615 flow [2023-08-30 02:43:21,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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 02:43:21,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:43:21,437 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] [2023-08-30 02:43:21,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:43:21,437 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:43:21,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:43:21,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1800368502, now seen corresponding path program 1 times [2023-08-30 02:43:21,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:43:21,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007042458] [2023-08-30 02:43:21,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:43:21,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:43:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:43:21,611 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 02:43:21,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:43:21,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007042458] [2023-08-30 02:43:21,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007042458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:43:21,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:43:21,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:43:21,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670229558] [2023-08-30 02:43:21,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:43:21,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:43:21,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:43:21,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:43:21,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:43:21,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 272 [2023-08-30 02:43:21,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 78 transitions, 615 flow. Second operand has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 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 02:43:21,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:43:21,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 272 [2023-08-30 02:43:21,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:43:23,151 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][142], [288#(= ~y~0 1), 302#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 191#(= ~__unbuffered_p2_EAX~0 0), Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 317#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 61#L869true, P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 7#L841true, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, 46#P2EXITtrue, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 68#L758true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 301#(= ~__unbuffered_cnt~0 0), Black: 304#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), 13#L785true, Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:23,151 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 02:43:23,151 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:23,152 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:23,152 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:24,317 INFO L130 PetriNetUnfolder]: 13613/20775 cut-off events. [2023-08-30 02:43:24,317 INFO L131 PetriNetUnfolder]: For 115724/120646 co-relation queries the response was YES. [2023-08-30 02:43:24,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99187 conditions, 20775 events. 13613/20775 cut-off events. For 115724/120646 co-relation queries the response was YES. Maximal size of possible extension queue 1268. Compared 150497 event pairs, 1487 based on Foata normal form. 2230/22418 useless extension candidates. Maximal degree in co-relation 99162. Up to 7410 conditions per place. [2023-08-30 02:43:24,499 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 150 selfloop transitions, 19 changer transitions 9/204 dead transitions. [2023-08-30 02:43:24,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 204 transitions, 1916 flow [2023-08-30 02:43:24,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:43:24,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:43:24,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 966 transitions. [2023-08-30 02:43:24,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073529411764706 [2023-08-30 02:43:24,502 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 966 transitions. [2023-08-30 02:43:24,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 966 transitions. [2023-08-30 02:43:24,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:43:24,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 966 transitions. [2023-08-30 02:43:24,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.0) internal successors, (966), 7 states have internal predecessors, (966), 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 02:43:24,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 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 02:43:24,506 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 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 02:43:24,506 INFO L175 Difference]: Start difference. First operand has 81 places, 78 transitions, 615 flow. Second operand 7 states and 966 transitions. [2023-08-30 02:43:24,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 204 transitions, 1916 flow [2023-08-30 02:43:24,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 204 transitions, 1911 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:43:24,663 INFO L231 Difference]: Finished difference. Result has 89 places, 87 transitions, 748 flow [2023-08-30 02:43:24,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=748, PETRI_PLACES=89, PETRI_TRANSITIONS=87} [2023-08-30 02:43:24,663 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 35 predicate places. [2023-08-30 02:43:24,663 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 748 flow [2023-08-30 02:43:24,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 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 02:43:24,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:43:24,664 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] [2023-08-30 02:43:24,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:43:24,664 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:43:24,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:43:24,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1731324700, now seen corresponding path program 1 times [2023-08-30 02:43:24,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:43:24,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718689325] [2023-08-30 02:43:24,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:43:24,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:43:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:43:25,070 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 02:43:25,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:43:25,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718689325] [2023-08-30 02:43:25,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718689325] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:43:25,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:43:25,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:43:25,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805131094] [2023-08-30 02:43:25,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:43:25,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:43:25,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:43:25,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:43:25,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:43:25,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 272 [2023-08-30 02:43:25,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 87 transitions, 748 flow. Second operand has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 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 02:43:25,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:43:25,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 272 [2023-08-30 02:43:25,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:43:30,520 INFO L130 PetriNetUnfolder]: 31150/45458 cut-off events. [2023-08-30 02:43:30,521 INFO L131 PetriNetUnfolder]: For 251235/255437 co-relation queries the response was YES. [2023-08-30 02:43:30,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236418 conditions, 45458 events. 31150/45458 cut-off events. For 251235/255437 co-relation queries the response was YES. Maximal size of possible extension queue 2043. Compared 318515 event pairs, 2030 based on Foata normal form. 1968/47395 useless extension candidates. Maximal degree in co-relation 236390. Up to 23185 conditions per place. [2023-08-30 02:43:30,900 INFO L137 encePairwiseOnDemand]: 263/272 looper letters, 135 selfloop transitions, 18 changer transitions 66/225 dead transitions. [2023-08-30 02:43:30,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 225 transitions, 2319 flow [2023-08-30 02:43:30,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:43:30,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:43:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 883 transitions. [2023-08-30 02:43:30,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4637605042016807 [2023-08-30 02:43:30,903 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 883 transitions. [2023-08-30 02:43:30,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 883 transitions. [2023-08-30 02:43:30,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:43:30,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 883 transitions. [2023-08-30 02:43:30,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 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 02:43:30,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 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 02:43:30,907 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 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 02:43:30,908 INFO L175 Difference]: Start difference. First operand has 89 places, 87 transitions, 748 flow. Second operand 7 states and 883 transitions. [2023-08-30 02:43:30,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 225 transitions, 2319 flow [2023-08-30 02:43:33,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 225 transitions, 2180 flow, removed 47 selfloop flow, removed 3 redundant places. [2023-08-30 02:43:33,445 INFO L231 Difference]: Finished difference. Result has 97 places, 91 transitions, 820 flow [2023-08-30 02:43:33,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=820, PETRI_PLACES=97, PETRI_TRANSITIONS=91} [2023-08-30 02:43:33,446 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 43 predicate places. [2023-08-30 02:43:33,446 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 91 transitions, 820 flow [2023-08-30 02:43:33,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 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 02:43:33,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:43:33,447 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] [2023-08-30 02:43:33,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 02:43:33,447 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:43:33,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:43:33,447 INFO L85 PathProgramCache]: Analyzing trace with hash -692326960, now seen corresponding path program 2 times [2023-08-30 02:43:33,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:43:33,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854976302] [2023-08-30 02:43:33,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:43:33,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:43:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:43:33,683 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 02:43:33,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:43:33,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854976302] [2023-08-30 02:43:33,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854976302] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:43:33,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:43:33,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:43:33,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332154469] [2023-08-30 02:43:33,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:43:33,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:43:33,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:43:33,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:43:33,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:43:33,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 272 [2023-08-30 02:43:33,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 91 transitions, 820 flow. Second operand has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 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 02:43:33,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:43:33,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 272 [2023-08-30 02:43:33,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:43:35,206 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][141], [Black: 312#(<= ~__unbuffered_cnt~0 1), Black: 313#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 50#L808true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 326#(and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 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 (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))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 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 (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))))), 317#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 329#(and (= ~z~0 1) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 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 (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))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 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 (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))))), Black: 332#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 61#L869true, Black: 335#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 7#L841true, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 352#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 302#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 112#P0EXITtrue, 324#(= ~z~0 1), Black: 301#(= ~__unbuffered_cnt~0 0), Black: 304#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), 13#L785true, Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:35,206 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 02:43:35,206 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:43:35,206 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:43:35,206 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:43:35,207 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([428] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][134], [Black: 312#(<= ~__unbuffered_cnt~0 1), Black: 313#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 107#L831true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 326#(and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 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 (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))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 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 (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))))), Black: 329#(and (= ~z~0 1) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 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 (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))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 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 (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))))), 317#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 324#(= ~z~0 1), 61#L869true, Black: 335#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 122#L818true, Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 352#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 302#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 112#P0EXITtrue, Black: 301#(= ~__unbuffered_cnt~0 0), Black: 304#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 332#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), 13#L785true, Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:35,208 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 02:43:35,208 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:43:35,208 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:43:35,208 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:43:35,599 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([428] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][134], [Black: 312#(<= ~__unbuffered_cnt~0 1), Black: 313#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 88#L834true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 326#(and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 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 (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))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 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 (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))))), 317#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 329#(and (= ~z~0 1) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 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 (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))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 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 (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))))), Black: 324#(= ~z~0 1), 61#L869true, Black: 335#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork0InUse, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 122#L818true, Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 352#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 302#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 112#P0EXITtrue, Black: 301#(= ~__unbuffered_cnt~0 0), Black: 304#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 332#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), 13#L785true, Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:35,599 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 02:43:35,599 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:35,599 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:35,599 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:36,603 INFO L130 PetriNetUnfolder]: 13315/20833 cut-off events. [2023-08-30 02:43:36,603 INFO L131 PetriNetUnfolder]: For 131436/136051 co-relation queries the response was YES. [2023-08-30 02:43:36,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104899 conditions, 20833 events. 13315/20833 cut-off events. For 131436/136051 co-relation queries the response was YES. Maximal size of possible extension queue 1452. Compared 159305 event pairs, 1025 based on Foata normal form. 1703/22028 useless extension candidates. Maximal degree in co-relation 104866. Up to 7974 conditions per place. [2023-08-30 02:43:36,853 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 172 selfloop transitions, 21 changer transitions 20/244 dead transitions. [2023-08-30 02:43:36,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 244 transitions, 2519 flow [2023-08-30 02:43:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:43:36,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:43:36,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1234 transitions. [2023-08-30 02:43:36,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5040849673202614 [2023-08-30 02:43:36,857 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1234 transitions. [2023-08-30 02:43:36,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1234 transitions. [2023-08-30 02:43:36,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:43:36,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1234 transitions. [2023-08-30 02:43:36,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 137.11111111111111) internal successors, (1234), 9 states have internal predecessors, (1234), 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 02:43:36,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 272.0) internal successors, (2720), 10 states have internal predecessors, (2720), 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 02:43:36,863 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 272.0) internal successors, (2720), 10 states have internal predecessors, (2720), 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 02:43:36,864 INFO L175 Difference]: Start difference. First operand has 97 places, 91 transitions, 820 flow. Second operand 9 states and 1234 transitions. [2023-08-30 02:43:36,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 244 transitions, 2519 flow [2023-08-30 02:43:37,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 244 transitions, 2473 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-08-30 02:43:37,315 INFO L231 Difference]: Finished difference. Result has 103 places, 99 transitions, 949 flow [2023-08-30 02:43:37,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=949, PETRI_PLACES=103, PETRI_TRANSITIONS=99} [2023-08-30 02:43:37,316 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 49 predicate places. [2023-08-30 02:43:37,316 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 99 transitions, 949 flow [2023-08-30 02:43:37,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 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 02:43:37,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:43:37,316 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] [2023-08-30 02:43:37,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 02:43:37,317 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:43:37,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:43:37,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1672008504, now seen corresponding path program 1 times [2023-08-30 02:43:37,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:43:37,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915169924] [2023-08-30 02:43:37,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:43:37,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:43:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:43:37,574 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 02:43:37,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:43:37,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915169924] [2023-08-30 02:43:37,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915169924] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:43:37,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:43:37,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:43:37,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465742114] [2023-08-30 02:43:37,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:43:37,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:43:37,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:43:37,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:43:37,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:43:37,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 272 [2023-08-30 02:43:37,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 99 transitions, 949 flow. Second operand has 7 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 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 02:43:37,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:43:37,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 272 [2023-08-30 02:43:37,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:43:39,303 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([428] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][134], [Black: 312#(<= ~__unbuffered_cnt~0 1), Black: 313#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 107#L831true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 326#(and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 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 (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))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 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 (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))))), Black: 329#(and (= ~z~0 1) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 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 (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))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 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 (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))))), 317#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 324#(= ~z~0 1), 61#L869true, P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 369#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 347#(<= ~__unbuffered_cnt~0 2), Black: 354#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 348#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 122#L818true, Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 352#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, Black: 301#(= ~__unbuffered_cnt~0 0), Black: 304#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 332#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 13#L785true, 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:39,304 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 02:43:39,304 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:43:39,305 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:43:39,305 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:43:39,450 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][139], [Black: 312#(<= ~__unbuffered_cnt~0 1), Black: 313#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 50#L808true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 326#(and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 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 (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))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 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 (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))))), Black: 329#(and (= ~z~0 1) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 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 (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))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 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 (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))))), 317#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 332#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 61#L869true, P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 7#L841true, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 369#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 347#(<= ~__unbuffered_cnt~0 2), Black: 354#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 348#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 352#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, 324#(= ~z~0 1), Black: 301#(= ~__unbuffered_cnt~0 0), Black: 304#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 13#L785true, 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:39,450 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-08-30 02:43:39,450 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-30 02:43:39,450 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-30 02:43:39,450 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-30 02:43:39,552 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([428] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][134], [Black: 312#(<= ~__unbuffered_cnt~0 1), Black: 313#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 288#(= ~y~0 1), 88#L834true, Black: 191#(= ~__unbuffered_p2_EAX~0 0), Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))) (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)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 326#(and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 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 (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))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 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 (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))))), 317#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 329#(and (= ~z~0 1) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 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 (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))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 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 (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (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))))))), Black: 324#(= ~z~0 1), 61#L869true, P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork0InUse, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 369#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 347#(<= ~__unbuffered_cnt~0 2), Black: 354#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 348#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 122#L818true, Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 352#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, Black: 301#(= ~__unbuffered_cnt~0 0), Black: 304#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 332#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 13#L785true, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-30 02:43:39,552 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 02:43:39,552 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:39,552 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:39,552 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:43:40,470 INFO L130 PetriNetUnfolder]: 13153/20428 cut-off events. [2023-08-30 02:43:40,470 INFO L131 PetriNetUnfolder]: For 133720/137181 co-relation queries the response was YES. [2023-08-30 02:43:40,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109286 conditions, 20428 events. 13153/20428 cut-off events. For 133720/137181 co-relation queries the response was YES. Maximal size of possible extension queue 1452. Compared 156158 event pairs, 969 based on Foata normal form. 1063/20964 useless extension candidates. Maximal degree in co-relation 109252. Up to 7915 conditions per place. [2023-08-30 02:43:40,648 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 110 selfloop transitions, 20 changer transitions 92/245 dead transitions. [2023-08-30 02:43:40,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 245 transitions, 2566 flow [2023-08-30 02:43:40,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 02:43:40,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 02:43:40,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1483 transitions. [2023-08-30 02:43:40,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49565508021390375 [2023-08-30 02:43:40,652 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1483 transitions. [2023-08-30 02:43:40,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1483 transitions. [2023-08-30 02:43:40,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:43:40,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1483 transitions. [2023-08-30 02:43:40,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 134.8181818181818) internal successors, (1483), 11 states have internal predecessors, (1483), 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 02:43:40,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 272.0) internal successors, (3264), 12 states have internal predecessors, (3264), 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 02:43:40,659 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 272.0) internal successors, (3264), 12 states have internal predecessors, (3264), 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 02:43:40,659 INFO L175 Difference]: Start difference. First operand has 103 places, 99 transitions, 949 flow. Second operand 11 states and 1483 transitions. [2023-08-30 02:43:40,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 245 transitions, 2566 flow [2023-08-30 02:43:42,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 245 transitions, 2351 flow, removed 75 selfloop flow, removed 6 redundant places. [2023-08-30 02:43:42,557 INFO L231 Difference]: Finished difference. Result has 110 places, 80 transitions, 694 flow [2023-08-30 02:43:42,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=694, PETRI_PLACES=110, PETRI_TRANSITIONS=80} [2023-08-30 02:43:42,558 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 56 predicate places. [2023-08-30 02:43:42,558 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 80 transitions, 694 flow [2023-08-30 02:43:42,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 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 02:43:42,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:43:42,558 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, 1] [2023-08-30 02:43:42,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 02:43:42,559 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:43:42,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:43:42,559 INFO L85 PathProgramCache]: Analyzing trace with hash -2141738407, now seen corresponding path program 1 times [2023-08-30 02:43:42,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:43:42,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158760579] [2023-08-30 02:43:42,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:43:42,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:43:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:43:43,009 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 02:43:43,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:43:43,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158760579] [2023-08-30 02:43:43,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158760579] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:43:43,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:43:43,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:43:43,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129118567] [2023-08-30 02:43:43,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:43:43,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:43:43,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:43:43,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:43:43,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:43:43,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 272 [2023-08-30 02:43:43,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 80 transitions, 694 flow. Second operand has 6 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 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 02:43:43,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:43:43,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 272 [2023-08-30 02:43:43,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:43:46,953 INFO L130 PetriNetUnfolder]: 23197/34642 cut-off events. [2023-08-30 02:43:46,954 INFO L131 PetriNetUnfolder]: For 189558/192154 co-relation queries the response was YES. [2023-08-30 02:43:47,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178847 conditions, 34642 events. 23197/34642 cut-off events. For 189558/192154 co-relation queries the response was YES. Maximal size of possible extension queue 1865. Compared 249093 event pairs, 5396 based on Foata normal form. 1480/36093 useless extension candidates. Maximal degree in co-relation 178812. Up to 19219 conditions per place. [2023-08-30 02:43:47,289 INFO L137 encePairwiseOnDemand]: 263/272 looper letters, 66 selfloop transitions, 3 changer transitions 117/188 dead transitions. [2023-08-30 02:43:47,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 188 transitions, 1899 flow [2023-08-30 02:43:47,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:43:47,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:43:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 882 transitions. [2023-08-30 02:43:47,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4632352941176471 [2023-08-30 02:43:47,291 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 882 transitions. [2023-08-30 02:43:47,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 882 transitions. [2023-08-30 02:43:47,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:43:47,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 882 transitions. [2023-08-30 02:43:47,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 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 02:43:47,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 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 02:43:47,295 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 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 02:43:47,295 INFO L175 Difference]: Start difference. First operand has 110 places, 80 transitions, 694 flow. Second operand 7 states and 882 transitions. [2023-08-30 02:43:47,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 188 transitions, 1899 flow [2023-08-30 02:43:49,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 188 transitions, 1621 flow, removed 88 selfloop flow, removed 14 redundant places. [2023-08-30 02:43:49,019 INFO L231 Difference]: Finished difference. Result has 101 places, 52 transitions, 328 flow [2023-08-30 02:43:49,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=328, PETRI_PLACES=101, PETRI_TRANSITIONS=52} [2023-08-30 02:43:49,019 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 47 predicate places. [2023-08-30 02:43:49,019 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 52 transitions, 328 flow [2023-08-30 02:43:49,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 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 02:43:49,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:43:49,020 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, 1] [2023-08-30 02:43:49,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 02:43:49,020 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:43:49,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:43:49,020 INFO L85 PathProgramCache]: Analyzing trace with hash -206019223, now seen corresponding path program 2 times [2023-08-30 02:43:49,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:43:49,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335115403] [2023-08-30 02:43:49,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:43:49,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:43:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:43:49,899 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 02:43:49,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:43:49,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335115403] [2023-08-30 02:43:49,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335115403] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:43:49,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:43:49,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:43:49,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615340842] [2023-08-30 02:43:49,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:43:49,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:43:49,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:43:49,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:43:49,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:43:49,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 272 [2023-08-30 02:43:49,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 52 transitions, 328 flow. Second operand has 8 states, 8 states have (on average 118.75) internal successors, (950), 8 states have internal predecessors, (950), 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 02:43:49,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:43:49,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 272 [2023-08-30 02:43:49,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:43:50,608 INFO L130 PetriNetUnfolder]: 3216/5025 cut-off events. [2023-08-30 02:43:50,608 INFO L131 PetriNetUnfolder]: For 13098/13098 co-relation queries the response was YES. [2023-08-30 02:43:50,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21138 conditions, 5025 events. 3216/5025 cut-off events. For 13098/13098 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 27570 event pairs, 808 based on Foata normal form. 2/5027 useless extension candidates. Maximal degree in co-relation 21109. Up to 3272 conditions per place. [2023-08-30 02:43:50,638 INFO L137 encePairwiseOnDemand]: 263/272 looper letters, 64 selfloop transitions, 11 changer transitions 22/97 dead transitions. [2023-08-30 02:43:50,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 97 transitions, 779 flow [2023-08-30 02:43:50,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:43:50,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:43:50,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 868 transitions. [2023-08-30 02:43:50,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45588235294117646 [2023-08-30 02:43:50,640 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 868 transitions. [2023-08-30 02:43:50,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 868 transitions. [2023-08-30 02:43:50,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:43:50,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 868 transitions. [2023-08-30 02:43:50,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 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 02:43:50,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 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 02:43:50,645 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 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 02:43:50,645 INFO L175 Difference]: Start difference. First operand has 101 places, 52 transitions, 328 flow. Second operand 7 states and 868 transitions. [2023-08-30 02:43:50,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 97 transitions, 779 flow [2023-08-30 02:43:50,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 97 transitions, 715 flow, removed 26 selfloop flow, removed 15 redundant places. [2023-08-30 02:43:50,706 INFO L231 Difference]: Finished difference. Result has 78 places, 55 transitions, 348 flow [2023-08-30 02:43:50,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=348, PETRI_PLACES=78, PETRI_TRANSITIONS=55} [2023-08-30 02:43:50,706 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 24 predicate places. [2023-08-30 02:43:50,706 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 55 transitions, 348 flow [2023-08-30 02:43:50,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 118.75) internal successors, (950), 8 states have internal predecessors, (950), 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 02:43:50,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:43:50,707 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, 1] [2023-08-30 02:43:50,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 02:43:50,707 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:43:50,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:43:50,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1577237771, now seen corresponding path program 3 times [2023-08-30 02:43:50,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:43:50,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748923663] [2023-08-30 02:43:50,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:43:50,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:43:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:43:51,926 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 02:43:51,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:43:51,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748923663] [2023-08-30 02:43:51,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748923663] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:43:51,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:43:51,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-30 02:43:51,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117283006] [2023-08-30 02:43:51,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:43:51,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 02:43:51,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:43:51,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 02:43:51,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-30 02:43:52,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 272 [2023-08-30 02:43:52,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 55 transitions, 348 flow. Second operand has 11 states, 11 states have (on average 125.27272727272727) internal successors, (1378), 11 states have internal predecessors, (1378), 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 02:43:52,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:43:52,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 272 [2023-08-30 02:43:52,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:43:52,581 INFO L130 PetriNetUnfolder]: 2433/3954 cut-off events. [2023-08-30 02:43:52,581 INFO L131 PetriNetUnfolder]: For 11388/11568 co-relation queries the response was YES. [2023-08-30 02:43:52,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17015 conditions, 3954 events. 2433/3954 cut-off events. For 11388/11568 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 22591 event pairs, 394 based on Foata normal form. 28/3898 useless extension candidates. Maximal degree in co-relation 16993. Up to 1898 conditions per place. [2023-08-30 02:43:52,600 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 80 selfloop transitions, 10 changer transitions 18/114 dead transitions. [2023-08-30 02:43:52,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 114 transitions, 901 flow [2023-08-30 02:43:52,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:43:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:43:52,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 922 transitions. [2023-08-30 02:43:52,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4842436974789916 [2023-08-30 02:43:52,602 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 922 transitions. [2023-08-30 02:43:52,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 922 transitions. [2023-08-30 02:43:52,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:43:52,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 922 transitions. [2023-08-30 02:43:52,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 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 02:43:52,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 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 02:43:52,606 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 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 02:43:52,606 INFO L175 Difference]: Start difference. First operand has 78 places, 55 transitions, 348 flow. Second operand 7 states and 922 transitions. [2023-08-30 02:43:52,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 114 transitions, 901 flow [2023-08-30 02:43:52,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 114 transitions, 865 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-30 02:43:52,663 INFO L231 Difference]: Finished difference. Result has 81 places, 59 transitions, 403 flow [2023-08-30 02:43:52,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=403, PETRI_PLACES=81, PETRI_TRANSITIONS=59} [2023-08-30 02:43:52,664 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 27 predicate places. [2023-08-30 02:43:52,664 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 59 transitions, 403 flow [2023-08-30 02:43:52,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 125.27272727272727) internal successors, (1378), 11 states have internal predecessors, (1378), 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 02:43:52,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:43:52,664 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, 1] [2023-08-30 02:43:52,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 02:43:52,664 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:43:52,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:43:52,665 INFO L85 PathProgramCache]: Analyzing trace with hash 509469427, now seen corresponding path program 4 times [2023-08-30 02:43:52,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:43:52,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961807798] [2023-08-30 02:43:52,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:43:52,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:43:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:43:54,168 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 02:43:54,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:43:54,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961807798] [2023-08-30 02:43:54,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961807798] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:43:54,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:43:54,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-30 02:43:54,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498133708] [2023-08-30 02:43:54,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:43:54,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 02:43:54,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:43:54,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 02:43:54,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-30 02:43:54,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 272 [2023-08-30 02:43:54,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 59 transitions, 403 flow. Second operand has 11 states, 11 states have (on average 111.72727272727273) internal successors, (1229), 11 states have internal predecessors, (1229), 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 02:43:54,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:43:54,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 272 [2023-08-30 02:43:54,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:43:55,125 INFO L130 PetriNetUnfolder]: 3681/5825 cut-off events. [2023-08-30 02:43:55,126 INFO L131 PetriNetUnfolder]: For 20291/20291 co-relation queries the response was YES. [2023-08-30 02:43:55,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25585 conditions, 5825 events. 3681/5825 cut-off events. For 20291/20291 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 33468 event pairs, 421 based on Foata normal form. 2/5827 useless extension candidates. Maximal degree in co-relation 25561. Up to 2316 conditions per place. [2023-08-30 02:43:55,152 INFO L137 encePairwiseOnDemand]: 259/272 looper letters, 60 selfloop transitions, 8 changer transitions 92/160 dead transitions. [2023-08-30 02:43:55,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 160 transitions, 1316 flow [2023-08-30 02:43:55,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:43:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:43:55,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1082 transitions. [2023-08-30 02:43:55,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44199346405228757 [2023-08-30 02:43:55,154 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1082 transitions. [2023-08-30 02:43:55,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1082 transitions. [2023-08-30 02:43:55,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:43:55,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1082 transitions. [2023-08-30 02:43:55,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.22222222222223) internal successors, (1082), 9 states have internal predecessors, (1082), 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 02:43:55,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 272.0) internal successors, (2720), 10 states have internal predecessors, (2720), 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 02:43:55,158 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 272.0) internal successors, (2720), 10 states have internal predecessors, (2720), 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 02:43:55,158 INFO L175 Difference]: Start difference. First operand has 81 places, 59 transitions, 403 flow. Second operand 9 states and 1082 transitions. [2023-08-30 02:43:55,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 160 transitions, 1316 flow [2023-08-30 02:43:55,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 160 transitions, 1298 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-30 02:43:55,271 INFO L231 Difference]: Finished difference. Result has 89 places, 54 transitions, 376 flow [2023-08-30 02:43:55,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=376, PETRI_PLACES=89, PETRI_TRANSITIONS=54} [2023-08-30 02:43:55,272 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 35 predicate places. [2023-08-30 02:43:55,272 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 54 transitions, 376 flow [2023-08-30 02:43:55,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.72727272727273) internal successors, (1229), 11 states have internal predecessors, (1229), 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 02:43:55,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:43:55,273 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, 1] [2023-08-30 02:43:55,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 02:43:55,273 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:43:55,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:43:55,274 INFO L85 PathProgramCache]: Analyzing trace with hash 705429381, now seen corresponding path program 5 times [2023-08-30 02:43:55,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:43:55,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603214521] [2023-08-30 02:43:55,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:43:55,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:43:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:43:55,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:43:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:43:55,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:43:55,369 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:43:55,370 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:43:55,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:43:55,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:43:55,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:43:55,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:43:55,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:43:55,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:43:55,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:43:55,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:43:55,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:43:55,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:43:55,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:43:55,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:43:55,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:43:55,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:43:55,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:43:55,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 02:43:55,375 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:43:55,380 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:43:55,380 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:43:55,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:43:55 BasicIcfg [2023-08-30 02:43:55,461 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:43:55,462 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:43:55,462 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:43:55,462 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:43:55,462 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:42:37" (3/4) ... [2023-08-30 02:43:55,465 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:43:55,465 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:43:55,465 INFO L158 Benchmark]: Toolchain (without parser) took 79794.62ms. Allocated memory was 62.9MB in the beginning and 13.7GB in the end (delta: 13.6GB). Free memory was 38.1MB in the beginning and 10.5GB in the end (delta: -10.5GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2023-08-30 02:43:55,465 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 52.4MB. Free memory is still 30.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:43:55,466 INFO L158 Benchmark]: CACSL2BoogieTranslator took 596.73ms. Allocated memory is still 62.9MB. Free memory was 38.0MB in the beginning and 29.5MB in the end (delta: 8.5MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2023-08-30 02:43:55,466 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.37ms. Allocated memory is still 62.9MB. Free memory was 29.5MB in the beginning and 26.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 02:43:55,466 INFO L158 Benchmark]: Boogie Preprocessor took 69.25ms. Allocated memory is still 62.9MB. Free memory was 26.6MB in the beginning and 41.6MB in the end (delta: -15.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 02:43:55,466 INFO L158 Benchmark]: RCFGBuilder took 755.17ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 41.6MB in the beginning and 44.2MB in the end (delta: -2.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-08-30 02:43:55,467 INFO L158 Benchmark]: TraceAbstraction took 78278.17ms. Allocated memory was 75.5MB in the beginning and 13.7GB in the end (delta: 13.6GB). Free memory was 43.6MB in the beginning and 10.5GB in the end (delta: -10.5GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2023-08-30 02:43:55,467 INFO L158 Benchmark]: Witness Printer took 3.22ms. Allocated memory is still 13.7GB. Free memory is still 10.5GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:43:55,468 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.25ms. Allocated memory is still 52.4MB. Free memory is still 30.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 596.73ms. Allocated memory is still 62.9MB. Free memory was 38.0MB in the beginning and 29.5MB in the end (delta: 8.5MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.37ms. Allocated memory is still 62.9MB. Free memory was 29.5MB in the beginning and 26.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.25ms. Allocated memory is still 62.9MB. Free memory was 26.6MB in the beginning and 41.6MB in the end (delta: -15.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 755.17ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 41.6MB in the beginning and 44.2MB in the end (delta: -2.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 78278.17ms. Allocated memory was 75.5MB in the beginning and 13.7GB in the end (delta: 13.6GB). Free memory was 43.6MB in the beginning and 10.5GB in the end (delta: -10.5GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. * Witness Printer took 3.22ms. Allocated memory is still 13.7GB. Free memory is still 10.5GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 152 PlacesBefore, 54 PlacesAfterwards, 141 TransitionsBefore, 42 TransitionsAfterwards, 3638 CoEnabledTransitionPairs, 8 FixpointIterations, 47 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 127 TotalNumberOfCompositions, 12096 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6131, independent: 5837, independent conditional: 0, independent unconditional: 5837, dependent: 294, dependent conditional: 0, dependent unconditional: 294, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1885, independent: 1846, independent conditional: 0, independent unconditional: 1846, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6131, independent: 3991, independent conditional: 0, independent unconditional: 3991, dependent: 255, dependent conditional: 0, dependent unconditional: 255, unknown: 1885, unknown conditional: 0, unknown unconditional: 1885] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 219, Positive conditional cache size: 0, Positive unconditional cache size: 219, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t145; [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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(&t145, ((void *)0), P0, ((void *)0))=-4, t145={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=0] [L860] 0 pthread_t t146; [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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(&t146, ((void *)0), P1, ((void *)0))=-3, t145={5:0}, t146={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=0] [L862] 0 pthread_t t147; [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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(&t147, ((void *)0), P2, ((void *)0))=-2, t145={5:0}, t146={6:0}, t147={7: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=0] [L864] 0 pthread_t t148; [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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(&t148, ((void *)0), P3, ((void *)0))=-1, t145={5:0}, t146={6:0}, t147={7:0}, t148={3: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=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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$$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=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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$$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=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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$$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=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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$$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=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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$$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=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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$$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=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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$$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=1, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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$$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=1, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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$$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=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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$$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=1, y=1, z=1] [L760] 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) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 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 [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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$$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=1, y=1, z=1] [L790] 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) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 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 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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$$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=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L813] 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) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 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 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 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 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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$$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=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L836] 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) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 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 [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 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 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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$$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=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 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) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 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 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 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 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=1, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={3: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=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 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) [L883] 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)) [L884] 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)) [L885] 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)) [L886] 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)) [L887] 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)) [L888] 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)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, 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=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 859]: 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: 865]: 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: 861]: 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: 863]: 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, 183 locations, 16 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: 78.1s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 60.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2011 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1627 mSDsluCounter, 1304 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1123 mSDsCounter, 340 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4841 IncrementalHoareTripleChecker+Invalid, 5181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 340 mSolverCounterUnsat, 181 mSDtfsCounter, 4841 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=949occurred in iteration=16, InterpolantAutomatonStates: 136, 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.7s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 427 NumberOfCodeBlocks, 427 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 376 ConstructedInterpolants, 0 QuantifiedInterpolants, 5201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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 could not prove your program: unable to determine feasibility of some traces [2023-08-30 02:43:55,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:43:58,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:43:58,167 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:43:58,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:43:58,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:43:58,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:43:58,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:43:58,225 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:43:58,226 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:43:58,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:43:58,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:43:58,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:43:58,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:43:58,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:43:58,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:43:58,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:43:58,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:43:58,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:43:58,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:43:58,247 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:43:58,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:43:58,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:43:58,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:43:58,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:43:58,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:43:58,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:43:58,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:43:58,263 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:43:58,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:43:58,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:43:58,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:43:58,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:43:58,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:43:58,269 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:43:58,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:43:58,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:43:58,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:43:58,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:43:58,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:43:58,271 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:43:58,272 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:43:58,277 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 02:43:58,307 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:43:58,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:43:58,309 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:43:58,309 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:43:58,310 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:43:58,310 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:43:58,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:43:58,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:43:58,311 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:43:58,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:43:58,312 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:43:58,312 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:43:58,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:43:58,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:43:58,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:43:58,313 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:43:58,313 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:43:58,313 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:43:58,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:43:58,314 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:43:58,314 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:43:58,314 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:43:58,314 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:43:58,314 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:43:58,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:43:58,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:43:58,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:43:58,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:43:58,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:43:58,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:43:58,315 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:43:58,315 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:43:58,316 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:43:58,316 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:43:58,316 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:43:58,316 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:43:58,316 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:43:58,316 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 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 -> TOGETHER [2023-08-30 02:43:58,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:43:58,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:43:58,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:43:58,634 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:43:58,634 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:43:58,636 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2023-08-30 02:43:59,896 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:44:00,160 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:44:00,161 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2023-08-30 02:44:00,182 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b58cb6f21/d1c15b9a15904d5b8efca36c98b31563/FLAG2b70aaad9 [2023-08-30 02:44:00,195 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b58cb6f21/d1c15b9a15904d5b8efca36c98b31563 [2023-08-30 02:44:00,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:44:00,199 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:44:00,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:44:00,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:44:00,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:44:00,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:44:00" (1/1) ... [2023-08-30 02:44:00,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74546a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:00, skipping insertion in model container [2023-08-30 02:44:00,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:44:00" (1/1) ... [2023-08-30 02:44:00,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:44:00,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:44:00,470 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/mix005_tso.oepc.i[949,962] [2023-08-30 02:44:00,724 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:44:00,740 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:44:00,754 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/mix005_tso.oepc.i[949,962] [2023-08-30 02:44:00,810 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:44:00,859 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:44:00,860 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:44:00,866 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:44:00,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:00 WrapperNode [2023-08-30 02:44:00,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:44:00,868 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:44:00,868 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:44:00,869 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:44:00,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:00" (1/1) ... [2023-08-30 02:44:00,912 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:00" (1/1) ... [2023-08-30 02:44:00,955 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2023-08-30 02:44:00,956 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:44:00,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:44:00,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:44:00,957 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:44:00,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:00" (1/1) ... [2023-08-30 02:44:00,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:00" (1/1) ... [2023-08-30 02:44:00,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:00" (1/1) ... [2023-08-30 02:44:00,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:00" (1/1) ... [2023-08-30 02:44:00,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:00" (1/1) ... [2023-08-30 02:44:01,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:00" (1/1) ... [2023-08-30 02:44:01,013 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:00" (1/1) ... [2023-08-30 02:44:01,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:00" (1/1) ... [2023-08-30 02:44:01,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:44:01,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:44:01,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:44:01,026 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:44:01,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:00" (1/1) ... [2023-08-30 02:44:01,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:44:01,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:44:01,058 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 02:44:01,088 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 02:44:01,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:44:01,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:44:01,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:44:01,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:44:01,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:44:01,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:44:01,105 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:44:01,105 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:44:01,105 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:44:01,106 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:44:01,106 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:44:01,106 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:44:01,106 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:44:01,106 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:44:01,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:44:01,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:44:01,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:44:01,109 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 02:44:01,320 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:44:01,324 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:44:01,740 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:44:01,851 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:44:01,851 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:44:01,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:44:01 BoogieIcfgContainer [2023-08-30 02:44:01,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:44:01,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:44:01,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:44:01,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:44:01,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:44:00" (1/3) ... [2023-08-30 02:44:01,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee3002c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:44:01, skipping insertion in model container [2023-08-30 02:44:01,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:00" (2/3) ... [2023-08-30 02:44:01,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee3002c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:44:01, skipping insertion in model container [2023-08-30 02:44:01,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:44:01" (3/3) ... [2023-08-30 02:44:01,861 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2023-08-30 02:44:01,876 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:44:01,877 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:44:01,877 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:44:01,936 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:44:01,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 312 flow [2023-08-30 02:44:02,062 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-30 02:44:02,063 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:44:02,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-30 02:44:02,069 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 146 transitions, 312 flow [2023-08-30 02:44:02,078 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 142 transitions, 296 flow [2023-08-30 02:44:02,081 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:44:02,088 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-30 02:44:02,092 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-30 02:44:02,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 296 flow [2023-08-30 02:44:02,137 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-30 02:44:02,137 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:44:02,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-30 02:44:02,143 INFO L119 LiptonReduction]: Number of co-enabled transitions 3638 [2023-08-30 02:44:10,433 INFO L134 LiptonReduction]: Checked pairs total: 11021 [2023-08-30 02:44:10,433 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-08-30 02:44:10,447 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:44:10,453 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@79a50dca, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:44:10,453 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:44:10,455 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:44:10,455 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:44:10,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:10,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:44:10,456 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:10,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:10,461 INFO L85 PathProgramCache]: Analyzing trace with hash 614, now seen corresponding path program 1 times [2023-08-30 02:44:10,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:10,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203470782] [2023-08-30 02:44:10,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:10,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:10,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:10,485 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:44:10,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-30 02:44:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:10,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:44:10,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:10,575 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 02:44:10,576 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:10,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:10,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203470782] [2023-08-30 02:44:10,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203470782] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:10,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:10,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:44:10,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008294316] [2023-08-30 02:44:10,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:10,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:44:10,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:10,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:44:10,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:44:10,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 282 [2023-08-30 02:44:10,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 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 02:44:10,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:10,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 282 [2023-08-30 02:44:10,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:11,853 INFO L130 PetriNetUnfolder]: 5973/8262 cut-off events. [2023-08-30 02:44:11,853 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-30 02:44:11,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16580 conditions, 8262 events. 5973/8262 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 44198 event pairs, 5973 based on Foata normal form. 0/6994 useless extension candidates. Maximal degree in co-relation 16568. Up to 8103 conditions per place. [2023-08-30 02:44:11,923 INFO L137 encePairwiseOnDemand]: 274/282 looper letters, 26 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-30 02:44:11,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 128 flow [2023-08-30 02:44:11,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:44:11,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:44:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 296 transitions. [2023-08-30 02:44:11,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2023-08-30 02:44:11,944 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 296 transitions. [2023-08-30 02:44:11,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 296 transitions. [2023-08-30 02:44:11,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:11,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 296 transitions. [2023-08-30 02:44:11,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.0) internal successors, (296), 2 states have internal predecessors, (296), 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 02:44:11,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 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 02:44:11,961 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 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 02:44:11,962 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 92 flow. Second operand 2 states and 296 transitions. [2023-08-30 02:44:11,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 128 flow [2023-08-30 02:44:11,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:44:11,972 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-30 02:44:11,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-30 02:44:11,979 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-30 02:44:11,980 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-30 02:44:11,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 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 02:44:11,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:11,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:44:12,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-30 02:44:12,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:12,208 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:12,208 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:12,208 INFO L85 PathProgramCache]: Analyzing trace with hash 582743487, now seen corresponding path program 1 times [2023-08-30 02:44:12,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:12,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576192553] [2023-08-30 02:44:12,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:12,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:12,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:12,211 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:44:12,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-30 02:44:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:12,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:44:12,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:12,334 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 02:44:12,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:12,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:12,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576192553] [2023-08-30 02:44:12,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576192553] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:12,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:12,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:44:12,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192957529] [2023-08-30 02:44:12,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:12,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:44:12,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:12,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:44:12,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:44:12,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 282 [2023-08-30 02:44:12,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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 02:44:12,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:12,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 282 [2023-08-30 02:44:12,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:13,310 INFO L130 PetriNetUnfolder]: 4695/6858 cut-off events. [2023-08-30 02:44:13,311 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:44:13,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13431 conditions, 6858 events. 4695/6858 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 41212 event pairs, 861 based on Foata normal form. 0/6285 useless extension candidates. Maximal degree in co-relation 13428. Up to 5107 conditions per place. [2023-08-30 02:44:13,349 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 39 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-08-30 02:44:13,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 49 transitions, 196 flow [2023-08-30 02:44:13,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:44:13,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:44:13,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-08-30 02:44:13,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5130023640661938 [2023-08-30 02:44:13,353 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-08-30 02:44:13,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-08-30 02:44:13,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:13,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-08-30 02:44:13,355 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 02:44:13,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 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 02:44:13,360 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 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 02:44:13,360 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 434 transitions. [2023-08-30 02:44:13,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 49 transitions, 196 flow [2023-08-30 02:44:13,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 49 transitions, 196 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:44:13,362 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-08-30 02:44:13,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, 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=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-30 02:44:13,363 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-30 02:44:13,363 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-08-30 02:44:13,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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 02:44:13,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:13,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:44:13,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-30 02:44:13,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:13,574 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:13,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:13,575 INFO L85 PathProgramCache]: Analyzing trace with hash -746407119, now seen corresponding path program 1 times [2023-08-30 02:44:13,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:13,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171369625] [2023-08-30 02:44:13,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:13,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:13,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:13,581 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:44:13,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 02:44:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:13,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:44:13,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:13,799 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 02:44:13,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:13,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:13,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171369625] [2023-08-30 02:44:13,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171369625] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:13,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:13,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:44:13,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696691981] [2023-08-30 02:44:13,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:13,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:44:13,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:13,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:44:13,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:44:13,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 282 [2023-08-30 02:44:13,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 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 02:44:13,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:13,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 282 [2023-08-30 02:44:13,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:14,502 INFO L130 PetriNetUnfolder]: 3224/4682 cut-off events. [2023-08-30 02:44:14,502 INFO L131 PetriNetUnfolder]: For 313/313 co-relation queries the response was YES. [2023-08-30 02:44:14,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9778 conditions, 4682 events. 3224/4682 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 25458 event pairs, 626 based on Foata normal form. 256/4690 useless extension candidates. Maximal degree in co-relation 9774. Up to 3325 conditions per place. [2023-08-30 02:44:14,524 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 37 selfloop transitions, 5 changer transitions 25/73 dead transitions. [2023-08-30 02:44:14,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 304 flow [2023-08-30 02:44:14,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:44:14,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:44:14,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 679 transitions. [2023-08-30 02:44:14,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48156028368794324 [2023-08-30 02:44:14,527 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 679 transitions. [2023-08-30 02:44:14,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 679 transitions. [2023-08-30 02:44:14,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:14,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 679 transitions. [2023-08-30 02:44:14,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 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 02:44:14,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 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 02:44:14,533 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 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 02:44:14,533 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 5 states and 679 transitions. [2023-08-30 02:44:14,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 304 flow [2023-08-30 02:44:14,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 73 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:44:14,535 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 113 flow [2023-08-30 02:44:14,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-08-30 02:44:14,536 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2023-08-30 02:44:14,536 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 113 flow [2023-08-30 02:44:14,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 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 02:44:14,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:14,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:44:14,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-30 02:44:14,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:14,747 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:14,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:14,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1659023804, now seen corresponding path program 1 times [2023-08-30 02:44:14,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:14,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991929556] [2023-08-30 02:44:14,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:14,748 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:14,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:14,749 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:44:14,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-30 02:44:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:14,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:44:14,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:14,913 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 02:44:14,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:14,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:14,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991929556] [2023-08-30 02:44:14,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991929556] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:14,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:14,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:44:14,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277028481] [2023-08-30 02:44:14,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:14,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:44:14,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:14,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:44:14,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:44:14,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 282 [2023-08-30 02:44:14,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 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 02:44:14,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:14,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 282 [2023-08-30 02:44:14,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:15,465 INFO L130 PetriNetUnfolder]: 1712/2660 cut-off events. [2023-08-30 02:44:15,465 INFO L131 PetriNetUnfolder]: For 924/924 co-relation queries the response was YES. [2023-08-30 02:44:15,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7083 conditions, 2660 events. 1712/2660 cut-off events. For 924/924 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 14210 event pairs, 330 based on Foata normal form. 175/2726 useless extension candidates. Maximal degree in co-relation 7076. Up to 1057 conditions per place. [2023-08-30 02:44:15,479 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 49 selfloop transitions, 9 changer transitions 25/89 dead transitions. [2023-08-30 02:44:15,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 89 transitions, 449 flow [2023-08-30 02:44:15,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:44:15,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:44:15,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 817 transitions. [2023-08-30 02:44:15,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48286052009456265 [2023-08-30 02:44:15,483 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 817 transitions. [2023-08-30 02:44:15,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 817 transitions. [2023-08-30 02:44:15,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:15,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 817 transitions. [2023-08-30 02:44:15,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.16666666666666) internal successors, (817), 6 states have internal predecessors, (817), 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 02:44:15,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 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 02:44:15,491 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 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 02:44:15,491 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 113 flow. Second operand 6 states and 817 transitions. [2023-08-30 02:44:15,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 89 transitions, 449 flow [2023-08-30 02:44:15,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 89 transitions, 442 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:44:15,498 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 178 flow [2023-08-30 02:44:15,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-08-30 02:44:15,499 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2023-08-30 02:44:15,500 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 178 flow [2023-08-30 02:44:15,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 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 02:44:15,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:15,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:44:15,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 02:44:15,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:15,711 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:15,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:15,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1701143744, now seen corresponding path program 1 times [2023-08-30 02:44:15,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:15,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698138033] [2023-08-30 02:44:15,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:15,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:15,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:15,714 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:44:15,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 02:44:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:15,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 02:44:15,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:15,893 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 02:44:15,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:15,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:15,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698138033] [2023-08-30 02:44:15,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698138033] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:15,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:15,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:44:15,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438851168] [2023-08-30 02:44:15,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:15,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:44:15,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:15,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:44:15,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:44:15,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 282 [2023-08-30 02:44:15,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 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 02:44:15,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:15,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 282 [2023-08-30 02:44:15,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:16,424 INFO L130 PetriNetUnfolder]: 1010/1634 cut-off events. [2023-08-30 02:44:16,425 INFO L131 PetriNetUnfolder]: For 1538/1538 co-relation queries the response was YES. [2023-08-30 02:44:16,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4894 conditions, 1634 events. 1010/1634 cut-off events. For 1538/1538 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 8201 event pairs, 276 based on Foata normal form. 67/1649 useless extension candidates. Maximal degree in co-relation 4885. Up to 540 conditions per place. [2023-08-30 02:44:16,436 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 59 selfloop transitions, 13 changer transitions 25/103 dead transitions. [2023-08-30 02:44:16,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 103 transitions, 614 flow [2023-08-30 02:44:16,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:44:16,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:44:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 953 transitions. [2023-08-30 02:44:16,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4827760891590679 [2023-08-30 02:44:16,440 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 953 transitions. [2023-08-30 02:44:16,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 953 transitions. [2023-08-30 02:44:16,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:16,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 953 transitions. [2023-08-30 02:44:16,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.14285714285714) internal successors, (953), 7 states have internal predecessors, (953), 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 02:44:16,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 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 02:44:16,448 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 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 02:44:16,449 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 178 flow. Second operand 7 states and 953 transitions. [2023-08-30 02:44:16,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 103 transitions, 614 flow [2023-08-30 02:44:16,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 103 transitions, 552 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-30 02:44:16,462 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 228 flow [2023-08-30 02:44:16,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=228, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2023-08-30 02:44:16,464 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2023-08-30 02:44:16,464 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 228 flow [2023-08-30 02:44:16,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 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 02:44:16,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:16,465 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] [2023-08-30 02:44:16,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-30 02:44:16,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:16,680 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:16,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:16,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1401259185, now seen corresponding path program 1 times [2023-08-30 02:44:16,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:16,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720641512] [2023-08-30 02:44:16,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:16,682 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:16,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:16,683 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:44:16,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-30 02:44:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:16,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 02:44:16,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:16,896 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 02:44:16,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:16,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:16,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720641512] [2023-08-30 02:44:16,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720641512] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:16,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:16,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:44:16,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558610021] [2023-08-30 02:44:16,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:16,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:44:16,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:16,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:44:16,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:44:16,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 282 [2023-08-30 02:44:16,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 124.85714285714286) internal successors, (874), 7 states have internal predecessors, (874), 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 02:44:16,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:16,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 282 [2023-08-30 02:44:16,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:17,447 INFO L130 PetriNetUnfolder]: 866/1388 cut-off events. [2023-08-30 02:44:17,448 INFO L131 PetriNetUnfolder]: For 1254/1254 co-relation queries the response was YES. [2023-08-30 02:44:17,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3994 conditions, 1388 events. 866/1388 cut-off events. For 1254/1254 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6804 event pairs, 272 based on Foata normal form. 13/1361 useless extension candidates. Maximal degree in co-relation 3984. Up to 540 conditions per place. [2023-08-30 02:44:17,480 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 55 selfloop transitions, 17 changer transitions 13/91 dead transitions. [2023-08-30 02:44:17,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 91 transitions, 554 flow [2023-08-30 02:44:17,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:44:17,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:44:17,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1063 transitions. [2023-08-30 02:44:17,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47118794326241137 [2023-08-30 02:44:17,486 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1063 transitions. [2023-08-30 02:44:17,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1063 transitions. [2023-08-30 02:44:17,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:17,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1063 transitions. [2023-08-30 02:44:17,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.875) internal successors, (1063), 8 states have internal predecessors, (1063), 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 02:44:17,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 282.0) internal successors, (2538), 9 states have internal predecessors, (2538), 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 02:44:17,493 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 282.0) internal successors, (2538), 9 states have internal predecessors, (2538), 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 02:44:17,493 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 228 flow. Second operand 8 states and 1063 transitions. [2023-08-30 02:44:17,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 91 transitions, 554 flow [2023-08-30 02:44:17,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 91 transitions, 492 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-30 02:44:17,505 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 222 flow [2023-08-30 02:44:17,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=222, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2023-08-30 02:44:17,508 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2023-08-30 02:44:17,508 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 222 flow [2023-08-30 02:44:17,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 124.85714285714286) internal successors, (874), 7 states have internal predecessors, (874), 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 02:44:17,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:17,509 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 02:44:17,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-30 02:44:17,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:17,719 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:17,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:17,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1505831346, now seen corresponding path program 1 times [2023-08-30 02:44:17,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:17,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840802508] [2023-08-30 02:44:17,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:17,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:17,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:17,721 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:44:17,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-30 02:44:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:17,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 02:44:17,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:18,460 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 02:44:18,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:18,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:18,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840802508] [2023-08-30 02:44:18,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840802508] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:18,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:18,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:44:18,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292567768] [2023-08-30 02:44:18,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:18,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:44:18,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:18,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:44:18,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:44:18,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 282 [2023-08-30 02:44:18,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 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 02:44:18,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:18,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 282 [2023-08-30 02:44:18,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:19,310 INFO L130 PetriNetUnfolder]: 855/1446 cut-off events. [2023-08-30 02:44:19,310 INFO L131 PetriNetUnfolder]: For 1694/1694 co-relation queries the response was YES. [2023-08-30 02:44:19,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3999 conditions, 1446 events. 855/1446 cut-off events. For 1694/1694 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7708 event pairs, 7 based on Foata normal form. 0/1430 useless extension candidates. Maximal degree in co-relation 3988. Up to 1043 conditions per place. [2023-08-30 02:44:19,319 INFO L137 encePairwiseOnDemand]: 277/282 looper letters, 57 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2023-08-30 02:44:19,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 67 transitions, 475 flow [2023-08-30 02:44:19,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:44:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:44:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 708 transitions. [2023-08-30 02:44:19,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41843971631205673 [2023-08-30 02:44:19,323 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 708 transitions. [2023-08-30 02:44:19,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 708 transitions. [2023-08-30 02:44:19,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:19,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 708 transitions. [2023-08-30 02:44:19,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 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 02:44:19,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 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 02:44:19,330 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 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 02:44:19,330 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 222 flow. Second operand 6 states and 708 transitions. [2023-08-30 02:44:19,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 67 transitions, 475 flow [2023-08-30 02:44:19,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 386 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-30 02:44:19,336 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 164 flow [2023-08-30 02:44:19,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-08-30 02:44:19,337 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2023-08-30 02:44:19,337 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 164 flow [2023-08-30 02:44:19,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 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 02:44:19,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:19,338 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 02:44:19,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-30 02:44:19,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:19,549 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:19,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:19,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1421116001, now seen corresponding path program 1 times [2023-08-30 02:44:19,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:19,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824876398] [2023-08-30 02:44:19,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:19,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:19,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:19,552 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:44:19,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-30 02:44:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:19,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:44:19,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:19,737 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 02:44:19,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:19,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:19,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824876398] [2023-08-30 02:44:19,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824876398] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:19,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:19,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:44:19,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641157520] [2023-08-30 02:44:19,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:19,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:44:19,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:19,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:44:19,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:44:19,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 282 [2023-08-30 02:44:19,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 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 02:44:19,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:19,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 282 [2023-08-30 02:44:19,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:20,055 INFO L130 PetriNetUnfolder]: 1263/2030 cut-off events. [2023-08-30 02:44:20,056 INFO L131 PetriNetUnfolder]: For 1187/1187 co-relation queries the response was YES. [2023-08-30 02:44:20,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5367 conditions, 2030 events. 1263/2030 cut-off events. For 1187/1187 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11181 event pairs, 158 based on Foata normal form. 1/2018 useless extension candidates. Maximal degree in co-relation 5359. Up to 1161 conditions per place. [2023-08-30 02:44:20,065 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 49 selfloop transitions, 1 changer transitions 32/87 dead transitions. [2023-08-30 02:44:20,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 87 transitions, 532 flow [2023-08-30 02:44:20,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:44:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:44:20,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 561 transitions. [2023-08-30 02:44:20,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973404255319149 [2023-08-30 02:44:20,069 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 561 transitions. [2023-08-30 02:44:20,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 561 transitions. [2023-08-30 02:44:20,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:20,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 561 transitions. [2023-08-30 02:44:20,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.25) internal successors, (561), 4 states have internal predecessors, (561), 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 02:44:20,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 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 02:44:20,073 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 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 02:44:20,073 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 164 flow. Second operand 4 states and 561 transitions. [2023-08-30 02:44:20,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 87 transitions, 532 flow [2023-08-30 02:44:20,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 87 transitions, 520 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:44:20,085 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 164 flow [2023-08-30 02:44:20,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-08-30 02:44:20,086 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2023-08-30 02:44:20,086 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 164 flow [2023-08-30 02:44:20,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 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 02:44:20,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:20,087 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 02:44:20,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-30 02:44:20,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:20,289 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:20,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:20,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2128435449, now seen corresponding path program 2 times [2023-08-30 02:44:20,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:20,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744738660] [2023-08-30 02:44:20,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:44:20,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:20,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:20,298 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:44:20,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-30 02:44:20,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:44:20,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:44:20,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-30 02:44:20,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:20,885 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 02:44:20,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:20,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:20,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744738660] [2023-08-30 02:44:20,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744738660] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:20,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:20,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 02:44:20,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099941971] [2023-08-30 02:44:20,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:20,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 02:44:20,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:20,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 02:44:20,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-08-30 02:44:20,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 282 [2023-08-30 02:44:20,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 164 flow. Second operand has 10 states, 10 states have (on average 127.4) internal successors, (1274), 10 states have internal predecessors, (1274), 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 02:44:20,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:20,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 282 [2023-08-30 02:44:20,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:21,381 INFO L130 PetriNetUnfolder]: 1584/2624 cut-off events. [2023-08-30 02:44:21,382 INFO L131 PetriNetUnfolder]: For 1881/1881 co-relation queries the response was YES. [2023-08-30 02:44:21,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7081 conditions, 2624 events. 1584/2624 cut-off events. For 1881/1881 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14687 event pairs, 515 based on Foata normal form. 1/2585 useless extension candidates. Maximal degree in co-relation 7071. Up to 1224 conditions per place. [2023-08-30 02:44:21,392 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 66 selfloop transitions, 7 changer transitions 13/91 dead transitions. [2023-08-30 02:44:21,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 91 transitions, 551 flow [2023-08-30 02:44:21,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:44:21,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:44:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 682 transitions. [2023-08-30 02:44:21,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4836879432624113 [2023-08-30 02:44:21,395 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 682 transitions. [2023-08-30 02:44:21,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 682 transitions. [2023-08-30 02:44:21,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:21,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 682 transitions. [2023-08-30 02:44:21,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 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 02:44:21,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 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 02:44:21,401 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 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 02:44:21,401 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 164 flow. Second operand 5 states and 682 transitions. [2023-08-30 02:44:21,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 91 transitions, 551 flow [2023-08-30 02:44:21,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 91 transitions, 547 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:44:21,417 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 201 flow [2023-08-30 02:44:21,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=201, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-08-30 02:44:21,419 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2023-08-30 02:44:21,419 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 201 flow [2023-08-30 02:44:21,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 127.4) internal successors, (1274), 10 states have internal predecessors, (1274), 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 02:44:21,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:21,420 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 02:44:21,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-30 02:44:21,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:21,631 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:21,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:21,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1913916181, now seen corresponding path program 3 times [2023-08-30 02:44:21,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:21,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761802732] [2023-08-30 02:44:21,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:44:21,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:21,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:21,634 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:44:21,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-30 02:44:21,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 02:44:21,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:44:21,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-30 02:44:21,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:22,310 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 02:44:22,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:22,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:22,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761802732] [2023-08-30 02:44:22,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761802732] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:22,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:22,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 02:44:22,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534411955] [2023-08-30 02:44:22,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:22,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 02:44:22,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:22,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 02:44:22,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 02:44:22,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 282 [2023-08-30 02:44:22,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 201 flow. Second operand has 10 states, 10 states have (on average 128.4) internal successors, (1284), 10 states have internal predecessors, (1284), 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 02:44:22,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:22,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 282 [2023-08-30 02:44:22,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:22,774 INFO L130 PetriNetUnfolder]: 1672/2716 cut-off events. [2023-08-30 02:44:22,775 INFO L131 PetriNetUnfolder]: For 2933/3019 co-relation queries the response was YES. [2023-08-30 02:44:22,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8698 conditions, 2716 events. 1672/2716 cut-off events. For 2933/3019 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14771 event pairs, 458 based on Foata normal form. 6/2682 useless extension candidates. Maximal degree in co-relation 8687. Up to 1180 conditions per place. [2023-08-30 02:44:22,789 INFO L137 encePairwiseOnDemand]: 276/282 looper letters, 67 selfloop transitions, 8 changer transitions 13/93 dead transitions. [2023-08-30 02:44:22,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 93 transitions, 596 flow [2023-08-30 02:44:22,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:44:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:44:22,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 687 transitions. [2023-08-30 02:44:22,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48723404255319147 [2023-08-30 02:44:22,792 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 687 transitions. [2023-08-30 02:44:22,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 687 transitions. [2023-08-30 02:44:22,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:22,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 687 transitions. [2023-08-30 02:44:22,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 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 02:44:22,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 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 02:44:22,797 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 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 02:44:22,797 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 201 flow. Second operand 5 states and 687 transitions. [2023-08-30 02:44:22,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 93 transitions, 596 flow [2023-08-30 02:44:22,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 591 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:44:22,819 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 230 flow [2023-08-30 02:44:22,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2023-08-30 02:44:22,820 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2023-08-30 02:44:22,820 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 230 flow [2023-08-30 02:44:22,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 128.4) internal successors, (1284), 10 states have internal predecessors, (1284), 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 02:44:22,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:22,821 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 02:44:22,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-30 02:44:23,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:23,032 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:23,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:23,032 INFO L85 PathProgramCache]: Analyzing trace with hash -47639801, now seen corresponding path program 4 times [2023-08-30 02:44:23,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:23,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92763935] [2023-08-30 02:44:23,033 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 02:44:23,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:23,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:23,034 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:44:23,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-30 02:44:23,156 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 02:44:23,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:44:23,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:44:23,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:23,199 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 02:44:23,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:23,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:23,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92763935] [2023-08-30 02:44:23,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92763935] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:23,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:23,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:44:23,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926751480] [2023-08-30 02:44:23,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:23,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:44:23,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:23,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:44:23,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:44:23,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 282 [2023-08-30 02:44:23,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 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 02:44:23,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:23,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 282 [2023-08-30 02:44:23,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:23,672 INFO L130 PetriNetUnfolder]: 2562/4361 cut-off events. [2023-08-30 02:44:23,672 INFO L131 PetriNetUnfolder]: For 5604/5720 co-relation queries the response was YES. [2023-08-30 02:44:23,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14314 conditions, 4361 events. 2562/4361 cut-off events. For 5604/5720 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 27258 event pairs, 508 based on Foata normal form. 45/4367 useless extension candidates. Maximal degree in co-relation 14302. Up to 2051 conditions per place. [2023-08-30 02:44:23,694 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 68 selfloop transitions, 2 changer transitions 21/97 dead transitions. [2023-08-30 02:44:23,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 97 transitions, 672 flow [2023-08-30 02:44:23,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:44:23,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:44:23,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 559 transitions. [2023-08-30 02:44:23,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49556737588652483 [2023-08-30 02:44:23,697 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 559 transitions. [2023-08-30 02:44:23,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 559 transitions. [2023-08-30 02:44:23,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:23,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 559 transitions. [2023-08-30 02:44:23,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 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 02:44:23,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 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 02:44:23,701 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 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 02:44:23,701 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 230 flow. Second operand 4 states and 559 transitions. [2023-08-30 02:44:23,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 97 transitions, 672 flow [2023-08-30 02:44:23,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 97 transitions, 662 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:44:23,754 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 238 flow [2023-08-30 02:44:23,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2023-08-30 02:44:23,755 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2023-08-30 02:44:23,755 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 238 flow [2023-08-30 02:44:23,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 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 02:44:23,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:23,756 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 02:44:23,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-30 02:44:23,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:23,967 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:23,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:23,968 INFO L85 PathProgramCache]: Analyzing trace with hash 462708111, now seen corresponding path program 5 times [2023-08-30 02:44:23,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:23,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977272873] [2023-08-30 02:44:23,968 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 02:44:23,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:23,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:23,970 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:44:23,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-30 02:44:24,096 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:44:24,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:44:24,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:44:24,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:24,140 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 02:44:24,141 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:24,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:24,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977272873] [2023-08-30 02:44:24,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977272873] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:24,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:24,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:44:24,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620360556] [2023-08-30 02:44:24,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:24,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:44:24,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:24,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:44:24,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:44:24,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 282 [2023-08-30 02:44:24,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 238 flow. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 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 02:44:24,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:24,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 282 [2023-08-30 02:44:24,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:24,659 INFO L130 PetriNetUnfolder]: 3940/6466 cut-off events. [2023-08-30 02:44:24,659 INFO L131 PetriNetUnfolder]: For 8887/8968 co-relation queries the response was YES. [2023-08-30 02:44:24,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22034 conditions, 6466 events. 3940/6466 cut-off events. For 8887/8968 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 41417 event pairs, 1462 based on Foata normal form. 77/6464 useless extension candidates. Maximal degree in co-relation 22020. Up to 2476 conditions per place. [2023-08-30 02:44:24,687 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 42 selfloop transitions, 1 changer transitions 46/95 dead transitions. [2023-08-30 02:44:24,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 95 transitions, 672 flow [2023-08-30 02:44:24,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:44:24,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:44:24,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 555 transitions. [2023-08-30 02:44:24,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4920212765957447 [2023-08-30 02:44:24,689 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 555 transitions. [2023-08-30 02:44:24,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 555 transitions. [2023-08-30 02:44:24,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:24,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 555 transitions. [2023-08-30 02:44:24,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 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 02:44:24,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 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 02:44:24,692 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 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 02:44:24,692 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 238 flow. Second operand 4 states and 555 transitions. [2023-08-30 02:44:24,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 95 transitions, 672 flow [2023-08-30 02:44:24,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 95 transitions, 670 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:44:24,817 INFO L231 Difference]: Finished difference. Result has 66 places, 45 transitions, 226 flow [2023-08-30 02:44:24,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=66, PETRI_TRANSITIONS=45} [2023-08-30 02:44:24,818 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 13 predicate places. [2023-08-30 02:44:24,818 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 45 transitions, 226 flow [2023-08-30 02:44:24,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 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 02:44:24,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:24,819 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 02:44:24,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-30 02:44:25,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:25,029 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:25,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:25,029 INFO L85 PathProgramCache]: Analyzing trace with hash 941658985, now seen corresponding path program 6 times [2023-08-30 02:44:25,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:25,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086508685] [2023-08-30 02:44:25,030 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 02:44:25,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:25,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:25,031 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:44:25,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-08-30 02:44:25,158 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-30 02:44:25,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:44:25,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-30 02:44:25,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:25,775 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 02:44:25,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:25,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:25,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086508685] [2023-08-30 02:44:25,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086508685] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:25,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:25,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 02:44:25,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719798621] [2023-08-30 02:44:25,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:25,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 02:44:25,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:25,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 02:44:25,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-08-30 02:44:25,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 282 [2023-08-30 02:44:25,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 45 transitions, 226 flow. Second operand has 10 states, 10 states have (on average 128.4) internal successors, (1284), 10 states have internal predecessors, (1284), 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 02:44:25,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:25,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 282 [2023-08-30 02:44:25,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:26,295 INFO L130 PetriNetUnfolder]: 1969/3308 cut-off events. [2023-08-30 02:44:26,296 INFO L131 PetriNetUnfolder]: For 5206/5367 co-relation queries the response was YES. [2023-08-30 02:44:26,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11521 conditions, 3308 events. 1969/3308 cut-off events. For 5206/5367 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 19160 event pairs, 602 based on Foata normal form. 21/3234 useless extension candidates. Maximal degree in co-relation 11505. Up to 1308 conditions per place. [2023-08-30 02:44:26,311 INFO L137 encePairwiseOnDemand]: 277/282 looper letters, 49 selfloop transitions, 3 changer transitions 36/93 dead transitions. [2023-08-30 02:44:26,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 93 transitions, 633 flow [2023-08-30 02:44:26,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:44:26,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:44:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 687 transitions. [2023-08-30 02:44:26,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48723404255319147 [2023-08-30 02:44:26,314 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 687 transitions. [2023-08-30 02:44:26,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 687 transitions. [2023-08-30 02:44:26,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:26,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 687 transitions. [2023-08-30 02:44:26,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 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 02:44:26,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 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 02:44:26,318 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 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 02:44:26,318 INFO L175 Difference]: Start difference. First operand has 66 places, 45 transitions, 226 flow. Second operand 5 states and 687 transitions. [2023-08-30 02:44:26,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 93 transitions, 633 flow [2023-08-30 02:44:26,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 93 transitions, 619 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 02:44:26,361 INFO L231 Difference]: Finished difference. Result has 65 places, 41 transitions, 195 flow [2023-08-30 02:44:26,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=65, PETRI_TRANSITIONS=41} [2023-08-30 02:44:26,362 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2023-08-30 02:44:26,362 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 41 transitions, 195 flow [2023-08-30 02:44:26,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 128.4) internal successors, (1284), 10 states have internal predecessors, (1284), 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 02:44:26,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:26,363 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 02:44:26,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-08-30 02:44:26,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:26,573 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:26,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:26,574 INFO L85 PathProgramCache]: Analyzing trace with hash 513787415, now seen corresponding path program 7 times [2023-08-30 02:44:26,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:26,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079453556] [2023-08-30 02:44:26,574 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 02:44:26,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:26,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:26,576 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:44:26,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-08-30 02:44:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:44:26,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:44:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:44:26,852 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:44:26,858 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:44:26,859 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:44:26,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:44:26,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:44:26,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:44:26,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:44:26,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:44:26,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:44:26,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:44:26,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:44:26,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:44:26,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:44:26,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:44:26,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:44:26,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:44:26,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:44:26,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:44:26,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-08-30 02:44:27,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:27,070 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:44:27,074 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:44:27,074 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:44:27,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:44:27 BasicIcfg [2023-08-30 02:44:27,157 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:44:27,157 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:44:27,157 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:44:27,163 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:44:27,163 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:44:01" (3/4) ... [2023-08-30 02:44:27,165 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:44:27,165 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:44:27,166 INFO L158 Benchmark]: Toolchain (without parser) took 26966.56ms. Allocated memory was 67.1MB in the beginning and 847.2MB in the end (delta: 780.1MB). Free memory was 42.9MB in the beginning and 243.5MB in the end (delta: -200.6MB). Peak memory consumption was 581.6MB. Max. memory is 16.1GB. [2023-08-30 02:44:27,166 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 67.1MB. Free memory was 44.5MB in the beginning and 44.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:44:27,166 INFO L158 Benchmark]: CACSL2BoogieTranslator took 666.59ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 42.7MB in the beginning and 64.1MB in the end (delta: -21.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 02:44:27,166 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.09ms. Allocated memory is still 96.5MB. Free memory was 64.1MB in the beginning and 61.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 02:44:27,166 INFO L158 Benchmark]: Boogie Preprocessor took 67.65ms. Allocated memory is still 96.5MB. Free memory was 61.4MB in the beginning and 58.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:44:27,167 INFO L158 Benchmark]: RCFGBuilder took 828.42ms. Allocated memory is still 96.5MB. Free memory was 58.9MB in the beginning and 62.1MB in the end (delta: -3.1MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2023-08-30 02:44:27,167 INFO L158 Benchmark]: TraceAbstraction took 25301.65ms. Allocated memory was 96.5MB in the beginning and 847.2MB in the end (delta: 750.8MB). Free memory was 61.5MB in the beginning and 243.5MB in the end (delta: -182.0MB). Peak memory consumption was 567.9MB. Max. memory is 16.1GB. [2023-08-30 02:44:27,167 INFO L158 Benchmark]: Witness Printer took 8.28ms. Allocated memory is still 847.2MB. Free memory is still 243.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:44:27,168 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.19ms. Allocated memory is still 67.1MB. Free memory was 44.5MB in the beginning and 44.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 666.59ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 42.7MB in the beginning and 64.1MB in the end (delta: -21.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.09ms. Allocated memory is still 96.5MB. Free memory was 64.1MB in the beginning and 61.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.65ms. Allocated memory is still 96.5MB. Free memory was 61.4MB in the beginning and 58.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 828.42ms. Allocated memory is still 96.5MB. Free memory was 58.9MB in the beginning and 62.1MB in the end (delta: -3.1MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * TraceAbstraction took 25301.65ms. Allocated memory was 96.5MB in the beginning and 847.2MB in the end (delta: 750.8MB). Free memory was 61.5MB in the beginning and 243.5MB in the end (delta: -182.0MB). Peak memory consumption was 567.9MB. Max. memory is 16.1GB. * Witness Printer took 8.28ms. Allocated memory is still 847.2MB. Free memory is still 243.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.3s, 153 PlacesBefore, 53 PlacesAfterwards, 142 TransitionsBefore, 40 TransitionsAfterwards, 3638 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 136 TotalNumberOfCompositions, 11021 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4641, independent: 4377, independent conditional: 0, independent unconditional: 4377, dependent: 264, dependent conditional: 0, dependent unconditional: 264, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1939, independent: 1874, independent conditional: 0, independent unconditional: 1874, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4641, independent: 2503, independent conditional: 0, independent unconditional: 2503, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 1939, unknown conditional: 0, unknown unconditional: 1939] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 182, Positive conditional cache size: 0, Positive unconditional cache size: 182, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t145; [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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(&t145, ((void *)0), P0, ((void *)0))=0, t145={-2145385485: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=0] [L860] 0 pthread_t t146; [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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(&t146, ((void *)0), P1, ((void *)0))=1, t145={-2145385485:0}, t146={-2145385481: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=0] [L862] 0 pthread_t t147; [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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(&t147, ((void *)0), P2, ((void *)0))=2, t145={-2145385485:0}, t146={-2145385481:0}, t147={2098175: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=0] [L864] 0 pthread_t t148; [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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(&t148, ((void *)0), P3, ((void *)0))=3, t145={-2145385485:0}, t146={-2145385481:0}, t147={2098175:0}, t148={-2145385473: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=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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$$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=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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$$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=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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$$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=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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$$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=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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$$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=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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$$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=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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$$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=1, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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$$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=1, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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$$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=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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$$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=1, y=1, z=1] [L760] 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) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 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 [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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$$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=1, y=1, z=1] [L813] 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) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 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 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 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 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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$$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=1, y=1, z=1] [L836] 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) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 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 [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 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 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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$$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=1, y=1, z=1] [L790] 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) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 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 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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$$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=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 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) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 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 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 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 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=1, main$tmp_guard1=0, t145={-2145385485:0}, t146={-2145385481:0}, t147={2098175:0}, t148={-2145385473: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=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 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) [L883] 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)) [L884] 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)) [L885] 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)) [L886] 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)) [L887] 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)) [L888] 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)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, 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=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 859]: 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: 865]: 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: 861]: 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, 184 locations, 16 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: 25.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 760 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 637 mSDsluCounter, 336 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 306 mSDsCounter, 238 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2714 IncrementalHoareTripleChecker+Invalid, 2952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 238 mSolverCounterUnsat, 30 mSDtfsCounter, 2714 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=11, InterpolantAutomatonStates: 64, 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.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 307 NumberOfCodeBlocks, 307 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 265 ConstructedInterpolants, 12 QuantifiedInterpolants, 3177 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2198 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 could not prove your program: unable to determine feasibility of some traces [2023-08-30 02:44:27,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample