./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 02:47:37,999 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 02:47:38,001 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 02:47:38,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 02:47:38,033 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 02:47:38,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 02:47:38,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 02:47:38,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 02:47:38,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 02:47:38,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 02:47:38,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 02:47:38,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 02:47:38,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 02:47:38,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 02:47:38,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 02:47:38,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 02:47:38,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 02:47:38,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 02:47:38,052 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 02:47:38,054 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 02:47:38,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 02:47:38,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 02:47:38,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 02:47:38,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 02:47:38,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 02:47:38,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 02:47:38,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 02:47:38,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 02:47:38,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 02:47:38,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 02:47:38,065 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 02:47:38,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 02:47:38,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 02:47:38,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 02:47:38,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 02:47:38,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 02:47:38,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 02:47:38,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 02:47:38,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 02:47:38,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 02:47:38,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 02:47:38,071 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 02:47:38,096 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 02:47:38,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 02:47:38,096 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 02:47:38,097 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 02:47:38,097 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 02:47:38,097 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 02:47:38,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 02:47:38,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 02:47:38,098 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 02:47:38,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 02:47:38,099 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 02:47:38,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 02:47:38,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 02:47:38,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 02:47:38,099 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 02:47:38,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 02:47:38,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 02:47:38,100 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 02:47:38,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 02:47:38,100 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 02:47:38,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 02:47:38,100 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 02:47:38,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 02:47:38,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 02:47:38,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 02:47:38,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 02:47:38,101 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 02:47:38,101 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 02:47:38,102 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 02:47:38,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 02:47:38,102 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 02:47:38,102 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 02:47:38,102 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 02:47:38,102 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 02:47:38,103 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 [2021-12-16 02:47:38,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 02:47:38,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 02:47:38,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 02:47:38,307 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 02:47:38,307 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 02:47:38,308 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2021-12-16 02:47:38,374 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61f640d98/1ae966a214e24392930927784df6a3c6/FLAG3497301d9 [2021-12-16 02:47:38,787 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 02:47:38,789 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2021-12-16 02:47:38,803 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61f640d98/1ae966a214e24392930927784df6a3c6/FLAG3497301d9 [2021-12-16 02:47:38,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61f640d98/1ae966a214e24392930927784df6a3c6 [2021-12-16 02:47:38,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 02:47:38,814 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 02:47:38,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 02:47:38,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 02:47:38,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 02:47:38,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:47:38" (1/1) ... [2021-12-16 02:47:38,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b1c96ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:47:38, skipping insertion in model container [2021-12-16 02:47:38,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:47:38" (1/1) ... [2021-12-16 02:47:38,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 02:47:38,887 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 02:47:39,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i[1001,1014] [2021-12-16 02:47:39,163 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 02:47:39,173 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 02:47:39,183 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i[1001,1014] [2021-12-16 02:47:39,212 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 02:47:39,237 INFO L208 MainTranslator]: Completed translation [2021-12-16 02:47:39,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:47:39 WrapperNode [2021-12-16 02:47:39,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 02:47:39,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 02:47:39,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 02:47:39,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 02:47:39,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:47:39" (1/1) ... [2021-12-16 02:47:39,273 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:47:39" (1/1) ... [2021-12-16 02:47:39,305 INFO L137 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 193 [2021-12-16 02:47:39,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 02:47:39,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 02:47:39,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 02:47:39,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 02:47:39,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:47:39" (1/1) ... [2021-12-16 02:47:39,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:47:39" (1/1) ... [2021-12-16 02:47:39,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:47:39" (1/1) ... [2021-12-16 02:47:39,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:47:39" (1/1) ... [2021-12-16 02:47:39,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:47:39" (1/1) ... [2021-12-16 02:47:39,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:47:39" (1/1) ... [2021-12-16 02:47:39,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:47:39" (1/1) ... [2021-12-16 02:47:39,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 02:47:39,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 02:47:39,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 02:47:39,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 02:47:39,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:47:39" (1/1) ... [2021-12-16 02:47:39,373 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 02:47:39,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:47:39,396 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) [2021-12-16 02:47:39,403 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 [2021-12-16 02:47:39,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 02:47:39,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-16 02:47:39,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 02:47:39,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 02:47:39,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 02:47:39,422 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-16 02:47:39,422 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-16 02:47:39,422 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-16 02:47:39,422 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-16 02:47:39,422 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-16 02:47:39,422 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-16 02:47:39,423 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-12-16 02:47:39,423 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-12-16 02:47:39,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 02:47:39,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-16 02:47:39,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 02:47:39,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 02:47:39,425 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-16 02:47:39,538 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 02:47:39,544 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 02:47:39,905 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 02:47:40,120 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 02:47:40,120 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-16 02:47:40,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:47:40 BoogieIcfgContainer [2021-12-16 02:47:40,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 02:47:40,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 02:47:40,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 02:47:40,126 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 02:47:40,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 02:47:38" (1/3) ... [2021-12-16 02:47:40,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e72b7da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:47:40, skipping insertion in model container [2021-12-16 02:47:40,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:47:39" (2/3) ... [2021-12-16 02:47:40,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e72b7da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:47:40, skipping insertion in model container [2021-12-16 02:47:40,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:47:40" (3/3) ... [2021-12-16 02:47:40,128 INFO L111 eAbstractionObserver]: Analyzing ICFG mix026_power.opt_tso.opt.i [2021-12-16 02:47:40,132 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-16 02:47:40,132 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 02:47:40,132 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-16 02:47:40,132 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-16 02:47:40,171 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,172 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,172 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,172 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,172 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,172 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,172 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,173 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,173 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,173 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,173 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,174 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,174 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,174 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,174 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,174 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,175 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,175 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,175 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,175 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,191 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,192 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,192 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,192 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,192 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,193 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,193 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,193 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,193 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,193 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,193 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,193 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,193 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,194 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,194 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,194 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,194 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,194 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,194 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,194 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,194 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,195 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,195 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,195 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,195 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,195 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,196 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,197 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,197 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,197 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,197 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,197 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,197 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,197 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,198 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,198 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,198 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,198 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,198 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,198 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,198 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,198 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,198 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,199 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,199 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,199 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,199 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,199 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,199 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,199 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,199 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,199 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,199 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,199 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,199 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,200 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,200 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,200 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,200 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,200 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,200 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,200 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,200 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,200 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,203 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,203 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,203 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,203 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,204 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,204 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,204 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,204 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,204 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,204 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,204 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,205 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,205 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,205 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,205 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,205 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,205 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,205 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,206 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,206 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,206 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,206 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,206 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,206 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,206 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,207 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,207 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,207 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,207 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,207 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,207 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,207 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,208 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,208 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,208 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,208 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,208 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,208 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,209 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,209 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,209 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,209 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,210 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,210 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,210 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,210 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,210 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,210 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,210 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,211 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,211 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,211 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,211 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,211 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,211 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,211 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,212 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,212 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,212 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,212 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,212 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,212 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,213 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,213 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,213 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,214 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,214 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,215 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,215 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,215 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,215 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,215 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,215 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,215 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,216 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,216 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,216 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,216 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,216 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,216 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,216 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,217 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,217 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,217 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,217 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,217 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,217 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,217 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,218 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,218 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,221 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,222 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,222 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,222 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,222 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,222 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,222 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,222 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,223 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,223 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,224 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,224 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,224 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,224 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,224 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,224 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,225 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,225 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,225 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,225 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,225 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,225 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,226 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,226 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,226 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,226 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,226 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,226 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,226 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,227 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,227 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,227 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,230 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,230 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,230 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,230 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,231 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,231 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,231 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,231 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,231 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,235 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,236 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,236 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,236 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,236 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,236 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,236 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,236 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,236 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,237 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,237 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,237 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,237 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,237 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,237 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,237 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,237 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,238 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:47:40,238 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-16 02:47:40,272 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 02:47:40,277 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-16 02:47:40,277 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-16 02:47:40,287 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2021-12-16 02:47:40,327 INFO L129 PetriNetUnfolder]: 2/133 cut-off events. [2021-12-16 02:47:40,327 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-16 02:47:40,330 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2021-12-16 02:47:40,330 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2021-12-16 02:47:40,335 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2021-12-16 02:47:40,356 INFO L129 PetriNetUnfolder]: 0/65 cut-off events. [2021-12-16 02:47:40,356 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-16 02:47:40,356 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:47:40,357 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:47:40,358 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:47:40,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:47:40,364 INFO L85 PathProgramCache]: Analyzing trace with hash -535244527, now seen corresponding path program 1 times [2021-12-16 02:47:40,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:47:40,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945397850] [2021-12-16 02:47:40,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:47:40,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:47:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:47:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:47:40,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:47:40,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945397850] [2021-12-16 02:47:40,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945397850] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:47:40,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:47:40,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 02:47:40,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875667116] [2021-12-16 02:47:40,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:47:40,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:47:40,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:47:40,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:47:40,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 02:47:40,652 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 137 [2021-12-16 02:47:40,655 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 133 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:40,655 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:47:40,656 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 137 [2021-12-16 02:47:40,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:47:40,833 INFO L129 PetriNetUnfolder]: 109/538 cut-off events. [2021-12-16 02:47:40,833 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-12-16 02:47:40,838 INFO L84 FinitePrefix]: Finished finitePrefix Result has 764 conditions, 538 events. 109/538 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2717 event pairs, 67 based on Foata normal form. 22/515 useless extension candidates. Maximal degree in co-relation 706. Up to 131 conditions per place. [2021-12-16 02:47:40,841 INFO L132 encePairwiseOnDemand]: 132/137 looper letters, 15 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2021-12-16 02:47:40,841 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 135 transitions, 322 flow [2021-12-16 02:47:40,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:47:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-16 02:47:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2021-12-16 02:47:40,855 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9440389294403893 [2021-12-16 02:47:40,855 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2021-12-16 02:47:40,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2021-12-16 02:47:40,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:47:40,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2021-12-16 02:47:40,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:40,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:40,872 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:40,873 INFO L186 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 3 states and 388 transitions. [2021-12-16 02:47:40,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 135 transitions, 322 flow [2021-12-16 02:47:40,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 135 transitions, 316 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-16 02:47:40,879 INFO L242 Difference]: Finished difference. Result has 140 places, 129 transitions, 270 flow [2021-12-16 02:47:40,881 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2021-12-16 02:47:40,884 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2021-12-16 02:47:40,885 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 270 flow [2021-12-16 02:47:40,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:40,885 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:47:40,885 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:47:40,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 02:47:40,886 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:47:40,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:47:40,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1888786753, now seen corresponding path program 1 times [2021-12-16 02:47:40,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:47:40,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036331692] [2021-12-16 02:47:40,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:47:40,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:47:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:47:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:47:41,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:47:41,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036331692] [2021-12-16 02:47:41,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036331692] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:47:41,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:47:41,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:47:41,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712326960] [2021-12-16 02:47:41,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:47:41,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:47:41,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:47:41,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:47:41,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:47:41,103 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2021-12-16 02:47:41,104 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:41,104 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:47:41,104 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2021-12-16 02:47:41,105 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:47:42,620 INFO L129 PetriNetUnfolder]: 4676/10347 cut-off events. [2021-12-16 02:47:42,627 INFO L130 PetriNetUnfolder]: For 482/482 co-relation queries the response was YES. [2021-12-16 02:47:42,656 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17515 conditions, 10347 events. 4676/10347 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 93874 event pairs, 530 based on Foata normal form. 0/10131 useless extension candidates. Maximal degree in co-relation 17454. Up to 2267 conditions per place. [2021-12-16 02:47:42,685 INFO L132 encePairwiseOnDemand]: 127/137 looper letters, 39 selfloop transitions, 6 changer transitions 98/232 dead transitions. [2021-12-16 02:47:42,685 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 232 transitions, 758 flow [2021-12-16 02:47:42,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 02:47:42,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-16 02:47:42,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1511 transitions. [2021-12-16 02:47:42,689 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8483997754070747 [2021-12-16 02:47:42,691 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1511 transitions. [2021-12-16 02:47:42,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1511 transitions. [2021-12-16 02:47:42,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:47:42,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1511 transitions. [2021-12-16 02:47:42,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 116.23076923076923) internal successors, (1511), 13 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:42,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:42,698 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:42,699 INFO L186 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 13 states and 1511 transitions. [2021-12-16 02:47:42,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 232 transitions, 758 flow [2021-12-16 02:47:42,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 232 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-16 02:47:42,705 INFO L242 Difference]: Finished difference. Result has 162 places, 119 transitions, 324 flow [2021-12-16 02:47:42,706 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=324, PETRI_PLACES=162, PETRI_TRANSITIONS=119} [2021-12-16 02:47:42,706 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 18 predicate places. [2021-12-16 02:47:42,706 INFO L470 AbstractCegarLoop]: Abstraction has has 162 places, 119 transitions, 324 flow [2021-12-16 02:47:42,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:42,707 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:47:42,707 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:47:42,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 02:47:42,708 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:47:42,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:47:42,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1319086192, now seen corresponding path program 1 times [2021-12-16 02:47:42,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:47:42,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409069640] [2021-12-16 02:47:42,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:47:42,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:47:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:47:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:47:42,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:47:42,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409069640] [2021-12-16 02:47:42,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409069640] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:47:42,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:47:42,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 02:47:42,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615892112] [2021-12-16 02:47:42,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:47:42,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 02:47:42,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:47:42,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 02:47:42,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 02:47:42,871 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2021-12-16 02:47:42,872 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 119 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:42,872 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:47:42,872 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2021-12-16 02:47:42,872 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:47:44,089 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L795-->L802: Formula: (let ((.cse12 (= 0 (mod v_~x$w_buff0_used~0_392 256))) (.cse3 (= 0 (mod v_~x$r_buff1_thd2~0_60 256))) (.cse14 (= 0 (mod v_~x$w_buff1_used~0_296 256))) (.cse13 (= 0 (mod v_~x$r_buff0_thd2~0_79 256))) (.cse0 (= 0 (mod v_~x$w_buff0_used~0_391 256)))) (let ((.cse4 (not .cse0)) (.cse7 (or .cse0 .cse13)) (.cse8 (not .cse14)) (.cse5 (not .cse3)) (.cse9 (or .cse14 .cse3)) (.cse11 (or .cse12 .cse13)) (.cse6 (not .cse13)) (.cse10 (not .cse12))) (and (let ((.cse1 (= 0 (mod v_~x$r_buff0_thd2~0_78 256))) (.cse2 (= 0 (mod v_~x$w_buff1_used~0_295 256)))) (or (and (= v_~x$r_buff1_thd2~0_59 v_~x$r_buff1_thd2~0_60) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= v_~x$r_buff1_thd2~0_59 0) (or (and (not .cse1) .cse4) (and (not .cse2) .cse5))))) (or (and (= v_~x$r_buff0_thd2~0_78 0) .cse6 .cse4) (and (= v_~x$r_buff0_thd2~0_78 v_~x$r_buff0_thd2~0_79) .cse7)) (or (and (= v_~x$w_buff1_used~0_295 0) (or (and .cse8 .cse5) (and .cse6 .cse4))) (and (= v_~x$w_buff1_used~0_295 v_~x$w_buff1_used~0_296) .cse9 .cse7)) (or (and (= v_~x~0_110 v_~x$w_buff0~0_80) .cse6 .cse10 (= |v_P1Thread1of1ForFork1_#t~ite26#1_1| |v_P1_#t~ite26#1_29|)) (and .cse11 (or (and .cse8 .cse5 (= |v_P1_#t~ite26#1_29| v_~x$w_buff1~0_97)) (and .cse9 (= |v_P1_#t~ite26#1_29| v_~x~0_111))) (= v_~x~0_110 |v_P1_#t~ite26#1_29|))) (or (and .cse11 (= v_~x$w_buff0_used~0_391 v_~x$w_buff0_used~0_392)) (and .cse6 (= v_~x$w_buff0_used~0_391 0) .cse10))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_80, ~x$w_buff1~0=v_~x$w_buff1~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_60, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_296, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_79, ~x~0=v_~x~0_111, P1Thread1of1ForFork1_#t~ite26#1=|v_P1Thread1of1ForFork1_#t~ite26#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_392} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_80, P1Thread1of1ForFork1_#t~ite31#1=|v_P1Thread1of1ForFork1_#t~ite31#1_1|, ~x$w_buff1~0=v_~x$w_buff1~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_295, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_78, P1Thread1of1ForFork1_#t~ite28#1=|v_P1Thread1of1ForFork1_#t~ite28#1_1|, P1Thread1of1ForFork1_#t~ite26#1=|v_P1Thread1of1ForFork1_#t~ite26#1_2|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_391, P1Thread1of1ForFork1_#t~ite29#1=|v_P1Thread1of1ForFork1_#t~ite29#1_1|, P1Thread1of1ForFork1_#t~ite30#1=|v_P1Thread1of1ForFork1_#t~ite30#1_1|, ~x~0=v_~x~0_110, P1Thread1of1ForFork1_#t~ite27#1=|v_P1Thread1of1ForFork1_#t~ite27#1_1|} AuxVars[|v_P1_#t~ite26#1_29|] AssignedVars[P1Thread1of1ForFork1_#t~ite31#1, P1Thread1of1ForFork1_#t~ite29#1, P1Thread1of1ForFork1_#t~ite30#1, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28#1, ~x~0, P1Thread1of1ForFork1_#t~ite26#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1_#t~ite27#1][140], [132#L838true, 191#true, 155#true, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, Black: 171#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), P2Thread1of1ForFork2InUse, Black: 177#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), Black: 175#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), 85#L872true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), P1Thread1of1ForFork1InUse, Black: 165#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), Black: 169#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~main$tmp_guard1~0)), 123#L775true, 46#L825true, Black: 173#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), 129#L802true, Black: 167#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), Black: 163#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0)))]) [2021-12-16 02:47:44,090 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2021-12-16 02:47:44,090 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-16 02:47:44,090 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-16 02:47:44,090 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-16 02:47:44,454 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L795-->L802: Formula: (let ((.cse12 (= 0 (mod v_~x$w_buff0_used~0_392 256))) (.cse3 (= 0 (mod v_~x$r_buff1_thd2~0_60 256))) (.cse14 (= 0 (mod v_~x$w_buff1_used~0_296 256))) (.cse13 (= 0 (mod v_~x$r_buff0_thd2~0_79 256))) (.cse0 (= 0 (mod v_~x$w_buff0_used~0_391 256)))) (let ((.cse4 (not .cse0)) (.cse7 (or .cse0 .cse13)) (.cse8 (not .cse14)) (.cse5 (not .cse3)) (.cse9 (or .cse14 .cse3)) (.cse11 (or .cse12 .cse13)) (.cse6 (not .cse13)) (.cse10 (not .cse12))) (and (let ((.cse1 (= 0 (mod v_~x$r_buff0_thd2~0_78 256))) (.cse2 (= 0 (mod v_~x$w_buff1_used~0_295 256)))) (or (and (= v_~x$r_buff1_thd2~0_59 v_~x$r_buff1_thd2~0_60) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= v_~x$r_buff1_thd2~0_59 0) (or (and (not .cse1) .cse4) (and (not .cse2) .cse5))))) (or (and (= v_~x$r_buff0_thd2~0_78 0) .cse6 .cse4) (and (= v_~x$r_buff0_thd2~0_78 v_~x$r_buff0_thd2~0_79) .cse7)) (or (and (= v_~x$w_buff1_used~0_295 0) (or (and .cse8 .cse5) (and .cse6 .cse4))) (and (= v_~x$w_buff1_used~0_295 v_~x$w_buff1_used~0_296) .cse9 .cse7)) (or (and (= v_~x~0_110 v_~x$w_buff0~0_80) .cse6 .cse10 (= |v_P1Thread1of1ForFork1_#t~ite26#1_1| |v_P1_#t~ite26#1_29|)) (and .cse11 (or (and .cse8 .cse5 (= |v_P1_#t~ite26#1_29| v_~x$w_buff1~0_97)) (and .cse9 (= |v_P1_#t~ite26#1_29| v_~x~0_111))) (= v_~x~0_110 |v_P1_#t~ite26#1_29|))) (or (and .cse11 (= v_~x$w_buff0_used~0_391 v_~x$w_buff0_used~0_392)) (and .cse6 (= v_~x$w_buff0_used~0_391 0) .cse10))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_80, ~x$w_buff1~0=v_~x$w_buff1~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_60, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_296, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_79, ~x~0=v_~x~0_111, P1Thread1of1ForFork1_#t~ite26#1=|v_P1Thread1of1ForFork1_#t~ite26#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_392} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_80, P1Thread1of1ForFork1_#t~ite31#1=|v_P1Thread1of1ForFork1_#t~ite31#1_1|, ~x$w_buff1~0=v_~x$w_buff1~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_295, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_78, P1Thread1of1ForFork1_#t~ite28#1=|v_P1Thread1of1ForFork1_#t~ite28#1_1|, P1Thread1of1ForFork1_#t~ite26#1=|v_P1Thread1of1ForFork1_#t~ite26#1_2|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_391, P1Thread1of1ForFork1_#t~ite29#1=|v_P1Thread1of1ForFork1_#t~ite29#1_1|, P1Thread1of1ForFork1_#t~ite30#1=|v_P1Thread1of1ForFork1_#t~ite30#1_1|, ~x~0=v_~x~0_110, P1Thread1of1ForFork1_#t~ite27#1=|v_P1Thread1of1ForFork1_#t~ite27#1_1|} AuxVars[|v_P1_#t~ite26#1_29|] AssignedVars[P1Thread1of1ForFork1_#t~ite31#1, P1Thread1of1ForFork1_#t~ite29#1, P1Thread1of1ForFork1_#t~ite30#1, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28#1, ~x~0, P1Thread1of1ForFork1_#t~ite26#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1_#t~ite27#1][140], [132#L838true, 191#true, 155#true, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, Black: 171#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), P2Thread1of1ForFork2InUse, 74#L873-1true, Black: 177#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), Black: 175#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), Black: 157#(= ~__unbuffered_p3_EAX~0 0), P1Thread1of1ForFork1InUse, Black: 165#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), Black: 169#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), 123#L775true, Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~main$tmp_guard1~0)), 46#L825true, Black: 173#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), 129#L802true, Black: 167#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), Black: 163#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0)))]) [2021-12-16 02:47:44,454 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2021-12-16 02:47:44,454 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-16 02:47:44,455 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-16 02:47:44,455 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-16 02:47:44,637 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L795-->L802: Formula: (let ((.cse12 (= 0 (mod v_~x$w_buff0_used~0_392 256))) (.cse3 (= 0 (mod v_~x$r_buff1_thd2~0_60 256))) (.cse14 (= 0 (mod v_~x$w_buff1_used~0_296 256))) (.cse13 (= 0 (mod v_~x$r_buff0_thd2~0_79 256))) (.cse0 (= 0 (mod v_~x$w_buff0_used~0_391 256)))) (let ((.cse4 (not .cse0)) (.cse7 (or .cse0 .cse13)) (.cse8 (not .cse14)) (.cse5 (not .cse3)) (.cse9 (or .cse14 .cse3)) (.cse11 (or .cse12 .cse13)) (.cse6 (not .cse13)) (.cse10 (not .cse12))) (and (let ((.cse1 (= 0 (mod v_~x$r_buff0_thd2~0_78 256))) (.cse2 (= 0 (mod v_~x$w_buff1_used~0_295 256)))) (or (and (= v_~x$r_buff1_thd2~0_59 v_~x$r_buff1_thd2~0_60) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= v_~x$r_buff1_thd2~0_59 0) (or (and (not .cse1) .cse4) (and (not .cse2) .cse5))))) (or (and (= v_~x$r_buff0_thd2~0_78 0) .cse6 .cse4) (and (= v_~x$r_buff0_thd2~0_78 v_~x$r_buff0_thd2~0_79) .cse7)) (or (and (= v_~x$w_buff1_used~0_295 0) (or (and .cse8 .cse5) (and .cse6 .cse4))) (and (= v_~x$w_buff1_used~0_295 v_~x$w_buff1_used~0_296) .cse9 .cse7)) (or (and (= v_~x~0_110 v_~x$w_buff0~0_80) .cse6 .cse10 (= |v_P1Thread1of1ForFork1_#t~ite26#1_1| |v_P1_#t~ite26#1_29|)) (and .cse11 (or (and .cse8 .cse5 (= |v_P1_#t~ite26#1_29| v_~x$w_buff1~0_97)) (and .cse9 (= |v_P1_#t~ite26#1_29| v_~x~0_111))) (= v_~x~0_110 |v_P1_#t~ite26#1_29|))) (or (and .cse11 (= v_~x$w_buff0_used~0_391 v_~x$w_buff0_used~0_392)) (and .cse6 (= v_~x$w_buff0_used~0_391 0) .cse10))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_80, ~x$w_buff1~0=v_~x$w_buff1~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_60, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_296, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_79, ~x~0=v_~x~0_111, P1Thread1of1ForFork1_#t~ite26#1=|v_P1Thread1of1ForFork1_#t~ite26#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_392} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_80, P1Thread1of1ForFork1_#t~ite31#1=|v_P1Thread1of1ForFork1_#t~ite31#1_1|, ~x$w_buff1~0=v_~x$w_buff1~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_295, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_78, P1Thread1of1ForFork1_#t~ite28#1=|v_P1Thread1of1ForFork1_#t~ite28#1_1|, P1Thread1of1ForFork1_#t~ite26#1=|v_P1Thread1of1ForFork1_#t~ite26#1_2|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_391, P1Thread1of1ForFork1_#t~ite29#1=|v_P1Thread1of1ForFork1_#t~ite29#1_1|, P1Thread1of1ForFork1_#t~ite30#1=|v_P1Thread1of1ForFork1_#t~ite30#1_1|, ~x~0=v_~x~0_110, P1Thread1of1ForFork1_#t~ite27#1=|v_P1Thread1of1ForFork1_#t~ite27#1_1|} AuxVars[|v_P1_#t~ite26#1_29|] AssignedVars[P1Thread1of1ForFork1_#t~ite31#1, P1Thread1of1ForFork1_#t~ite29#1, P1Thread1of1ForFork1_#t~ite30#1, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28#1, ~x~0, P1Thread1of1ForFork1_#t~ite26#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1_#t~ite27#1][140], [132#L838true, 191#true, 155#true, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, Black: 171#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), P2Thread1of1ForFork2InUse, Black: 177#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), Black: 175#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), Black: 157#(= ~__unbuffered_p3_EAX~0 0), P1Thread1of1ForFork1InUse, Black: 165#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), Black: 169#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), 123#L775true, Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~main$tmp_guard1~0)), 64#L3true, 46#L825true, Black: 173#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), 129#L802true, Black: 167#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), Black: 163#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0)))]) [2021-12-16 02:47:44,640 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-12-16 02:47:44,640 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-16 02:47:44,640 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-16 02:47:44,640 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-16 02:47:44,744 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L795-->L802: Formula: (let ((.cse12 (= 0 (mod v_~x$w_buff0_used~0_392 256))) (.cse3 (= 0 (mod v_~x$r_buff1_thd2~0_60 256))) (.cse14 (= 0 (mod v_~x$w_buff1_used~0_296 256))) (.cse13 (= 0 (mod v_~x$r_buff0_thd2~0_79 256))) (.cse0 (= 0 (mod v_~x$w_buff0_used~0_391 256)))) (let ((.cse4 (not .cse0)) (.cse7 (or .cse0 .cse13)) (.cse8 (not .cse14)) (.cse5 (not .cse3)) (.cse9 (or .cse14 .cse3)) (.cse11 (or .cse12 .cse13)) (.cse6 (not .cse13)) (.cse10 (not .cse12))) (and (let ((.cse1 (= 0 (mod v_~x$r_buff0_thd2~0_78 256))) (.cse2 (= 0 (mod v_~x$w_buff1_used~0_295 256)))) (or (and (= v_~x$r_buff1_thd2~0_59 v_~x$r_buff1_thd2~0_60) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= v_~x$r_buff1_thd2~0_59 0) (or (and (not .cse1) .cse4) (and (not .cse2) .cse5))))) (or (and (= v_~x$r_buff0_thd2~0_78 0) .cse6 .cse4) (and (= v_~x$r_buff0_thd2~0_78 v_~x$r_buff0_thd2~0_79) .cse7)) (or (and (= v_~x$w_buff1_used~0_295 0) (or (and .cse8 .cse5) (and .cse6 .cse4))) (and (= v_~x$w_buff1_used~0_295 v_~x$w_buff1_used~0_296) .cse9 .cse7)) (or (and (= v_~x~0_110 v_~x$w_buff0~0_80) .cse6 .cse10 (= |v_P1Thread1of1ForFork1_#t~ite26#1_1| |v_P1_#t~ite26#1_29|)) (and .cse11 (or (and .cse8 .cse5 (= |v_P1_#t~ite26#1_29| v_~x$w_buff1~0_97)) (and .cse9 (= |v_P1_#t~ite26#1_29| v_~x~0_111))) (= v_~x~0_110 |v_P1_#t~ite26#1_29|))) (or (and .cse11 (= v_~x$w_buff0_used~0_391 v_~x$w_buff0_used~0_392)) (and .cse6 (= v_~x$w_buff0_used~0_391 0) .cse10))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_80, ~x$w_buff1~0=v_~x$w_buff1~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_60, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_296, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_79, ~x~0=v_~x~0_111, P1Thread1of1ForFork1_#t~ite26#1=|v_P1Thread1of1ForFork1_#t~ite26#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_392} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_80, P1Thread1of1ForFork1_#t~ite31#1=|v_P1Thread1of1ForFork1_#t~ite31#1_1|, ~x$w_buff1~0=v_~x$w_buff1~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_295, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_78, P1Thread1of1ForFork1_#t~ite28#1=|v_P1Thread1of1ForFork1_#t~ite28#1_1|, P1Thread1of1ForFork1_#t~ite26#1=|v_P1Thread1of1ForFork1_#t~ite26#1_2|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_391, P1Thread1of1ForFork1_#t~ite29#1=|v_P1Thread1of1ForFork1_#t~ite29#1_1|, P1Thread1of1ForFork1_#t~ite30#1=|v_P1Thread1of1ForFork1_#t~ite30#1_1|, ~x~0=v_~x~0_110, P1Thread1of1ForFork1_#t~ite27#1=|v_P1Thread1of1ForFork1_#t~ite27#1_1|} AuxVars[|v_P1_#t~ite26#1_29|] AssignedVars[P1Thread1of1ForFork1_#t~ite31#1, P1Thread1of1ForFork1_#t~ite29#1, P1Thread1of1ForFork1_#t~ite30#1, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28#1, ~x~0, P1Thread1of1ForFork1_#t~ite26#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1_#t~ite27#1][140], [132#L838true, 86#L4true, 191#true, 155#true, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, Black: 171#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), P2Thread1of1ForFork2InUse, Black: 177#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), Black: 175#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), Black: 157#(= ~__unbuffered_p3_EAX~0 0), P1Thread1of1ForFork1InUse, Black: 165#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), Black: 169#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~main$tmp_guard1~0)), 123#L775true, 46#L825true, Black: 173#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), 129#L802true, Black: 167#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), Black: 163#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0)))]) [2021-12-16 02:47:44,745 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2021-12-16 02:47:44,745 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-16 02:47:44,745 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-16 02:47:44,745 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-16 02:47:44,827 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L795-->L802: Formula: (let ((.cse12 (= 0 (mod v_~x$w_buff0_used~0_392 256))) (.cse3 (= 0 (mod v_~x$r_buff1_thd2~0_60 256))) (.cse14 (= 0 (mod v_~x$w_buff1_used~0_296 256))) (.cse13 (= 0 (mod v_~x$r_buff0_thd2~0_79 256))) (.cse0 (= 0 (mod v_~x$w_buff0_used~0_391 256)))) (let ((.cse4 (not .cse0)) (.cse7 (or .cse0 .cse13)) (.cse8 (not .cse14)) (.cse5 (not .cse3)) (.cse9 (or .cse14 .cse3)) (.cse11 (or .cse12 .cse13)) (.cse6 (not .cse13)) (.cse10 (not .cse12))) (and (let ((.cse1 (= 0 (mod v_~x$r_buff0_thd2~0_78 256))) (.cse2 (= 0 (mod v_~x$w_buff1_used~0_295 256)))) (or (and (= v_~x$r_buff1_thd2~0_59 v_~x$r_buff1_thd2~0_60) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= v_~x$r_buff1_thd2~0_59 0) (or (and (not .cse1) .cse4) (and (not .cse2) .cse5))))) (or (and (= v_~x$r_buff0_thd2~0_78 0) .cse6 .cse4) (and (= v_~x$r_buff0_thd2~0_78 v_~x$r_buff0_thd2~0_79) .cse7)) (or (and (= v_~x$w_buff1_used~0_295 0) (or (and .cse8 .cse5) (and .cse6 .cse4))) (and (= v_~x$w_buff1_used~0_295 v_~x$w_buff1_used~0_296) .cse9 .cse7)) (or (and (= v_~x~0_110 v_~x$w_buff0~0_80) .cse6 .cse10 (= |v_P1Thread1of1ForFork1_#t~ite26#1_1| |v_P1_#t~ite26#1_29|)) (and .cse11 (or (and .cse8 .cse5 (= |v_P1_#t~ite26#1_29| v_~x$w_buff1~0_97)) (and .cse9 (= |v_P1_#t~ite26#1_29| v_~x~0_111))) (= v_~x~0_110 |v_P1_#t~ite26#1_29|))) (or (and .cse11 (= v_~x$w_buff0_used~0_391 v_~x$w_buff0_used~0_392)) (and .cse6 (= v_~x$w_buff0_used~0_391 0) .cse10))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_80, ~x$w_buff1~0=v_~x$w_buff1~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_60, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_296, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_79, ~x~0=v_~x~0_111, P1Thread1of1ForFork1_#t~ite26#1=|v_P1Thread1of1ForFork1_#t~ite26#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_392} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_80, P1Thread1of1ForFork1_#t~ite31#1=|v_P1Thread1of1ForFork1_#t~ite31#1_1|, ~x$w_buff1~0=v_~x$w_buff1~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_295, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_78, P1Thread1of1ForFork1_#t~ite28#1=|v_P1Thread1of1ForFork1_#t~ite28#1_1|, P1Thread1of1ForFork1_#t~ite26#1=|v_P1Thread1of1ForFork1_#t~ite26#1_2|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_391, P1Thread1of1ForFork1_#t~ite29#1=|v_P1Thread1of1ForFork1_#t~ite29#1_1|, P1Thread1of1ForFork1_#t~ite30#1=|v_P1Thread1of1ForFork1_#t~ite30#1_1|, ~x~0=v_~x~0_110, P1Thread1of1ForFork1_#t~ite27#1=|v_P1Thread1of1ForFork1_#t~ite27#1_1|} AuxVars[|v_P1_#t~ite26#1_29|] AssignedVars[P1Thread1of1ForFork1_#t~ite31#1, P1Thread1of1ForFork1_#t~ite29#1, P1Thread1of1ForFork1_#t~ite30#1, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28#1, ~x~0, P1Thread1of1ForFork1_#t~ite26#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1_#t~ite27#1][184], [132#L838true, 155#true, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, Black: 171#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), P2Thread1of1ForFork2InUse, Black: 177#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), Black: 175#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), Black: 157#(= ~__unbuffered_p3_EAX~0 0), P1Thread1of1ForFork1InUse, Black: 165#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), Black: 169#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~main$tmp_guard1~0)), 123#L775true, 98#L4-1true, 46#L825true, Black: 173#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), 129#L802true, Black: 167#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), 196#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 163#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0)))]) [2021-12-16 02:47:44,827 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2021-12-16 02:47:44,828 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2021-12-16 02:47:44,828 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2021-12-16 02:47:44,828 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2021-12-16 02:47:44,828 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L795-->L802: Formula: (let ((.cse12 (= 0 (mod v_~x$w_buff0_used~0_392 256))) (.cse3 (= 0 (mod v_~x$r_buff1_thd2~0_60 256))) (.cse14 (= 0 (mod v_~x$w_buff1_used~0_296 256))) (.cse13 (= 0 (mod v_~x$r_buff0_thd2~0_79 256))) (.cse0 (= 0 (mod v_~x$w_buff0_used~0_391 256)))) (let ((.cse4 (not .cse0)) (.cse7 (or .cse0 .cse13)) (.cse8 (not .cse14)) (.cse5 (not .cse3)) (.cse9 (or .cse14 .cse3)) (.cse11 (or .cse12 .cse13)) (.cse6 (not .cse13)) (.cse10 (not .cse12))) (and (let ((.cse1 (= 0 (mod v_~x$r_buff0_thd2~0_78 256))) (.cse2 (= 0 (mod v_~x$w_buff1_used~0_295 256)))) (or (and (= v_~x$r_buff1_thd2~0_59 v_~x$r_buff1_thd2~0_60) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= v_~x$r_buff1_thd2~0_59 0) (or (and (not .cse1) .cse4) (and (not .cse2) .cse5))))) (or (and (= v_~x$r_buff0_thd2~0_78 0) .cse6 .cse4) (and (= v_~x$r_buff0_thd2~0_78 v_~x$r_buff0_thd2~0_79) .cse7)) (or (and (= v_~x$w_buff1_used~0_295 0) (or (and .cse8 .cse5) (and .cse6 .cse4))) (and (= v_~x$w_buff1_used~0_295 v_~x$w_buff1_used~0_296) .cse9 .cse7)) (or (and (= v_~x~0_110 v_~x$w_buff0~0_80) .cse6 .cse10 (= |v_P1Thread1of1ForFork1_#t~ite26#1_1| |v_P1_#t~ite26#1_29|)) (and .cse11 (or (and .cse8 .cse5 (= |v_P1_#t~ite26#1_29| v_~x$w_buff1~0_97)) (and .cse9 (= |v_P1_#t~ite26#1_29| v_~x~0_111))) (= v_~x~0_110 |v_P1_#t~ite26#1_29|))) (or (and .cse11 (= v_~x$w_buff0_used~0_391 v_~x$w_buff0_used~0_392)) (and .cse6 (= v_~x$w_buff0_used~0_391 0) .cse10))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_80, ~x$w_buff1~0=v_~x$w_buff1~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_60, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_296, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_79, ~x~0=v_~x~0_111, P1Thread1of1ForFork1_#t~ite26#1=|v_P1Thread1of1ForFork1_#t~ite26#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_392} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_80, P1Thread1of1ForFork1_#t~ite31#1=|v_P1Thread1of1ForFork1_#t~ite31#1_1|, ~x$w_buff1~0=v_~x$w_buff1~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_295, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_78, P1Thread1of1ForFork1_#t~ite28#1=|v_P1Thread1of1ForFork1_#t~ite28#1_1|, P1Thread1of1ForFork1_#t~ite26#1=|v_P1Thread1of1ForFork1_#t~ite26#1_2|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_391, P1Thread1of1ForFork1_#t~ite29#1=|v_P1Thread1of1ForFork1_#t~ite29#1_1|, P1Thread1of1ForFork1_#t~ite30#1=|v_P1Thread1of1ForFork1_#t~ite30#1_1|, ~x~0=v_~x~0_110, P1Thread1of1ForFork1_#t~ite27#1=|v_P1Thread1of1ForFork1_#t~ite27#1_1|} AuxVars[|v_P1_#t~ite26#1_29|] AssignedVars[P1Thread1of1ForFork1_#t~ite31#1, P1Thread1of1ForFork1_#t~ite29#1, P1Thread1of1ForFork1_#t~ite30#1, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28#1, ~x~0, P1Thread1of1ForFork1_#t~ite26#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1_#t~ite27#1][140], [132#L838true, 137#L3-1true, 191#true, 155#true, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, Black: 171#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), P2Thread1of1ForFork2InUse, Black: 177#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), Black: 175#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), Black: 157#(= ~__unbuffered_p3_EAX~0 0), P1Thread1of1ForFork1InUse, Black: 165#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), Black: 169#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~main$tmp_guard1~0)), 123#L775true, 46#L825true, Black: 173#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), 129#L802true, Black: 167#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), Black: 163#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0)))]) [2021-12-16 02:47:44,829 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2021-12-16 02:47:44,829 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2021-12-16 02:47:44,829 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2021-12-16 02:47:44,829 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2021-12-16 02:47:44,887 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([917] L880-->L883: Formula: (= v_~main$tmp_guard1~0_1 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_2) (= 2 v_~z~0_4) (= 2 v_~__unbuffered_p3_EAX~0_2) (= 0 v_~__unbuffered_p1_EAX~0_2) (= 0 v_~__unbuffered_p3_EBX~0_2))) 1 0)) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_2, ~z~0=v_~z~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_2, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_2} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_2, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_2, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_1, ~z~0=v_~z~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_2} AuxVars[] AssignedVars[~main$tmp_guard1~0][185], [37#L883true, 79#L835true, 191#true, 155#true, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, Black: 171#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), P2Thread1of1ForFork2InUse, Black: 177#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), Black: 175#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), Black: 157#(= ~__unbuffered_p3_EAX~0 0), P1Thread1of1ForFork1InUse, Black: 165#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), Black: 169#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~main$tmp_guard1~0)), 123#L775true, 46#L825true, Black: 173#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), 48#L795true, Black: 167#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), Black: 163#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0)))]) [2021-12-16 02:47:44,887 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2021-12-16 02:47:44,887 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-16 02:47:44,887 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-16 02:47:44,887 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-16 02:47:44,944 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L795-->L802: Formula: (let ((.cse12 (= 0 (mod v_~x$w_buff0_used~0_392 256))) (.cse3 (= 0 (mod v_~x$r_buff1_thd2~0_60 256))) (.cse14 (= 0 (mod v_~x$w_buff1_used~0_296 256))) (.cse13 (= 0 (mod v_~x$r_buff0_thd2~0_79 256))) (.cse0 (= 0 (mod v_~x$w_buff0_used~0_391 256)))) (let ((.cse4 (not .cse0)) (.cse7 (or .cse0 .cse13)) (.cse8 (not .cse14)) (.cse5 (not .cse3)) (.cse9 (or .cse14 .cse3)) (.cse11 (or .cse12 .cse13)) (.cse6 (not .cse13)) (.cse10 (not .cse12))) (and (let ((.cse1 (= 0 (mod v_~x$r_buff0_thd2~0_78 256))) (.cse2 (= 0 (mod v_~x$w_buff1_used~0_295 256)))) (or (and (= v_~x$r_buff1_thd2~0_59 v_~x$r_buff1_thd2~0_60) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= v_~x$r_buff1_thd2~0_59 0) (or (and (not .cse1) .cse4) (and (not .cse2) .cse5))))) (or (and (= v_~x$r_buff0_thd2~0_78 0) .cse6 .cse4) (and (= v_~x$r_buff0_thd2~0_78 v_~x$r_buff0_thd2~0_79) .cse7)) (or (and (= v_~x$w_buff1_used~0_295 0) (or (and .cse8 .cse5) (and .cse6 .cse4))) (and (= v_~x$w_buff1_used~0_295 v_~x$w_buff1_used~0_296) .cse9 .cse7)) (or (and (= v_~x~0_110 v_~x$w_buff0~0_80) .cse6 .cse10 (= |v_P1Thread1of1ForFork1_#t~ite26#1_1| |v_P1_#t~ite26#1_29|)) (and .cse11 (or (and .cse8 .cse5 (= |v_P1_#t~ite26#1_29| v_~x$w_buff1~0_97)) (and .cse9 (= |v_P1_#t~ite26#1_29| v_~x~0_111))) (= v_~x~0_110 |v_P1_#t~ite26#1_29|))) (or (and .cse11 (= v_~x$w_buff0_used~0_391 v_~x$w_buff0_used~0_392)) (and .cse6 (= v_~x$w_buff0_used~0_391 0) .cse10))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_80, ~x$w_buff1~0=v_~x$w_buff1~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_60, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_296, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_79, ~x~0=v_~x~0_111, P1Thread1of1ForFork1_#t~ite26#1=|v_P1Thread1of1ForFork1_#t~ite26#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_392} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_80, P1Thread1of1ForFork1_#t~ite31#1=|v_P1Thread1of1ForFork1_#t~ite31#1_1|, ~x$w_buff1~0=v_~x$w_buff1~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_295, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_78, P1Thread1of1ForFork1_#t~ite28#1=|v_P1Thread1of1ForFork1_#t~ite28#1_1|, P1Thread1of1ForFork1_#t~ite26#1=|v_P1Thread1of1ForFork1_#t~ite26#1_2|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_391, P1Thread1of1ForFork1_#t~ite29#1=|v_P1Thread1of1ForFork1_#t~ite29#1_1|, P1Thread1of1ForFork1_#t~ite30#1=|v_P1Thread1of1ForFork1_#t~ite30#1_1|, ~x~0=v_~x~0_110, P1Thread1of1ForFork1_#t~ite27#1=|v_P1Thread1of1ForFork1_#t~ite27#1_1|} AuxVars[|v_P1_#t~ite26#1_29|] AssignedVars[P1Thread1of1ForFork1_#t~ite31#1, P1Thread1of1ForFork1_#t~ite29#1, P1Thread1of1ForFork1_#t~ite30#1, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28#1, ~x~0, P1Thread1of1ForFork1_#t~ite26#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1_#t~ite27#1][140], [132#L838true, 191#true, 36#L880true, 155#true, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, Black: 171#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), P2Thread1of1ForFork2InUse, Black: 177#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), Black: 175#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), Black: 157#(= ~__unbuffered_p3_EAX~0 0), P1Thread1of1ForFork1InUse, Black: 165#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), Black: 169#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~main$tmp_guard1~0)), 123#L775true, 46#L825true, Black: 173#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), 129#L802true, Black: 167#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), Black: 163#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 0) (<= 1 ~main$tmp_guard1~0)), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0)))]) [2021-12-16 02:47:44,944 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2021-12-16 02:47:44,944 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-12-16 02:47:44,944 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-12-16 02:47:44,944 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-12-16 02:47:45,162 INFO L129 PetriNetUnfolder]: 11048/18635 cut-off events. [2021-12-16 02:47:45,162 INFO L130 PetriNetUnfolder]: For 16709/18632 co-relation queries the response was YES. [2021-12-16 02:47:45,223 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43492 conditions, 18635 events. 11048/18635 cut-off events. For 16709/18632 co-relation queries the response was YES. Maximal size of possible extension queue 1384. Compared 154397 event pairs, 1050 based on Foata normal form. 52/17388 useless extension candidates. Maximal degree in co-relation 43423. Up to 6048 conditions per place. [2021-12-16 02:47:45,287 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 85 selfloop transitions, 20 changer transitions 0/201 dead transitions. [2021-12-16 02:47:45,287 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 201 transitions, 788 flow [2021-12-16 02:47:45,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 02:47:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-16 02:47:45,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1209 transitions. [2021-12-16 02:47:45,290 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8824817518248175 [2021-12-16 02:47:45,290 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1209 transitions. [2021-12-16 02:47:45,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1209 transitions. [2021-12-16 02:47:45,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:47:45,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1209 transitions. [2021-12-16 02:47:45,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.9) internal successors, (1209), 10 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:45,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:45,296 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:45,296 INFO L186 Difference]: Start difference. First operand has 162 places, 119 transitions, 324 flow. Second operand 10 states and 1209 transitions. [2021-12-16 02:47:45,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 201 transitions, 788 flow [2021-12-16 02:47:45,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 201 transitions, 774 flow, removed 6 selfloop flow, removed 4 redundant places. [2021-12-16 02:47:45,323 INFO L242 Difference]: Finished difference. Result has 150 places, 137 transitions, 453 flow [2021-12-16 02:47:45,324 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=453, PETRI_PLACES=150, PETRI_TRANSITIONS=137} [2021-12-16 02:47:45,324 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 6 predicate places. [2021-12-16 02:47:45,324 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 137 transitions, 453 flow [2021-12-16 02:47:45,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:45,325 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:47:45,325 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:47:45,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 02:47:45,325 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:47:45,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:47:45,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1634550244, now seen corresponding path program 1 times [2021-12-16 02:47:45,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:47:45,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785041162] [2021-12-16 02:47:45,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:47:45,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:47:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:47:45,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:47:45,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:47:45,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785041162] [2021-12-16 02:47:45,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785041162] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:47:45,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:47:45,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:47:45,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473373764] [2021-12-16 02:47:45,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:47:45,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:47:45,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:47:45,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:47:45,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:47:45,464 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2021-12-16 02:47:45,465 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 137 transitions, 453 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:45,465 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:47:45,465 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2021-12-16 02:47:45,465 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:47:47,788 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([917] L880-->L883: Formula: (= v_~main$tmp_guard1~0_1 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_2) (= 2 v_~z~0_4) (= 2 v_~__unbuffered_p3_EAX~0_2) (= 0 v_~__unbuffered_p1_EAX~0_2) (= 0 v_~__unbuffered_p3_EBX~0_2))) 1 0)) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_2, ~z~0=v_~z~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_2, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_2} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_2, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_2, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_1, ~z~0=v_~z~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_2} AuxVars[] AssignedVars[~main$tmp_guard1~0][227], [79#L835true, 155#true, P3Thread1of1ForFork0InUse, Black: 200#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= ~__unbuffered_cnt~0 0)), 214#true, Black: 194#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0)), P0Thread1of1ForFork3InUse, Black: 198#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0)), P2Thread1of1ForFork2InUse, Black: 206#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 202#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P1Thread1of1ForFork1InUse, 46#L825true, 48#L795true, 37#L883true, 191#true, Black: 177#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), Black: 175#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 169#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~main$tmp_guard1~0)), 123#L775true, Black: 173#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), Black: 167#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0)), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p0_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0)) (not (= 2 ~z~0)))]) [2021-12-16 02:47:47,789 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2021-12-16 02:47:47,789 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-16 02:47:47,789 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-16 02:47:47,789 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-16 02:47:47,896 INFO L129 PetriNetUnfolder]: 10391/18001 cut-off events. [2021-12-16 02:47:47,896 INFO L130 PetriNetUnfolder]: For 32585/34452 co-relation queries the response was YES. [2021-12-16 02:47:47,970 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55707 conditions, 18001 events. 10391/18001 cut-off events. For 32585/34452 co-relation queries the response was YES. Maximal size of possible extension queue 1444. Compared 155693 event pairs, 748 based on Foata normal form. 332/17460 useless extension candidates. Maximal degree in co-relation 55633. Up to 3918 conditions per place. [2021-12-16 02:47:48,010 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 108 selfloop transitions, 38 changer transitions 2/244 dead transitions. [2021-12-16 02:47:48,011 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 244 transitions, 1289 flow [2021-12-16 02:47:48,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 02:47:48,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-16 02:47:48,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1576 transitions. [2021-12-16 02:47:48,014 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8848961257720381 [2021-12-16 02:47:48,014 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1576 transitions. [2021-12-16 02:47:48,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1576 transitions. [2021-12-16 02:47:48,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:47:48,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1576 transitions. [2021-12-16 02:47:48,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 121.23076923076923) internal successors, (1576), 13 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:48,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:48,020 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:48,020 INFO L186 Difference]: Start difference. First operand has 150 places, 137 transitions, 453 flow. Second operand 13 states and 1576 transitions. [2021-12-16 02:47:48,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 244 transitions, 1289 flow [2021-12-16 02:47:48,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 244 transitions, 1281 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-12-16 02:47:48,154 INFO L242 Difference]: Finished difference. Result has 164 places, 157 transitions, 738 flow [2021-12-16 02:47:48,154 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=738, PETRI_PLACES=164, PETRI_TRANSITIONS=157} [2021-12-16 02:47:48,155 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 20 predicate places. [2021-12-16 02:47:48,155 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 157 transitions, 738 flow [2021-12-16 02:47:48,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:48,155 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:47:48,156 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:47:48,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 02:47:48,156 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:47:48,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:47:48,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1914780066, now seen corresponding path program 1 times [2021-12-16 02:47:48,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:47:48,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18600163] [2021-12-16 02:47:48,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:47:48,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:47:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:47:48,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:47:48,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:47:48,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18600163] [2021-12-16 02:47:48,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18600163] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:47:48,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:47:48,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:47:48,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509098076] [2021-12-16 02:47:48,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:47:48,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:47:48,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:47:48,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:47:48,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:47:48,322 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2021-12-16 02:47:48,323 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 157 transitions, 738 flow. Second operand has 7 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:48,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:47:48,323 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2021-12-16 02:47:48,323 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:47:49,528 INFO L129 PetriNetUnfolder]: 3344/10643 cut-off events. [2021-12-16 02:47:49,528 INFO L130 PetriNetUnfolder]: For 29870/36895 co-relation queries the response was YES. [2021-12-16 02:47:49,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35883 conditions, 10643 events. 3344/10643 cut-off events. For 29870/36895 co-relation queries the response was YES. Maximal size of possible extension queue 1141. Compared 131118 event pairs, 377 based on Foata normal form. 199/10090 useless extension candidates. Maximal degree in co-relation 35803. Up to 2685 conditions per place. [2021-12-16 02:47:49,683 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 64 selfloop transitions, 6 changer transitions 0/205 dead transitions. [2021-12-16 02:47:49,684 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 205 transitions, 1064 flow [2021-12-16 02:47:49,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 02:47:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-16 02:47:49,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 848 transitions. [2021-12-16 02:47:49,686 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8842544316996872 [2021-12-16 02:47:49,687 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 848 transitions. [2021-12-16 02:47:49,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 848 transitions. [2021-12-16 02:47:49,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:47:49,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 848 transitions. [2021-12-16 02:47:49,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:49,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:49,691 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:49,691 INFO L186 Difference]: Start difference. First operand has 164 places, 157 transitions, 738 flow. Second operand 7 states and 848 transitions. [2021-12-16 02:47:49,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 205 transitions, 1064 flow [2021-12-16 02:47:50,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 205 transitions, 969 flow, removed 38 selfloop flow, removed 4 redundant places. [2021-12-16 02:47:50,548 INFO L242 Difference]: Finished difference. Result has 171 places, 162 transitions, 708 flow [2021-12-16 02:47:50,549 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=708, PETRI_PLACES=171, PETRI_TRANSITIONS=162} [2021-12-16 02:47:50,549 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 27 predicate places. [2021-12-16 02:47:50,549 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 162 transitions, 708 flow [2021-12-16 02:47:50,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:50,550 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:47:50,550 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:47:50,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 02:47:50,550 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:47:50,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:47:50,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1558627422, now seen corresponding path program 2 times [2021-12-16 02:47:50,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:47:50,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894781351] [2021-12-16 02:47:50,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:47:50,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:47:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:47:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:47:50,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:47:50,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894781351] [2021-12-16 02:47:50,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894781351] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:47:50,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:47:50,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 02:47:50,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646442277] [2021-12-16 02:47:50,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:47:50,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 02:47:50,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:47:50,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 02:47:50,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:47:50,638 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2021-12-16 02:47:50,638 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 162 transitions, 708 flow. Second operand has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:50,638 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:47:50,639 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2021-12-16 02:47:50,639 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:47:54,787 INFO L129 PetriNetUnfolder]: 17401/30629 cut-off events. [2021-12-16 02:47:54,788 INFO L130 PetriNetUnfolder]: For 84957/89423 co-relation queries the response was YES. [2021-12-16 02:47:55,142 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104068 conditions, 30629 events. 17401/30629 cut-off events. For 84957/89423 co-relation queries the response was YES. Maximal size of possible extension queue 2447. Compared 292741 event pairs, 963 based on Foata normal form. 455/29686 useless extension candidates. Maximal degree in co-relation 103985. Up to 4274 conditions per place. [2021-12-16 02:47:55,206 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 108 selfloop transitions, 58 changer transitions 30/294 dead transitions. [2021-12-16 02:47:55,206 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 294 transitions, 1928 flow [2021-12-16 02:47:55,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 02:47:55,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-16 02:47:55,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1942 transitions. [2021-12-16 02:47:55,223 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8859489051094891 [2021-12-16 02:47:55,223 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1942 transitions. [2021-12-16 02:47:55,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1942 transitions. [2021-12-16 02:47:55,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:47:55,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1942 transitions. [2021-12-16 02:47:55,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 121.375) internal successors, (1942), 16 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:55,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:55,231 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:55,231 INFO L186 Difference]: Start difference. First operand has 171 places, 162 transitions, 708 flow. Second operand 16 states and 1942 transitions. [2021-12-16 02:47:55,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 294 transitions, 1928 flow [2021-12-16 02:47:56,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 294 transitions, 1925 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-12-16 02:47:56,937 INFO L242 Difference]: Finished difference. Result has 189 places, 185 transitions, 1142 flow [2021-12-16 02:47:56,937 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1142, PETRI_PLACES=189, PETRI_TRANSITIONS=185} [2021-12-16 02:47:56,938 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 45 predicate places. [2021-12-16 02:47:56,938 INFO L470 AbstractCegarLoop]: Abstraction has has 189 places, 185 transitions, 1142 flow [2021-12-16 02:47:56,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:56,939 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:47:56,939 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2021-12-16 02:47:56,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 02:47:56,939 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:47:56,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:47:56,940 INFO L85 PathProgramCache]: Analyzing trace with hash 312184905, now seen corresponding path program 1 times [2021-12-16 02:47:56,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:47:56,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328163504] [2021-12-16 02:47:56,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:47:56,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:47:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:47:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:47:57,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:47:57,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328163504] [2021-12-16 02:47:57,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328163504] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:47:57,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:47:57,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 02:47:57,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612933974] [2021-12-16 02:47:57,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:47:57,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 02:47:57,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:47:57,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 02:47:57,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-16 02:47:57,148 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2021-12-16 02:47:57,149 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 185 transitions, 1142 flow. Second operand has 9 states, 9 states have (on average 113.11111111111111) internal successors, (1018), 9 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:47:57,149 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:47:57,149 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2021-12-16 02:47:57,150 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:48:01,559 INFO L129 PetriNetUnfolder]: 16923/30155 cut-off events. [2021-12-16 02:48:01,560 INFO L130 PetriNetUnfolder]: For 113857/118204 co-relation queries the response was YES. [2021-12-16 02:48:01,791 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112945 conditions, 30155 events. 16923/30155 cut-off events. For 113857/118204 co-relation queries the response was YES. Maximal size of possible extension queue 2351. Compared 292698 event pairs, 820 based on Foata normal form. 325/29265 useless extension candidates. Maximal degree in co-relation 112912. Up to 4052 conditions per place. [2021-12-16 02:48:01,824 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 82 selfloop transitions, 61 changer transitions 51/292 dead transitions. [2021-12-16 02:48:01,824 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 292 transitions, 2129 flow [2021-12-16 02:48:01,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-16 02:48:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-12-16 02:48:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2262 transitions. [2021-12-16 02:48:01,828 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8689973107952362 [2021-12-16 02:48:01,828 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2262 transitions. [2021-12-16 02:48:01,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2262 transitions. [2021-12-16 02:48:01,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:48:01,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2262 transitions. [2021-12-16 02:48:01,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 119.05263157894737) internal successors, (2262), 19 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:48:01,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:48:01,837 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:48:01,837 INFO L186 Difference]: Start difference. First operand has 189 places, 185 transitions, 1142 flow. Second operand 19 states and 2262 transitions. [2021-12-16 02:48:01,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 292 transitions, 2129 flow [2021-12-16 02:48:07,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 292 transitions, 1728 flow, removed 157 selfloop flow, removed 15 redundant places. [2021-12-16 02:48:07,296 INFO L242 Difference]: Finished difference. Result has 196 places, 182 transitions, 968 flow [2021-12-16 02:48:07,296 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=968, PETRI_PLACES=196, PETRI_TRANSITIONS=182} [2021-12-16 02:48:07,297 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 52 predicate places. [2021-12-16 02:48:07,297 INFO L470 AbstractCegarLoop]: Abstraction has has 196 places, 182 transitions, 968 flow [2021-12-16 02:48:07,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.11111111111111) internal successors, (1018), 9 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:48:07,297 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:48:07,298 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2021-12-16 02:48:07,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 02:48:07,298 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:48:07,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:48:07,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1887609992, now seen corresponding path program 1 times [2021-12-16 02:48:07,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:48:07,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526996802] [2021-12-16 02:48:07,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:48:07,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:48:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:48:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:48:07,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:48:07,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526996802] [2021-12-16 02:48:07,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526996802] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:48:07,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:48:07,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:48:07,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559948158] [2021-12-16 02:48:07,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:48:07,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:48:07,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:48:07,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:48:07,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:48:07,396 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 137 [2021-12-16 02:48:07,397 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 182 transitions, 968 flow. Second operand has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:48:07,397 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:48:07,397 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 137 [2021-12-16 02:48:07,397 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:48:08,842 INFO L129 PetriNetUnfolder]: 4386/14435 cut-off events. [2021-12-16 02:48:08,842 INFO L130 PetriNetUnfolder]: For 32871/34524 co-relation queries the response was YES. [2021-12-16 02:48:08,967 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46414 conditions, 14435 events. 4386/14435 cut-off events. For 32871/34524 co-relation queries the response was YES. Maximal size of possible extension queue 1907. Compared 197846 event pairs, 75 based on Foata normal form. 8/13457 useless extension candidates. Maximal degree in co-relation 46320. Up to 1382 conditions per place. [2021-12-16 02:48:09,001 INFO L132 encePairwiseOnDemand]: 123/137 looper letters, 45 selfloop transitions, 18 changer transitions 7/218 dead transitions. [2021-12-16 02:48:09,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 218 transitions, 1296 flow [2021-12-16 02:48:09,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 02:48:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-16 02:48:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 894 transitions. [2021-12-16 02:48:09,003 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8156934306569343 [2021-12-16 02:48:09,003 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 894 transitions. [2021-12-16 02:48:09,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 894 transitions. [2021-12-16 02:48:09,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:48:09,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 894 transitions. [2021-12-16 02:48:09,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.75) internal successors, (894), 8 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:48:09,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:48:09,007 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:48:09,007 INFO L186 Difference]: Start difference. First operand has 196 places, 182 transitions, 968 flow. Second operand 8 states and 894 transitions. [2021-12-16 02:48:09,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 218 transitions, 1296 flow [2021-12-16 02:48:10,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 218 transitions, 1111 flow, removed 46 selfloop flow, removed 17 redundant places. [2021-12-16 02:48:10,599 INFO L242 Difference]: Finished difference. Result has 189 places, 193 transitions, 985 flow [2021-12-16 02:48:10,600 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=985, PETRI_PLACES=189, PETRI_TRANSITIONS=193} [2021-12-16 02:48:10,600 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 45 predicate places. [2021-12-16 02:48:10,600 INFO L470 AbstractCegarLoop]: Abstraction has has 189 places, 193 transitions, 985 flow [2021-12-16 02:48:10,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:48:10,601 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:48:10,601 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2021-12-16 02:48:10,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 02:48:10,601 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:48:10,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:48:10,602 INFO L85 PathProgramCache]: Analyzing trace with hash 897908378, now seen corresponding path program 2 times [2021-12-16 02:48:10,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:48:10,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355565803] [2021-12-16 02:48:10,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:48:10,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:48:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:48:10,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:48:10,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:48:10,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355565803] [2021-12-16 02:48:10,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355565803] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:48:10,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:48:10,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 02:48:10,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377965655] [2021-12-16 02:48:10,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:48:10,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 02:48:10,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:48:10,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 02:48:10,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-16 02:48:10,777 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 137 [2021-12-16 02:48:10,778 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 193 transitions, 985 flow. Second operand has 10 states, 10 states have (on average 103.2) internal successors, (1032), 10 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:48:10,778 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:48:10,778 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 137 [2021-12-16 02:48:10,778 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:48:13,663 INFO L129 PetriNetUnfolder]: 8169/26297 cut-off events. [2021-12-16 02:48:13,663 INFO L130 PetriNetUnfolder]: For 46710/47673 co-relation queries the response was YES. [2021-12-16 02:48:13,990 INFO L84 FinitePrefix]: Finished finitePrefix Result has 76886 conditions, 26297 events. 8169/26297 cut-off events. For 46710/47673 co-relation queries the response was YES. Maximal size of possible extension queue 3536. Compared 394658 event pairs, 54 based on Foata normal form. 54/24786 useless extension candidates. Maximal degree in co-relation 76854. Up to 2668 conditions per place. [2021-12-16 02:48:14,198 INFO L132 encePairwiseOnDemand]: 119/137 looper letters, 73 selfloop transitions, 54 changer transitions 8/280 dead transitions. [2021-12-16 02:48:14,198 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 280 transitions, 1808 flow [2021-12-16 02:48:14,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 02:48:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-16 02:48:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1292 transitions. [2021-12-16 02:48:14,200 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7858880778588808 [2021-12-16 02:48:14,200 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1292 transitions. [2021-12-16 02:48:14,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1292 transitions. [2021-12-16 02:48:14,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:48:14,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1292 transitions. [2021-12-16 02:48:14,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 107.66666666666667) internal successors, (1292), 12 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:48:14,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:48:14,205 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:48:14,205 INFO L186 Difference]: Start difference. First operand has 189 places, 193 transitions, 985 flow. Second operand 12 states and 1292 transitions. [2021-12-16 02:48:14,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 280 transitions, 1808 flow [2021-12-16 02:48:18,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 280 transitions, 1796 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-12-16 02:48:18,838 INFO L242 Difference]: Finished difference. Result has 202 places, 240 transitions, 1565 flow [2021-12-16 02:48:18,838 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=977, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1565, PETRI_PLACES=202, PETRI_TRANSITIONS=240} [2021-12-16 02:48:18,839 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 58 predicate places. [2021-12-16 02:48:18,839 INFO L470 AbstractCegarLoop]: Abstraction has has 202 places, 240 transitions, 1565 flow [2021-12-16 02:48:18,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 103.2) internal successors, (1032), 10 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:48:18,840 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:48:18,840 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2021-12-16 02:48:18,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 02:48:18,840 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:48:18,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:48:18,841 INFO L85 PathProgramCache]: Analyzing trace with hash 357896002, now seen corresponding path program 3 times [2021-12-16 02:48:18,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:48:18,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99532742] [2021-12-16 02:48:18,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:48:18,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:48:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 02:48:18,881 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 02:48:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 02:48:18,983 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 02:48:18,983 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 02:48:18,983 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-12-16 02:48:18,985 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-12-16 02:48:18,985 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-12-16 02:48:18,985 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-12-16 02:48:18,985 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-12-16 02:48:18,985 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2021-12-16 02:48:18,985 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-12-16 02:48:18,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 02:48:18,988 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2021-12-16 02:48:18,991 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-16 02:48:18,991 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 02:48:19,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 02:48:19 BasicIcfg [2021-12-16 02:48:19,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 02:48:19,109 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 02:48:19,109 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 02:48:19,110 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 02:48:19,110 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:47:40" (3/4) ... [2021-12-16 02:48:19,111 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-16 02:48:19,217 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 02:48:19,217 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 02:48:19,218 INFO L158 Benchmark]: Toolchain (without parser) took 40403.41ms. Allocated memory was 83.9MB in the beginning and 8.3GB in the end (delta: 8.2GB). Free memory was 50.0MB in the beginning and 6.8GB in the end (delta: -6.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2021-12-16 02:48:19,218 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory was 42.7MB in the beginning and 42.6MB in the end (delta: 41.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 02:48:19,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.49ms. Allocated memory was 83.9MB in the beginning and 115.3MB in the end (delta: 31.5MB). Free memory was 49.8MB in the beginning and 77.6MB in the end (delta: -27.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 02:48:19,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.51ms. Allocated memory is still 115.3MB. Free memory was 77.6MB in the beginning and 74.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 02:48:19,219 INFO L158 Benchmark]: Boogie Preprocessor took 58.43ms. Allocated memory is still 115.3MB. Free memory was 74.9MB in the beginning and 72.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 02:48:19,219 INFO L158 Benchmark]: RCFGBuilder took 757.07ms. Allocated memory is still 115.3MB. Free memory was 72.8MB in the beginning and 49.7MB in the end (delta: 23.1MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2021-12-16 02:48:19,219 INFO L158 Benchmark]: TraceAbstraction took 38985.74ms. Allocated memory was 115.3MB in the beginning and 8.3GB in the end (delta: 8.2GB). Free memory was 49.0MB in the beginning and 6.9GB in the end (delta: -6.8GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2021-12-16 02:48:19,220 INFO L158 Benchmark]: Witness Printer took 107.97ms. Allocated memory is still 8.3GB. Free memory was 6.9GB in the beginning and 6.8GB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2021-12-16 02:48:19,221 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory was 42.7MB in the beginning and 42.6MB in the end (delta: 41.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.49ms. Allocated memory was 83.9MB in the beginning and 115.3MB in the end (delta: 31.5MB). Free memory was 49.8MB in the beginning and 77.6MB in the end (delta: -27.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.51ms. Allocated memory is still 115.3MB. Free memory was 77.6MB in the beginning and 74.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.43ms. Allocated memory is still 115.3MB. Free memory was 74.9MB in the beginning and 72.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 757.07ms. Allocated memory is still 115.3MB. Free memory was 72.8MB in the beginning and 49.7MB in the end (delta: 23.1MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. * TraceAbstraction took 38985.74ms. Allocated memory was 115.3MB in the beginning and 8.3GB in the end (delta: 8.2GB). Free memory was 49.0MB in the beginning and 6.9GB in the end (delta: -6.8GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 107.97ms. Allocated memory is still 8.3GB. Free memory was 6.9GB in the beginning and 6.8GB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L713] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L717] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L719] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L721] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L722] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L723] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L725] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L727] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L728] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L729] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L730] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L731] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L732] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L733] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L734] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L735] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L736] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L737] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L738] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L739] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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}] [L740] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L741] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L742] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L743] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L745] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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, y=0] [L747] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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, y=0, z=0] [L748] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=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, y=0, z=0] [L749] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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, y=0, z=0] [L862] 0 pthread_t t685; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t685={5:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t685, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t685, ((void *)0), P0, ((void *)0))=-3, t685={5:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0, z=0] [L864] 0 pthread_t t686; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t685={5:0}, t686={6:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0, z=0] [L865] FCALL, FORK 0 pthread_create(&t686, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t686, ((void *)0), P1, ((void *)0))=-2, t685={5:0}, t686={6:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0, z=0] [L866] 0 pthread_t t687; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t685={5:0}, t686={6:0}, t687={7:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0, z=0] [L867] FCALL, FORK 0 pthread_create(&t687, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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(&t687, ((void *)0), P2, ((void *)0))=-1, t685={5:0}, t686={6:0}, t687={7:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0, z=0] [L868] 0 pthread_t t688; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0, z=0] [L869] FCALL, FORK 0 pthread_create(&t688, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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(&t688, ((void *)0), P3, ((void *)0))=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0, z=0] [L781] 2 x$w_buff1 = x$w_buff0 [L782] 2 x$w_buff0 = 1 [L783] 2 x$w_buff1_used = x$w_buff0_used [L784] 2 x$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L786] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L787] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L788] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L789] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L790] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L791] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L794] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L811] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L814] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L817] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L817] 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) [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L819] 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 [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L821] 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 [L831] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L834] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L837] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L753] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x [L760] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L761] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L762] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L763] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L764] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L765] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L766] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L766] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EAX = x [L768] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L797] 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) [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L799] 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 [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L801] 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 [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L840] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L840] 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) [L841] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L841] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L842] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L842] 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 [L843] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L843] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L844] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L844] 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 [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L875] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L875] 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) [L876] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L876] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L877] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L877] 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 [L878] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L878] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L879] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L879] 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 [L882] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 869]: 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. - UnprovableResult [Line: 867]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 173 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 38.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 36.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 722 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 722 mSDsluCounter, 609 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1202 mSDsCounter, 193 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1549 IncrementalHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 193 mSolverCounterUnsat, 121 mSDtfsCounter, 1549 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1565occurred in iteration=9, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 935 NumberOfCodeBlocks, 935 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 820 ConstructedInterpolants, 0 QuantifiedInterpolants, 4008 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-16 02:48:19,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE