/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 04:59:49,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 04:59:49,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 04:59:49,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 04:59:49,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 04:59:49,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 04:59:49,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 04:59:49,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 04:59:49,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 04:59:49,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 04:59:49,297 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 04:59:49,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 04:59:49,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 04:59:49,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 04:59:49,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 04:59:49,300 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 04:59:49,301 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 04:59:49,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 04:59:49,302 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 04:59:49,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 04:59:49,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 04:59:49,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 04:59:49,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 04:59:49,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 04:59:49,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 04:59:49,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 04:59:49,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 04:59:49,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 04:59:49,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 04:59:49,309 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 04:59:49,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 04:59:49,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 04:59:49,310 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 04:59:49,311 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 04:59:49,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 04:59:49,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 04:59:49,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 04:59:49,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 04:59:49,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 04:59:49,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 04:59:49,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 04:59:49,320 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf [2022-01-19 04:59:49,339 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 04:59:49,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 04:59:49,340 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 04:59:49,340 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 04:59:49,341 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 04:59:49,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 04:59:49,341 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 04:59:49,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 04:59:49,341 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 04:59:49,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 04:59:49,341 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 04:59:49,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 04:59:49,342 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 04:59:49,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 04:59:49,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 04:59:49,342 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 04:59:49,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 04:59:49,342 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 04:59:49,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 04:59:49,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 04:59:49,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 04:59:49,343 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 04:59:49,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 04:59:49,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:59:49,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 04:59:49,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 04:59:49,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 04:59:49,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 04:59:49,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 04:59:49,344 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 04:59:49,344 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 04:59:49,344 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 04:59:49,344 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 [2022-01-19 04:59:49,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 04:59:49,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 04:59:49,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 04:59:49,537 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 04:59:49,541 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 04:59:49,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i [2022-01-19 04:59:49,598 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbfbdd479/680822ff161e497bb9501b5b2f8d0b92/FLAG996b4f1a9 [2022-01-19 04:59:50,005 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 04:59:50,006 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i [2022-01-19 04:59:50,024 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbfbdd479/680822ff161e497bb9501b5b2f8d0b92/FLAG996b4f1a9 [2022-01-19 04:59:50,032 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbfbdd479/680822ff161e497bb9501b5b2f8d0b92 [2022-01-19 04:59:50,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 04:59:50,035 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 04:59:50,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 04:59:50,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 04:59:50,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 04:59:50,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:59:50" (1/1) ... [2022-01-19 04:59:50,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f6ceb18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:50, skipping insertion in model container [2022-01-19 04:59:50,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:59:50" (1/1) ... [2022-01-19 04:59:50,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 04:59:50,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 04:59:50,225 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i[994,1007] [2022-01-19 04:59:50,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:59:50,406 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 04:59:50,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i[994,1007] [2022-01-19 04:59:50,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:59:50,478 INFO L208 MainTranslator]: Completed translation [2022-01-19 04:59:50,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:50 WrapperNode [2022-01-19 04:59:50,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 04:59:50,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 04:59:50,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 04:59:50,479 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 04:59:50,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:50" (1/1) ... [2022-01-19 04:59:50,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:50" (1/1) ... [2022-01-19 04:59:50,522 INFO L137 Inliner]: procedures = 177, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 225 [2022-01-19 04:59:50,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 04:59:50,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 04:59:50,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 04:59:50,524 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 04:59:50,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:50" (1/1) ... [2022-01-19 04:59:50,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:50" (1/1) ... [2022-01-19 04:59:50,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:50" (1/1) ... [2022-01-19 04:59:50,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:50" (1/1) ... [2022-01-19 04:59:50,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:50" (1/1) ... [2022-01-19 04:59:50,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:50" (1/1) ... [2022-01-19 04:59:50,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:50" (1/1) ... [2022-01-19 04:59:50,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 04:59:50,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 04:59:50,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 04:59:50,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 04:59:50,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:50" (1/1) ... [2022-01-19 04:59:50,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:59:50,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:59:50,614 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) [2022-01-19 04:59:50,631 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 [2022-01-19 04:59:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 04:59:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 04:59:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 04:59:50,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 04:59:50,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 04:59:50,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 04:59:50,646 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-19 04:59:50,646 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-19 04:59:50,646 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-19 04:59:50,647 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-19 04:59:50,647 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-19 04:59:50,647 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-19 04:59:50,647 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-01-19 04:59:50,647 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-01-19 04:59:50,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 04:59:50,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 04:59:50,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 04:59:50,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 04:59:50,650 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 04:59:50,799 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 04:59:50,800 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 04:59:51,291 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 04:59:51,751 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 04:59:51,751 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 04:59:51,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:59:51 BoogieIcfgContainer [2022-01-19 04:59:51,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 04:59:51,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 04:59:51,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 04:59:51,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 04:59:51,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 04:59:50" (1/3) ... [2022-01-19 04:59:51,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4121f6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:59:51, skipping insertion in model container [2022-01-19 04:59:51,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:50" (2/3) ... [2022-01-19 04:59:51,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4121f6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:59:51, skipping insertion in model container [2022-01-19 04:59:51,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:59:51" (3/3) ... [2022-01-19 04:59:51,761 INFO L111 eAbstractionObserver]: Analyzing ICFG safe019_power.opt.i [2022-01-19 04:59:51,766 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 04:59:51,766 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 04:59:51,766 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 04:59:51,825 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,825 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,826 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,826 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,826 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,826 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,826 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,826 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,826 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,827 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,828 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,828 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,828 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,828 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,828 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,828 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,828 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,828 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,828 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,829 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,829 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,829 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,829 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,829 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,829 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,830 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,830 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,830 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,830 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,830 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,830 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,830 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,830 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,830 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,831 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,831 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,831 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,831 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,831 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,831 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,831 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,831 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,831 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,831 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,831 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,831 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,832 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,832 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,832 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,832 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,832 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,832 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,834 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,834 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,834 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,835 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,835 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,835 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,835 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,835 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,835 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,835 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,835 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,835 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,836 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,836 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,836 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,836 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,836 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,836 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,836 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,837 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,837 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,837 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,837 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,837 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,837 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,837 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,837 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,837 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,837 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,837 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,838 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,838 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,838 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,838 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,838 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,839 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,840 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,845 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,847 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,847 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,847 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,847 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,848 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,848 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,848 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,848 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,848 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,848 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,848 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,848 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,848 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,848 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,849 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,849 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,849 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,849 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,849 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,849 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,849 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,849 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,850 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,850 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,850 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,850 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,850 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,850 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,850 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,851 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,851 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,851 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,851 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,851 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,851 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,851 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,851 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,851 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,853 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,853 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,853 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,853 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,853 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,853 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,853 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,853 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,854 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,854 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,854 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,854 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,854 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,854 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,854 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,854 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,854 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,854 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,854 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,855 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,855 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,855 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,855 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,855 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,855 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,855 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,856 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,856 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,856 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,856 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,856 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,856 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,856 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,856 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,856 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,856 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,856 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,856 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,856 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,856 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,856 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,856 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,856 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,856 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,857 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,857 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,857 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,857 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,857 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,857 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,857 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,857 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,857 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,857 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,857 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,857 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,857 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,857 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,857 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,857 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,857 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,857 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,858 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,858 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,858 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,858 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,858 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,858 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,858 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,858 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,858 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,858 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,858 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,858 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,858 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,858 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,859 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,859 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,859 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,859 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,859 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,861 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,862 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,862 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,862 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,862 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,862 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,863 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,863 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,863 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,863 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,863 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,863 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,863 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,863 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,863 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,863 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,863 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,863 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,863 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,867 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,879 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,879 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,879 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,879 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,879 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,879 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,879 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,879 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,879 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,880 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,880 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,880 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,880 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,880 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,880 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,880 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,880 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,880 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,880 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,880 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,880 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,880 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,880 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,880 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,880 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,880 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,880 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,883 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,883 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,883 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,883 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,883 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,883 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,883 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,883 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,883 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,883 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,883 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,883 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,883 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,883 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,883 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,883 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,883 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,883 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,883 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,884 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,884 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,884 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,884 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,888 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,888 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,888 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,888 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite89| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,888 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite88| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,888 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,888 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite90| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,888 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite91| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,888 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite92| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,889 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,889 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,889 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,889 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite89| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,889 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite88| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,889 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,889 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite90| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,889 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite91| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,889 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite92| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,890 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,890 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,890 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,890 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,890 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,890 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,890 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,891 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,891 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,891 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,891 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,891 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,891 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~mem93| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,891 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite94| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,891 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~mem93| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,891 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite97| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,891 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite98| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,891 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite99| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,891 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite94| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,891 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite95| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,891 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite96| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,892 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~mem93| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,892 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite94| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,892 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~mem93| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,892 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite97| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,892 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite98| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,892 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite99| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,892 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite94| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,892 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite95| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,892 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite96| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,893 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,893 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,893 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,893 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,896 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite89| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,898 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,898 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,898 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,898 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,898 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,898 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,899 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite91| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,899 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,899 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,899 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,899 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,899 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,899 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,899 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,899 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,899 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,899 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,899 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,899 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,899 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,899 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,900 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,900 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,900 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,900 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,900 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,900 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,900 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite88| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,900 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,900 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,900 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,900 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,900 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,900 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,900 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,901 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,901 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite92| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,901 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite90| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,901 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,901 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,901 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,901 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,901 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,901 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,901 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,901 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,902 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,902 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,902 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,902 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,902 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,902 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,902 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,903 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,903 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,903 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,903 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,903 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,903 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,903 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,903 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,903 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,903 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,903 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,903 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,903 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,903 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,903 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,904 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,904 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,904 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,904 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,904 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,904 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,904 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,904 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,904 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,904 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite97| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,905 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite98| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,905 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite95| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,905 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite96| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,905 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,905 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,905 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite99| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,905 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,905 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~mem93| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,905 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,905 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite94| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,906 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,906 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,906 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,906 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,906 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,906 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,906 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,906 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,906 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,906 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,906 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,906 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,907 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:51,907 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 04:59:51,946 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 04:59:51,960 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=false, 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 [2022-01-19 04:59:51,960 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-19 04:59:51,971 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 163 places, 152 transitions, 324 flow [2022-01-19 04:59:52,026 INFO L129 PetriNetUnfolder]: 2/148 cut-off events. [2022-01-19 04:59:52,026 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:59:52,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 2/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-01-19 04:59:52,030 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 152 transitions, 324 flow [2022-01-19 04:59:52,036 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 148 transitions, 308 flow [2022-01-19 04:59:52,052 INFO L129 PetriNetUnfolder]: 0/81 cut-off events. [2022-01-19 04:59:52,053 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:59:52,053 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:52,053 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] [2022-01-19 04:59:52,054 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:59:52,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:52,058 INFO L85 PathProgramCache]: Analyzing trace with hash -397280163, now seen corresponding path program 1 times [2022-01-19 04:59:52,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:52,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163530325] [2022-01-19 04:59:52,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:52,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:52,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:52,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:52,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163530325] [2022-01-19 04:59:52,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163530325] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:52,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:52,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 04:59:52,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195841693] [2022-01-19 04:59:52,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:52,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 04:59:52,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:52,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 04:59:52,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 04:59:52,385 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 152 [2022-01-19 04:59:52,396 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 148 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:52,397 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:52,397 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 152 [2022-01-19 04:59:52,398 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:52,751 INFO L129 PetriNetUnfolder]: 258/1462 cut-off events. [2022-01-19 04:59:52,751 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-01-19 04:59:52,758 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1915 conditions, 1462 events. 258/1462 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 11079 event pairs, 172 based on Foata normal form. 40/1403 useless extension candidates. Maximal degree in co-relation 1839. Up to 289 conditions per place. [2022-01-19 04:59:52,764 INFO L132 encePairwiseOnDemand]: 147/152 looper letters, 19 selfloop transitions, 2 changer transitions 0/152 dead transitions. [2022-01-19 04:59:52,764 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 152 transitions, 364 flow [2022-01-19 04:59:52,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 04:59:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 04:59:52,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2022-01-19 04:59:52,778 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9451754385964912 [2022-01-19 04:59:52,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2022-01-19 04:59:52,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2022-01-19 04:59:52,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:52,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2022-01-19 04:59:52,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:52,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:52,793 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:52,794 INFO L186 Difference]: Start difference. First operand has 159 places, 148 transitions, 308 flow. Second operand 3 states and 431 transitions. [2022-01-19 04:59:52,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 152 transitions, 364 flow [2022-01-19 04:59:52,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 152 transitions, 358 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 04:59:52,804 INFO L242 Difference]: Finished difference. Result has 155 places, 144 transitions, 300 flow [2022-01-19 04:59:52,805 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=155, PETRI_TRANSITIONS=144} [2022-01-19 04:59:52,809 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, -4 predicate places. [2022-01-19 04:59:52,809 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 144 transitions, 300 flow [2022-01-19 04:59:52,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:52,809 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:52,810 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] [2022-01-19 04:59:52,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 04:59:52,810 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:59:52,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:52,810 INFO L85 PathProgramCache]: Analyzing trace with hash -331025959, now seen corresponding path program 1 times [2022-01-19 04:59:52,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:52,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612611774] [2022-01-19 04:59:52,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:52,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:53,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:53,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612611774] [2022-01-19 04:59:53,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612611774] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:53,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:53,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:59:53,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781387648] [2022-01-19 04:59:53,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:53,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:59:53,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:53,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:59:53,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:59:53,007 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 152 [2022-01-19 04:59:53,008 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 144 transitions, 300 flow. Second operand has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:53,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:53,008 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 152 [2022-01-19 04:59:53,008 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:54,251 INFO L129 PetriNetUnfolder]: 3393/8110 cut-off events. [2022-01-19 04:59:54,251 INFO L130 PetriNetUnfolder]: For 447/447 co-relation queries the response was YES. [2022-01-19 04:59:54,268 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13398 conditions, 8110 events. 3393/8110 cut-off events. For 447/447 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 70698 event pairs, 708 based on Foata normal form. 0/7880 useless extension candidates. Maximal degree in co-relation 13323. Up to 2642 conditions per place. [2022-01-19 04:59:54,283 INFO L132 encePairwiseOnDemand]: 145/152 looper letters, 27 selfloop transitions, 3 changer transitions 71/210 dead transitions. [2022-01-19 04:59:54,284 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 210 transitions, 624 flow [2022-01-19 04:59:54,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:59:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:59:54,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1224 transitions. [2022-01-19 04:59:54,286 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8947368421052632 [2022-01-19 04:59:54,286 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1224 transitions. [2022-01-19 04:59:54,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1224 transitions. [2022-01-19 04:59:54,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:54,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1224 transitions. [2022-01-19 04:59:54,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 136.0) internal successors, (1224), 9 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:54,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 152.0) internal successors, (1520), 10 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:54,291 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 152.0) internal successors, (1520), 10 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:54,291 INFO L186 Difference]: Start difference. First operand has 155 places, 144 transitions, 300 flow. Second operand 9 states and 1224 transitions. [2022-01-19 04:59:54,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 210 transitions, 624 flow [2022-01-19 04:59:54,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 210 transitions, 606 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 04:59:54,298 INFO L242 Difference]: Finished difference. Result has 168 places, 132 transitions, 311 flow [2022-01-19 04:59:54,298 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=311, PETRI_PLACES=168, PETRI_TRANSITIONS=132} [2022-01-19 04:59:54,299 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 9 predicate places. [2022-01-19 04:59:54,299 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 132 transitions, 311 flow [2022-01-19 04:59:54,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:54,299 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:54,299 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] [2022-01-19 04:59:54,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 04:59:54,300 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:59:54,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:54,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1071559942, now seen corresponding path program 1 times [2022-01-19 04:59:54,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:54,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131006394] [2022-01-19 04:59:54,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:54,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:54,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:54,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131006394] [2022-01-19 04:59:54,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131006394] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:54,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:54,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:59:54,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654230758] [2022-01-19 04:59:54,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:54,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:59:54,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:54,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:59:54,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:59:54,504 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 152 [2022-01-19 04:59:54,505 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 132 transitions, 311 flow. Second operand has 7 states, 7 states have (on average 129.85714285714286) internal successors, (909), 7 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:54,505 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:54,505 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 152 [2022-01-19 04:59:54,505 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:55,092 INFO L129 PetriNetUnfolder]: 1072/2211 cut-off events. [2022-01-19 04:59:55,092 INFO L130 PetriNetUnfolder]: For 1434/1446 co-relation queries the response was YES. [2022-01-19 04:59:55,100 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4885 conditions, 2211 events. 1072/2211 cut-off events. For 1434/1446 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 14021 event pairs, 314 based on Foata normal form. 48/2158 useless extension candidates. Maximal degree in co-relation 4802. Up to 831 conditions per place. [2022-01-19 04:59:55,108 INFO L132 encePairwiseOnDemand]: 145/152 looper letters, 22 selfloop transitions, 3 changer transitions 37/175 dead transitions. [2022-01-19 04:59:55,108 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 175 transitions, 541 flow [2022-01-19 04:59:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:59:55,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:59:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1344 transitions. [2022-01-19 04:59:55,111 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8842105263157894 [2022-01-19 04:59:55,111 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1344 transitions. [2022-01-19 04:59:55,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1344 transitions. [2022-01-19 04:59:55,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:55,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1344 transitions. [2022-01-19 04:59:55,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 134.4) internal successors, (1344), 10 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:55,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 152.0) internal successors, (1672), 11 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:55,117 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 152.0) internal successors, (1672), 11 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:55,117 INFO L186 Difference]: Start difference. First operand has 168 places, 132 transitions, 311 flow. Second operand 10 states and 1344 transitions. [2022-01-19 04:59:55,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 175 transitions, 541 flow [2022-01-19 04:59:55,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 175 transitions, 524 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-01-19 04:59:55,130 INFO L242 Difference]: Finished difference. Result has 160 places, 132 transitions, 324 flow [2022-01-19 04:59:55,130 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=324, PETRI_PLACES=160, PETRI_TRANSITIONS=132} [2022-01-19 04:59:55,132 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 1 predicate places. [2022-01-19 04:59:55,132 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 132 transitions, 324 flow [2022-01-19 04:59:55,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 129.85714285714286) internal successors, (909), 7 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:55,133 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:55,133 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, 1] [2022-01-19 04:59:55,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 04:59:55,133 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:59:55,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:55,134 INFO L85 PathProgramCache]: Analyzing trace with hash -165868536, now seen corresponding path program 1 times [2022-01-19 04:59:55,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:55,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547730838] [2022-01-19 04:59:55,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:55,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:55,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:55,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547730838] [2022-01-19 04:59:55,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547730838] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:55,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:55,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:59:55,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843511744] [2022-01-19 04:59:55,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:55,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:59:55,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:55,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:59:55,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:59:55,337 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 152 [2022-01-19 04:59:55,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 132 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:55,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:55,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 152 [2022-01-19 04:59:55,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:56,148 INFO L129 PetriNetUnfolder]: 2607/4750 cut-off events. [2022-01-19 04:59:56,148 INFO L130 PetriNetUnfolder]: For 4187/4223 co-relation queries the response was YES. [2022-01-19 04:59:56,164 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11311 conditions, 4750 events. 2607/4750 cut-off events. For 4187/4223 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 31304 event pairs, 963 based on Foata normal form. 90/4693 useless extension candidates. Maximal degree in co-relation 11223. Up to 1500 conditions per place. [2022-01-19 04:59:56,178 INFO L132 encePairwiseOnDemand]: 146/152 looper letters, 32 selfloop transitions, 3 changer transitions 46/190 dead transitions. [2022-01-19 04:59:56,178 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 190 transitions, 674 flow [2022-01-19 04:59:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:59:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:59:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1216 transitions. [2022-01-19 04:59:56,181 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2022-01-19 04:59:56,181 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1216 transitions. [2022-01-19 04:59:56,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1216 transitions. [2022-01-19 04:59:56,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:56,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1216 transitions. [2022-01-19 04:59:56,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 135.11111111111111) internal successors, (1216), 9 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:56,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 152.0) internal successors, (1520), 10 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:56,185 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 152.0) internal successors, (1520), 10 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:56,185 INFO L186 Difference]: Start difference. First operand has 160 places, 132 transitions, 324 flow. Second operand 9 states and 1216 transitions. [2022-01-19 04:59:56,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 190 transitions, 674 flow [2022-01-19 04:59:56,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 190 transitions, 620 flow, removed 24 selfloop flow, removed 9 redundant places. [2022-01-19 04:59:56,216 INFO L242 Difference]: Finished difference. Result has 160 places, 132 transitions, 327 flow [2022-01-19 04:59:56,216 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=327, PETRI_PLACES=160, PETRI_TRANSITIONS=132} [2022-01-19 04:59:56,217 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 1 predicate places. [2022-01-19 04:59:56,217 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 132 transitions, 327 flow [2022-01-19 04:59:56,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:56,217 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:56,217 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, 1, 1] [2022-01-19 04:59:56,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 04:59:56,218 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:59:56,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:56,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1185106057, now seen corresponding path program 1 times [2022-01-19 04:59:56,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:56,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836242761] [2022-01-19 04:59:56,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:56,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:56,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:56,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:56,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836242761] [2022-01-19 04:59:56,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836242761] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:56,322 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:56,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:59:56,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809033332] [2022-01-19 04:59:56,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:56,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:59:56,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:56,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:59:56,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:59:56,324 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 152 [2022-01-19 04:59:56,324 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 132 transitions, 327 flow. Second operand has 6 states, 6 states have (on average 130.16666666666666) internal successors, (781), 6 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:56,324 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:56,324 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 152 [2022-01-19 04:59:56,324 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:56,948 INFO L129 PetriNetUnfolder]: 1620/3360 cut-off events. [2022-01-19 04:59:56,948 INFO L130 PetriNetUnfolder]: For 3894/3900 co-relation queries the response was YES. [2022-01-19 04:59:56,957 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7811 conditions, 3360 events. 1620/3360 cut-off events. For 3894/3900 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 23588 event pairs, 936 based on Foata normal form. 90/3246 useless extension candidates. Maximal degree in co-relation 7724. Up to 1251 conditions per place. [2022-01-19 04:59:56,964 INFO L132 encePairwiseOnDemand]: 146/152 looper letters, 26 selfloop transitions, 2 changer transitions 37/178 dead transitions. [2022-01-19 04:59:56,964 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 178 transitions, 586 flow [2022-01-19 04:59:56,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:59:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:59:56,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1219 transitions. [2022-01-19 04:59:56,966 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8910818713450293 [2022-01-19 04:59:56,966 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1219 transitions. [2022-01-19 04:59:56,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1219 transitions. [2022-01-19 04:59:56,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:56,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1219 transitions. [2022-01-19 04:59:56,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 135.44444444444446) internal successors, (1219), 9 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:56,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 152.0) internal successors, (1520), 10 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:56,970 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 152.0) internal successors, (1520), 10 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:56,970 INFO L186 Difference]: Start difference. First operand has 160 places, 132 transitions, 327 flow. Second operand 9 states and 1219 transitions. [2022-01-19 04:59:56,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 178 transitions, 586 flow [2022-01-19 04:59:56,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 178 transitions, 549 flow, removed 17 selfloop flow, removed 7 redundant places. [2022-01-19 04:59:56,987 INFO L242 Difference]: Finished difference. Result has 162 places, 132 transitions, 326 flow [2022-01-19 04:59:56,987 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=326, PETRI_PLACES=162, PETRI_TRANSITIONS=132} [2022-01-19 04:59:56,987 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 3 predicate places. [2022-01-19 04:59:56,988 INFO L470 AbstractCegarLoop]: Abstraction has has 162 places, 132 transitions, 326 flow [2022-01-19 04:59:56,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.16666666666666) internal successors, (781), 6 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:56,988 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:56,988 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, 1, 1, 1, 1] [2022-01-19 04:59:56,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 04:59:56,988 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:59:56,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:56,988 INFO L85 PathProgramCache]: Analyzing trace with hash 638703164, now seen corresponding path program 1 times [2022-01-19 04:59:56,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:56,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011399313] [2022-01-19 04:59:56,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:56,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:57,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:57,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011399313] [2022-01-19 04:59:57,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011399313] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:57,088 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:57,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:59:57,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496884649] [2022-01-19 04:59:57,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:57,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:59:57,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:57,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:59:57,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:59:57,090 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 152 [2022-01-19 04:59:57,091 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 132 transitions, 326 flow. Second operand has 7 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:57,091 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:57,091 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 152 [2022-01-19 04:59:57,091 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:57,771 INFO L129 PetriNetUnfolder]: 2220/4354 cut-off events. [2022-01-19 04:59:57,771 INFO L130 PetriNetUnfolder]: For 4167/4215 co-relation queries the response was YES. [2022-01-19 04:59:57,790 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10262 conditions, 4354 events. 2220/4354 cut-off events. For 4167/4215 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 30793 event pairs, 414 based on Foata normal form. 60/4207 useless extension candidates. Maximal degree in co-relation 10172. Up to 1563 conditions per place. [2022-01-19 04:59:57,804 INFO L132 encePairwiseOnDemand]: 143/152 looper letters, 32 selfloop transitions, 5 changer transitions 26/171 dead transitions. [2022-01-19 04:59:57,804 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 171 transitions, 601 flow [2022-01-19 04:59:57,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 04:59:57,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 04:59:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 939 transitions. [2022-01-19 04:59:57,806 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8825187969924813 [2022-01-19 04:59:57,806 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 939 transitions. [2022-01-19 04:59:57,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 939 transitions. [2022-01-19 04:59:57,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:57,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 939 transitions. [2022-01-19 04:59:57,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.14285714285714) internal successors, (939), 7 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:57,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 152.0) internal successors, (1216), 8 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:57,809 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 152.0) internal successors, (1216), 8 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:57,809 INFO L186 Difference]: Start difference. First operand has 162 places, 132 transitions, 326 flow. Second operand 7 states and 939 transitions. [2022-01-19 04:59:57,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 171 transitions, 601 flow [2022-01-19 04:59:57,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 171 transitions, 575 flow, removed 10 selfloop flow, removed 8 redundant places. [2022-01-19 04:59:57,828 INFO L242 Difference]: Finished difference. Result has 158 places, 132 transitions, 333 flow [2022-01-19 04:59:57,828 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=333, PETRI_PLACES=158, PETRI_TRANSITIONS=132} [2022-01-19 04:59:57,830 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, -1 predicate places. [2022-01-19 04:59:57,830 INFO L470 AbstractCegarLoop]: Abstraction has has 158 places, 132 transitions, 333 flow [2022-01-19 04:59:57,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:57,830 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:57,831 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, 1, 1, 1, 1] [2022-01-19 04:59:57,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 04:59:57,831 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:59:57,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:57,832 INFO L85 PathProgramCache]: Analyzing trace with hash -307247946, now seen corresponding path program 2 times [2022-01-19 04:59:57,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:57,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475505195] [2022-01-19 04:59:57,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:57,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:57,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:57,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475505195] [2022-01-19 04:59:57,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475505195] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:57,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:57,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:59:57,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289450787] [2022-01-19 04:59:57,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:57,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:59:57,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:57,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:59:57,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:59:57,977 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 152 [2022-01-19 04:59:57,978 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 132 transitions, 333 flow. Second operand has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 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) [2022-01-19 04:59:57,978 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:57,978 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 152 [2022-01-19 04:59:57,978 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:59,511 INFO L129 PetriNetUnfolder]: 7660/13043 cut-off events. [2022-01-19 04:59:59,511 INFO L130 PetriNetUnfolder]: For 2562/2602 co-relation queries the response was YES. [2022-01-19 04:59:59,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26178 conditions, 13043 events. 7660/13043 cut-off events. For 2562/2602 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 98212 event pairs, 358 based on Foata normal form. 0/12678 useless extension candidates. Maximal degree in co-relation 26089. Up to 4663 conditions per place. [2022-01-19 04:59:59,566 INFO L132 encePairwiseOnDemand]: 141/152 looper letters, 38 selfloop transitions, 7 changer transitions 60/213 dead transitions. [2022-01-19 04:59:59,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 213 transitions, 716 flow [2022-01-19 04:59:59,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:59:59,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:59:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1347 transitions. [2022-01-19 04:59:59,569 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8861842105263158 [2022-01-19 04:59:59,569 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1347 transitions. [2022-01-19 04:59:59,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1347 transitions. [2022-01-19 04:59:59,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:59,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1347 transitions. [2022-01-19 04:59:59,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 134.7) internal successors, (1347), 10 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:59,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 152.0) internal successors, (1672), 11 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:59,573 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 152.0) internal successors, (1672), 11 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:59,573 INFO L186 Difference]: Start difference. First operand has 158 places, 132 transitions, 333 flow. Second operand 10 states and 1347 transitions. [2022-01-19 04:59:59,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 213 transitions, 716 flow [2022-01-19 04:59:59,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 213 transitions, 698 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-01-19 04:59:59,587 INFO L242 Difference]: Finished difference. Result has 164 places, 135 transitions, 381 flow [2022-01-19 04:59:59,587 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=381, PETRI_PLACES=164, PETRI_TRANSITIONS=135} [2022-01-19 04:59:59,587 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 5 predicate places. [2022-01-19 04:59:59,587 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 135 transitions, 381 flow [2022-01-19 04:59:59,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 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) [2022-01-19 04:59:59,588 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:59,588 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, 1, 1, 1, 1, 1, 1] [2022-01-19 04:59:59,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 04:59:59,588 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:59:59,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:59,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1143330405, now seen corresponding path program 1 times [2022-01-19 04:59:59,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:59,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365428694] [2022-01-19 04:59:59,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:59,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:59,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:59,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:59,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365428694] [2022-01-19 04:59:59,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365428694] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:59,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:59,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-19 04:59:59,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785315522] [2022-01-19 04:59:59,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:59,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 04:59:59,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:59,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 04:59:59,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-19 04:59:59,916 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 152 [2022-01-19 04:59:59,918 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 135 transitions, 381 flow. Second operand has 15 states, 15 states have (on average 114.06666666666666) internal successors, (1711), 15 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:59,918 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:59,918 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 152 [2022-01-19 04:59:59,918 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:01,239 INFO L129 PetriNetUnfolder]: 2396/5714 cut-off events. [2022-01-19 05:00:01,239 INFO L130 PetriNetUnfolder]: For 4768/5085 co-relation queries the response was YES. [2022-01-19 05:00:01,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14061 conditions, 5714 events. 2396/5714 cut-off events. For 4768/5085 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 50324 event pairs, 867 based on Foata normal form. 42/5376 useless extension candidates. Maximal degree in co-relation 13956. Up to 1941 conditions per place. [2022-01-19 05:00:01,280 INFO L132 encePairwiseOnDemand]: 134/152 looper letters, 71 selfloop transitions, 36 changer transitions 0/207 dead transitions. [2022-01-19 05:00:01,280 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 207 transitions, 803 flow [2022-01-19 05:00:01,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 05:00:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 05:00:01,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2462 transitions. [2022-01-19 05:00:01,284 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7713032581453634 [2022-01-19 05:00:01,284 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2462 transitions. [2022-01-19 05:00:01,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2462 transitions. [2022-01-19 05:00:01,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:01,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2462 transitions. [2022-01-19 05:00:01,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 117.23809523809524) internal successors, (2462), 21 states have internal predecessors, (2462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:01,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 152.0) internal successors, (3344), 22 states have internal predecessors, (3344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:01,291 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 152.0) internal successors, (3344), 22 states have internal predecessors, (3344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:01,291 INFO L186 Difference]: Start difference. First operand has 164 places, 135 transitions, 381 flow. Second operand 21 states and 2462 transitions. [2022-01-19 05:00:01,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 207 transitions, 803 flow [2022-01-19 05:00:01,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 207 transitions, 788 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-01-19 05:00:01,307 INFO L242 Difference]: Finished difference. Result has 186 places, 163 transitions, 629 flow [2022-01-19 05:00:01,307 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=629, PETRI_PLACES=186, PETRI_TRANSITIONS=163} [2022-01-19 05:00:01,307 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 27 predicate places. [2022-01-19 05:00:01,307 INFO L470 AbstractCegarLoop]: Abstraction has has 186 places, 163 transitions, 629 flow [2022-01-19 05:00:01,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 114.06666666666666) internal successors, (1711), 15 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:01,308 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:01,308 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, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:01,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 05:00:01,308 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 05:00:01,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:01,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1833213049, now seen corresponding path program 2 times [2022-01-19 05:00:01,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:01,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612582087] [2022-01-19 05:00:01,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:01,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:01,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:01,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:01,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612582087] [2022-01-19 05:00:01,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612582087] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:01,580 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:01,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 05:00:01,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546193413] [2022-01-19 05:00:01,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:01,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 05:00:01,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:01,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 05:00:01,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-01-19 05:00:01,581 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 152 [2022-01-19 05:00:01,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 163 transitions, 629 flow. Second operand has 13 states, 13 states have (on average 115.3076923076923) internal successors, (1499), 13 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:01,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:01,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 152 [2022-01-19 05:00:01,583 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:03,169 INFO L129 PetriNetUnfolder]: 3050/7468 cut-off events. [2022-01-19 05:00:03,170 INFO L130 PetriNetUnfolder]: For 22062/22476 co-relation queries the response was YES. [2022-01-19 05:00:03,206 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26468 conditions, 7468 events. 3050/7468 cut-off events. For 22062/22476 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 70467 event pairs, 1520 based on Foata normal form. 78/7114 useless extension candidates. Maximal degree in co-relation 26348. Up to 2101 conditions per place. [2022-01-19 05:00:03,234 INFO L132 encePairwiseOnDemand]: 135/152 looper letters, 106 selfloop transitions, 66 changer transitions 3/276 dead transitions. [2022-01-19 05:00:03,234 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 276 transitions, 1854 flow [2022-01-19 05:00:03,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-19 05:00:03,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-01-19 05:00:03,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3084 transitions. [2022-01-19 05:00:03,238 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7803643724696356 [2022-01-19 05:00:03,238 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 3084 transitions. [2022-01-19 05:00:03,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 3084 transitions. [2022-01-19 05:00:03,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:03,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 3084 transitions. [2022-01-19 05:00:03,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 118.61538461538461) internal successors, (3084), 26 states have internal predecessors, (3084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:03,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 152.0) internal successors, (4104), 27 states have internal predecessors, (4104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:03,249 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 152.0) internal successors, (4104), 27 states have internal predecessors, (4104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:03,249 INFO L186 Difference]: Start difference. First operand has 186 places, 163 transitions, 629 flow. Second operand 26 states and 3084 transitions. [2022-01-19 05:00:03,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 276 transitions, 1854 flow [2022-01-19 05:00:03,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 276 transitions, 1812 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-01-19 05:00:03,284 INFO L242 Difference]: Finished difference. Result has 224 places, 214 transitions, 1319 flow [2022-01-19 05:00:03,284 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1319, PETRI_PLACES=224, PETRI_TRANSITIONS=214} [2022-01-19 05:00:03,284 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 65 predicate places. [2022-01-19 05:00:03,284 INFO L470 AbstractCegarLoop]: Abstraction has has 224 places, 214 transitions, 1319 flow [2022-01-19 05:00:03,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 115.3076923076923) internal successors, (1499), 13 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:03,285 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:03,285 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, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:03,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 05:00:03,285 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 05:00:03,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:03,286 INFO L85 PathProgramCache]: Analyzing trace with hash -543311883, now seen corresponding path program 3 times [2022-01-19 05:00:03,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:03,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452173046] [2022-01-19 05:00:03,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:03,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:03,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:03,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452173046] [2022-01-19 05:00:03,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452173046] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:03,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:03,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-19 05:00:03,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756405430] [2022-01-19 05:00:03,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:03,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-19 05:00:03,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:03,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-19 05:00:03,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2022-01-19 05:00:03,801 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 152 [2022-01-19 05:00:03,802 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 214 transitions, 1319 flow. Second operand has 20 states, 20 states have (on average 97.95) internal successors, (1959), 20 states have internal predecessors, (1959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:03,802 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:03,802 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 152 [2022-01-19 05:00:03,802 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:05,931 INFO L129 PetriNetUnfolder]: 3347/8251 cut-off events. [2022-01-19 05:00:05,931 INFO L130 PetriNetUnfolder]: For 90475/92021 co-relation queries the response was YES. [2022-01-19 05:00:05,983 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41965 conditions, 8251 events. 3347/8251 cut-off events. For 90475/92021 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 79242 event pairs, 1879 based on Foata normal form. 39/7807 useless extension candidates. Maximal degree in co-relation 41820. Up to 3611 conditions per place. [2022-01-19 05:00:06,017 INFO L132 encePairwiseOnDemand]: 130/152 looper letters, 127 selfloop transitions, 55 changer transitions 31/305 dead transitions. [2022-01-19 05:00:06,017 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 305 transitions, 2907 flow [2022-01-19 05:00:06,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-19 05:00:06,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-01-19 05:00:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2723 transitions. [2022-01-19 05:00:06,020 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6634990253411306 [2022-01-19 05:00:06,020 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2723 transitions. [2022-01-19 05:00:06,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2723 transitions. [2022-01-19 05:00:06,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:06,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2723 transitions. [2022-01-19 05:00:06,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 100.85185185185185) internal successors, (2723), 27 states have internal predecessors, (2723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:06,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 152.0) internal successors, (4256), 28 states have internal predecessors, (4256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:06,029 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 152.0) internal successors, (4256), 28 states have internal predecessors, (4256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:06,029 INFO L186 Difference]: Start difference. First operand has 224 places, 214 transitions, 1319 flow. Second operand 27 states and 2723 transitions. [2022-01-19 05:00:06,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 305 transitions, 2907 flow [2022-01-19 05:00:06,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 305 transitions, 2682 flow, removed 90 selfloop flow, removed 5 redundant places. [2022-01-19 05:00:06,204 INFO L242 Difference]: Finished difference. Result has 258 places, 259 transitions, 1843 flow [2022-01-19 05:00:06,204 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1843, PETRI_PLACES=258, PETRI_TRANSITIONS=259} [2022-01-19 05:00:06,205 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 99 predicate places. [2022-01-19 05:00:06,205 INFO L470 AbstractCegarLoop]: Abstraction has has 258 places, 259 transitions, 1843 flow [2022-01-19 05:00:06,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 97.95) internal successors, (1959), 20 states have internal predecessors, (1959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:06,206 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:06,206 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, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:06,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 05:00:06,206 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 05:00:06,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:06,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1683135465, now seen corresponding path program 1 times [2022-01-19 05:00:06,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:06,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004006775] [2022-01-19 05:00:06,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:06,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:06,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:06,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004006775] [2022-01-19 05:00:06,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004006775] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:06,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:06,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 05:00:06,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269255314] [2022-01-19 05:00:06,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:06,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 05:00:06,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:06,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 05:00:06,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 05:00:06,313 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 152 [2022-01-19 05:00:06,313 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 259 transitions, 1843 flow. Second operand has 7 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:06,313 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:06,313 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 152 [2022-01-19 05:00:06,313 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:08,146 INFO L129 PetriNetUnfolder]: 5673/10676 cut-off events. [2022-01-19 05:00:08,146 INFO L130 PetriNetUnfolder]: For 139668/140114 co-relation queries the response was YES. [2022-01-19 05:00:08,201 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56258 conditions, 10676 events. 5673/10676 cut-off events. For 139668/140114 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 84026 event pairs, 231 based on Foata normal form. 314/10873 useless extension candidates. Maximal degree in co-relation 56115. Up to 2880 conditions per place. [2022-01-19 05:00:08,363 INFO L132 encePairwiseOnDemand]: 142/152 looper letters, 155 selfloop transitions, 11 changer transitions 169/459 dead transitions. [2022-01-19 05:00:08,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 459 transitions, 4881 flow [2022-01-19 05:00:08,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 05:00:08,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 05:00:08,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1345 transitions. [2022-01-19 05:00:08,368 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8848684210526315 [2022-01-19 05:00:08,368 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1345 transitions. [2022-01-19 05:00:08,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1345 transitions. [2022-01-19 05:00:08,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:08,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1345 transitions. [2022-01-19 05:00:08,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 134.5) internal successors, (1345), 10 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:08,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 152.0) internal successors, (1672), 11 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:08,375 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 152.0) internal successors, (1672), 11 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:08,375 INFO L186 Difference]: Start difference. First operand has 258 places, 259 transitions, 1843 flow. Second operand 10 states and 1345 transitions. [2022-01-19 05:00:08,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 459 transitions, 4881 flow [2022-01-19 05:00:08,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 459 transitions, 3693 flow, removed 575 selfloop flow, removed 24 redundant places. [2022-01-19 05:00:08,509 INFO L242 Difference]: Finished difference. Result has 234 places, 209 transitions, 1115 flow [2022-01-19 05:00:08,509 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1115, PETRI_PLACES=234, PETRI_TRANSITIONS=209} [2022-01-19 05:00:08,510 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 75 predicate places. [2022-01-19 05:00:08,510 INFO L470 AbstractCegarLoop]: Abstraction has has 234 places, 209 transitions, 1115 flow [2022-01-19 05:00:08,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:08,510 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:08,510 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:08,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 05:00:08,510 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 05:00:08,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:08,511 INFO L85 PathProgramCache]: Analyzing trace with hash 45302874, now seen corresponding path program 1 times [2022-01-19 05:00:08,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:08,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122573531] [2022-01-19 05:00:08,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:08,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:09,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:09,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122573531] [2022-01-19 05:00:09,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122573531] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:09,199 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:09,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-19 05:00:09,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487753602] [2022-01-19 05:00:09,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:09,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 05:00:09,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:09,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 05:00:09,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2022-01-19 05:00:09,201 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 152 [2022-01-19 05:00:09,203 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 209 transitions, 1115 flow. Second operand has 23 states, 23 states have (on average 95.82608695652173) internal successors, (2204), 23 states have internal predecessors, (2204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:09,203 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:09,203 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 152 [2022-01-19 05:00:09,203 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:10,915 INFO L129 PetriNetUnfolder]: 1244/3811 cut-off events. [2022-01-19 05:00:10,916 INFO L130 PetriNetUnfolder]: For 24758/25505 co-relation queries the response was YES. [2022-01-19 05:00:10,941 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17128 conditions, 3811 events. 1244/3811 cut-off events. For 24758/25505 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 33128 event pairs, 504 based on Foata normal form. 97/3785 useless extension candidates. Maximal degree in co-relation 16979. Up to 1315 conditions per place. [2022-01-19 05:00:10,955 INFO L132 encePairwiseOnDemand]: 129/152 looper letters, 85 selfloop transitions, 93 changer transitions 25/297 dead transitions. [2022-01-19 05:00:10,956 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 297 transitions, 2365 flow [2022-01-19 05:00:10,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-19 05:00:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-01-19 05:00:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 3047 transitions. [2022-01-19 05:00:10,959 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6466468590831919 [2022-01-19 05:00:10,959 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 3047 transitions. [2022-01-19 05:00:10,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 3047 transitions. [2022-01-19 05:00:10,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:10,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 3047 transitions. [2022-01-19 05:00:10,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 98.29032258064517) internal successors, (3047), 31 states have internal predecessors, (3047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:10,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 152.0) internal successors, (4864), 32 states have internal predecessors, (4864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:10,968 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 152.0) internal successors, (4864), 32 states have internal predecessors, (4864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:10,968 INFO L186 Difference]: Start difference. First operand has 234 places, 209 transitions, 1115 flow. Second operand 31 states and 3047 transitions. [2022-01-19 05:00:10,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 297 transitions, 2365 flow [2022-01-19 05:00:11,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 297 transitions, 2216 flow, removed 65 selfloop flow, removed 21 redundant places. [2022-01-19 05:00:11,075 INFO L242 Difference]: Finished difference. Result has 232 places, 255 transitions, 1654 flow [2022-01-19 05:00:11,076 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1654, PETRI_PLACES=232, PETRI_TRANSITIONS=255} [2022-01-19 05:00:11,076 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 73 predicate places. [2022-01-19 05:00:11,076 INFO L470 AbstractCegarLoop]: Abstraction has has 232 places, 255 transitions, 1654 flow [2022-01-19 05:00:11,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 95.82608695652173) internal successors, (2204), 23 states have internal predecessors, (2204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:11,077 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:11,077 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:11,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 05:00:11,077 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 05:00:11,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:11,077 INFO L85 PathProgramCache]: Analyzing trace with hash -941368972, now seen corresponding path program 2 times [2022-01-19 05:00:11,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:11,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096240117] [2022-01-19 05:00:11,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:11,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:11,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:11,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:11,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096240117] [2022-01-19 05:00:11,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096240117] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:11,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:11,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-19 05:00:11,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043174552] [2022-01-19 05:00:11,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:11,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 05:00:11,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:11,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 05:00:11,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2022-01-19 05:00:11,715 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 152 [2022-01-19 05:00:11,716 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 255 transitions, 1654 flow. Second operand has 23 states, 23 states have (on average 96.78260869565217) internal successors, (2226), 23 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:11,716 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:11,716 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 152 [2022-01-19 05:00:11,717 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:13,344 INFO L129 PetriNetUnfolder]: 1308/4033 cut-off events. [2022-01-19 05:00:13,344 INFO L130 PetriNetUnfolder]: For 23372/23903 co-relation queries the response was YES. [2022-01-19 05:00:13,367 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16466 conditions, 4033 events. 1308/4033 cut-off events. For 23372/23903 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 35690 event pairs, 503 based on Foata normal form. 106/4015 useless extension candidates. Maximal degree in co-relation 16319. Up to 1349 conditions per place. [2022-01-19 05:00:13,380 INFO L132 encePairwiseOnDemand]: 129/152 looper letters, 85 selfloop transitions, 105 changer transitions 25/310 dead transitions. [2022-01-19 05:00:13,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 310 transitions, 2799 flow [2022-01-19 05:00:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-19 05:00:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-01-19 05:00:13,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2880 transitions. [2022-01-19 05:00:13,383 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6533575317604355 [2022-01-19 05:00:13,383 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 2880 transitions. [2022-01-19 05:00:13,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 2880 transitions. [2022-01-19 05:00:13,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:13,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2880 transitions. [2022-01-19 05:00:13,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 99.3103448275862) internal successors, (2880), 29 states have internal predecessors, (2880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:13,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 152.0) internal successors, (4560), 30 states have internal predecessors, (4560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:13,390 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 152.0) internal successors, (4560), 30 states have internal predecessors, (4560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:13,390 INFO L186 Difference]: Start difference. First operand has 232 places, 255 transitions, 1654 flow. Second operand 29 states and 2880 transitions. [2022-01-19 05:00:13,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 310 transitions, 2799 flow [2022-01-19 05:00:13,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 310 transitions, 2653 flow, removed 54 selfloop flow, removed 20 redundant places. [2022-01-19 05:00:13,422 INFO L242 Difference]: Finished difference. Result has 243 places, 272 transitions, 2167 flow [2022-01-19 05:00:13,423 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=2167, PETRI_PLACES=243, PETRI_TRANSITIONS=272} [2022-01-19 05:00:13,423 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 84 predicate places. [2022-01-19 05:00:13,423 INFO L470 AbstractCegarLoop]: Abstraction has has 243 places, 272 transitions, 2167 flow [2022-01-19 05:00:13,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 96.78260869565217) internal successors, (2226), 23 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:13,424 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:13,424 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:13,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 05:00:13,424 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 05:00:13,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:13,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1725138734, now seen corresponding path program 3 times [2022-01-19 05:00:13,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:13,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386689232] [2022-01-19 05:00:13,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:13,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:13,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:13,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386689232] [2022-01-19 05:00:13,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386689232] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:13,687 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:13,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 05:00:13,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248978148] [2022-01-19 05:00:13,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:13,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 05:00:13,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:13,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 05:00:13,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-01-19 05:00:13,689 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 152 [2022-01-19 05:00:13,690 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 272 transitions, 2167 flow. Second operand has 13 states, 13 states have (on average 117.23076923076923) internal successors, (1524), 13 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:13,690 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:13,690 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 152 [2022-01-19 05:00:13,690 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:14,658 INFO L129 PetriNetUnfolder]: 1268/3859 cut-off events. [2022-01-19 05:00:14,658 INFO L130 PetriNetUnfolder]: For 27102/27593 co-relation queries the response was YES. [2022-01-19 05:00:14,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16628 conditions, 3859 events. 1268/3859 cut-off events. For 27102/27593 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 33632 event pairs, 493 based on Foata normal form. 142/3884 useless extension candidates. Maximal degree in co-relation 16488. Up to 1137 conditions per place. [2022-01-19 05:00:14,705 INFO L132 encePairwiseOnDemand]: 137/152 looper letters, 139 selfloop transitions, 63 changer transitions 35/350 dead transitions. [2022-01-19 05:00:14,705 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 350 transitions, 3659 flow [2022-01-19 05:00:14,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 05:00:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 05:00:14,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2519 transitions. [2022-01-19 05:00:14,712 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7891604010025063 [2022-01-19 05:00:14,712 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2519 transitions. [2022-01-19 05:00:14,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2519 transitions. [2022-01-19 05:00:14,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:14,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2519 transitions. [2022-01-19 05:00:14,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 119.95238095238095) internal successors, (2519), 21 states have internal predecessors, (2519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:14,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 152.0) internal successors, (3344), 22 states have internal predecessors, (3344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:14,718 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 152.0) internal successors, (3344), 22 states have internal predecessors, (3344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:14,719 INFO L186 Difference]: Start difference. First operand has 243 places, 272 transitions, 2167 flow. Second operand 21 states and 2519 transitions. [2022-01-19 05:00:14,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 350 transitions, 3659 flow [2022-01-19 05:00:14,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 350 transitions, 3377 flow, removed 105 selfloop flow, removed 24 redundant places. [2022-01-19 05:00:14,767 INFO L242 Difference]: Finished difference. Result has 248 places, 283 transitions, 2362 flow [2022-01-19 05:00:14,768 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=1989, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2362, PETRI_PLACES=248, PETRI_TRANSITIONS=283} [2022-01-19 05:00:14,768 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 89 predicate places. [2022-01-19 05:00:14,769 INFO L470 AbstractCegarLoop]: Abstraction has has 248 places, 283 transitions, 2362 flow [2022-01-19 05:00:14,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 117.23076923076923) internal successors, (1524), 13 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:14,769 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:14,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:14,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 05:00:14,769 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 05:00:14,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:14,770 INFO L85 PathProgramCache]: Analyzing trace with hash 787477208, now seen corresponding path program 1 times [2022-01-19 05:00:14,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:14,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015059158] [2022-01-19 05:00:14,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:14,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:14,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:14,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015059158] [2022-01-19 05:00:14,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015059158] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:14,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:14,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 05:00:14,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842148048] [2022-01-19 05:00:14,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:14,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 05:00:14,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:14,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 05:00:14,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 05:00:14,895 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 152 [2022-01-19 05:00:14,895 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 283 transitions, 2362 flow. Second operand has 7 states, 7 states have (on average 127.71428571428571) internal successors, (894), 7 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) [2022-01-19 05:00:14,895 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:14,895 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 152 [2022-01-19 05:00:14,896 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:16,203 INFO L129 PetriNetUnfolder]: 2482/6862 cut-off events. [2022-01-19 05:00:16,203 INFO L130 PetriNetUnfolder]: For 60851/61759 co-relation queries the response was YES. [2022-01-19 05:00:16,249 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32104 conditions, 6862 events. 2482/6862 cut-off events. For 60851/61759 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 65446 event pairs, 449 based on Foata normal form. 168/6810 useless extension candidates. Maximal degree in co-relation 31970. Up to 1400 conditions per place. [2022-01-19 05:00:16,278 INFO L132 encePairwiseOnDemand]: 145/152 looper letters, 387 selfloop transitions, 11 changer transitions 3/539 dead transitions. [2022-01-19 05:00:16,278 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 539 transitions, 6552 flow [2022-01-19 05:00:16,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 05:00:16,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 05:00:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1069 transitions. [2022-01-19 05:00:16,282 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8791118421052632 [2022-01-19 05:00:16,282 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1069 transitions. [2022-01-19 05:00:16,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1069 transitions. [2022-01-19 05:00:16,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:16,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1069 transitions. [2022-01-19 05:00:16,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 133.625) internal successors, (1069), 8 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:16,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 152.0) internal successors, (1368), 9 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:16,285 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 152.0) internal successors, (1368), 9 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:16,285 INFO L186 Difference]: Start difference. First operand has 248 places, 283 transitions, 2362 flow. Second operand 8 states and 1069 transitions. [2022-01-19 05:00:16,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 539 transitions, 6552 flow [2022-01-19 05:00:16,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 539 transitions, 6233 flow, removed 157 selfloop flow, removed 15 redundant places. [2022-01-19 05:00:16,367 INFO L242 Difference]: Finished difference. Result has 233 places, 288 transitions, 2370 flow [2022-01-19 05:00:16,368 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=2269, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2370, PETRI_PLACES=233, PETRI_TRANSITIONS=288} [2022-01-19 05:00:16,368 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 74 predicate places. [2022-01-19 05:00:16,368 INFO L470 AbstractCegarLoop]: Abstraction has has 233 places, 288 transitions, 2370 flow [2022-01-19 05:00:16,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.71428571428571) internal successors, (894), 7 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) [2022-01-19 05:00:16,368 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:16,369 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:16,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 05:00:16,369 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 05:00:16,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:16,369 INFO L85 PathProgramCache]: Analyzing trace with hash 955914954, now seen corresponding path program 2 times [2022-01-19 05:00:16,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:16,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048104242] [2022-01-19 05:00:16,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:16,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:17,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:17,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048104242] [2022-01-19 05:00:17,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048104242] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:17,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:17,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 05:00:17,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130780169] [2022-01-19 05:00:17,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:17,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:00:17,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:17,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:00:17,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:00:17,427 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 152 [2022-01-19 05:00:17,428 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 288 transitions, 2370 flow. Second operand has 27 states, 27 states have (on average 92.66666666666667) internal successors, (2502), 27 states have internal predecessors, (2502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:17,428 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:17,428 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 152 [2022-01-19 05:00:17,428 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:20,962 INFO L129 PetriNetUnfolder]: 3004/8575 cut-off events. [2022-01-19 05:00:20,962 INFO L130 PetriNetUnfolder]: For 63195/64704 co-relation queries the response was YES. [2022-01-19 05:00:21,069 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36880 conditions, 8575 events. 3004/8575 cut-off events. For 63195/64704 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 87460 event pairs, 1018 based on Foata normal form. 410/8656 useless extension candidates. Maximal degree in co-relation 36734. Up to 3041 conditions per place. [2022-01-19 05:00:21,096 INFO L132 encePairwiseOnDemand]: 124/152 looper letters, 134 selfloop transitions, 146 changer transitions 67/440 dead transitions. [2022-01-19 05:00:21,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 440 transitions, 4950 flow [2022-01-19 05:00:21,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-19 05:00:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-01-19 05:00:21,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 3817 transitions. [2022-01-19 05:00:21,101 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6277960526315789 [2022-01-19 05:00:21,101 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 3817 transitions. [2022-01-19 05:00:21,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 3817 transitions. [2022-01-19 05:00:21,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:21,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 3817 transitions. [2022-01-19 05:00:21,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 95.425) internal successors, (3817), 40 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:21,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 152.0) internal successors, (6232), 41 states have internal predecessors, (6232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:21,112 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 152.0) internal successors, (6232), 41 states have internal predecessors, (6232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:21,112 INFO L186 Difference]: Start difference. First operand has 233 places, 288 transitions, 2370 flow. Second operand 40 states and 3817 transitions. [2022-01-19 05:00:21,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 440 transitions, 4950 flow [2022-01-19 05:00:21,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 440 transitions, 4859 flow, removed 42 selfloop flow, removed 2 redundant places. [2022-01-19 05:00:21,208 INFO L242 Difference]: Finished difference. Result has 281 places, 350 transitions, 3464 flow [2022-01-19 05:00:21,208 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=2331, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=3464, PETRI_PLACES=281, PETRI_TRANSITIONS=350} [2022-01-19 05:00:21,208 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 122 predicate places. [2022-01-19 05:00:21,209 INFO L470 AbstractCegarLoop]: Abstraction has has 281 places, 350 transitions, 3464 flow [2022-01-19 05:00:21,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 92.66666666666667) internal successors, (2502), 27 states have internal predecessors, (2502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:21,209 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:21,209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:21,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 05:00:21,210 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 05:00:21,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:21,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1113360434, now seen corresponding path program 1 times [2022-01-19 05:00:21,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:21,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440841662] [2022-01-19 05:00:21,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:21,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:21,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:21,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:21,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440841662] [2022-01-19 05:00:21,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440841662] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:21,319 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:21,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 05:00:21,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885353974] [2022-01-19 05:00:21,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:21,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 05:00:21,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:21,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 05:00:21,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 05:00:21,321 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 152 [2022-01-19 05:00:21,321 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 350 transitions, 3464 flow. Second operand has 8 states, 8 states have (on average 126.25) internal successors, (1010), 8 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:21,321 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:21,321 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 152 [2022-01-19 05:00:21,321 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:23,651 INFO L129 PetriNetUnfolder]: 6619/13232 cut-off events. [2022-01-19 05:00:23,651 INFO L130 PetriNetUnfolder]: For 156137/158204 co-relation queries the response was YES. [2022-01-19 05:00:23,835 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71290 conditions, 13232 events. 6619/13232 cut-off events. For 156137/158204 co-relation queries the response was YES. Maximal size of possible extension queue 915. Compared 120062 event pairs, 337 based on Foata normal form. 583/13197 useless extension candidates. Maximal degree in co-relation 71143. Up to 3974 conditions per place. [2022-01-19 05:00:23,863 INFO L132 encePairwiseOnDemand]: 142/152 looper letters, 325 selfloop transitions, 15 changer transitions 265/735 dead transitions. [2022-01-19 05:00:23,863 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 735 transitions, 10061 flow [2022-01-19 05:00:23,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 05:00:23,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 05:00:23,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1480 transitions. [2022-01-19 05:00:23,865 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8851674641148325 [2022-01-19 05:00:23,865 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1480 transitions. [2022-01-19 05:00:23,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1480 transitions. [2022-01-19 05:00:23,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:23,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1480 transitions. [2022-01-19 05:00:23,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 134.54545454545453) internal successors, (1480), 11 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:23,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 152.0) internal successors, (1824), 12 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:23,868 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 152.0) internal successors, (1824), 12 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:23,868 INFO L186 Difference]: Start difference. First operand has 281 places, 350 transitions, 3464 flow. Second operand 11 states and 1480 transitions. [2022-01-19 05:00:23,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 735 transitions, 10061 flow [2022-01-19 05:00:24,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 735 transitions, 8900 flow, removed 489 selfloop flow, removed 31 redundant places. [2022-01-19 05:00:24,249 INFO L242 Difference]: Finished difference. Result has 255 places, 304 transitions, 2554 flow [2022-01-19 05:00:24,249 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=3019, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2554, PETRI_PLACES=255, PETRI_TRANSITIONS=304} [2022-01-19 05:00:24,249 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 96 predicate places. [2022-01-19 05:00:24,249 INFO L470 AbstractCegarLoop]: Abstraction has has 255 places, 304 transitions, 2554 flow [2022-01-19 05:00:24,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 126.25) internal successors, (1010), 8 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:24,250 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:24,250 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:24,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 05:00:24,250 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 05:00:24,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:24,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1483631827, now seen corresponding path program 1 times [2022-01-19 05:00:24,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:24,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083962348] [2022-01-19 05:00:24,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:24,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:25,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:25,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083962348] [2022-01-19 05:00:25,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083962348] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:25,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:25,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-19 05:00:25,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557960904] [2022-01-19 05:00:25,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:25,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-19 05:00:25,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:25,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-19 05:00:25,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2022-01-19 05:00:25,107 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 152 [2022-01-19 05:00:25,108 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 304 transitions, 2554 flow. Second operand has 25 states, 25 states have (on average 94.76) internal successors, (2369), 25 states have internal predecessors, (2369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:25,108 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:25,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 152 [2022-01-19 05:00:25,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:26,553 INFO L129 PetriNetUnfolder]: 1442/4605 cut-off events. [2022-01-19 05:00:26,553 INFO L130 PetriNetUnfolder]: For 32689/34065 co-relation queries the response was YES. [2022-01-19 05:00:26,586 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20058 conditions, 4605 events. 1442/4605 cut-off events. For 32689/34065 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 45841 event pairs, 364 based on Foata normal form. 363/4778 useless extension candidates. Maximal degree in co-relation 19907. Up to 1186 conditions per place. [2022-01-19 05:00:26,597 INFO L132 encePairwiseOnDemand]: 128/152 looper letters, 149 selfloop transitions, 95 changer transitions 14/361 dead transitions. [2022-01-19 05:00:26,597 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 361 transitions, 3781 flow [2022-01-19 05:00:26,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-19 05:00:26,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-01-19 05:00:26,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2706 transitions. [2022-01-19 05:00:26,600 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6358082706766918 [2022-01-19 05:00:26,600 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 2706 transitions. [2022-01-19 05:00:26,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 2706 transitions. [2022-01-19 05:00:26,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:26,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 2706 transitions. [2022-01-19 05:00:26,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 96.64285714285714) internal successors, (2706), 28 states have internal predecessors, (2706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:26,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 152.0) internal successors, (4408), 29 states have internal predecessors, (4408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:26,605 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 152.0) internal successors, (4408), 29 states have internal predecessors, (4408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:26,606 INFO L186 Difference]: Start difference. First operand has 255 places, 304 transitions, 2554 flow. Second operand 28 states and 2706 transitions. [2022-01-19 05:00:26,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 361 transitions, 3781 flow [2022-01-19 05:00:26,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 361 transitions, 3646 flow, removed 54 selfloop flow, removed 10 redundant places. [2022-01-19 05:00:26,707 INFO L242 Difference]: Finished difference. Result has 268 places, 325 transitions, 3052 flow [2022-01-19 05:00:26,707 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=2425, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=3052, PETRI_PLACES=268, PETRI_TRANSITIONS=325} [2022-01-19 05:00:26,708 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 109 predicate places. [2022-01-19 05:00:26,708 INFO L470 AbstractCegarLoop]: Abstraction has has 268 places, 325 transitions, 3052 flow [2022-01-19 05:00:26,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 94.76) internal successors, (2369), 25 states have internal predecessors, (2369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:26,708 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:26,708 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:26,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 05:00:26,708 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 05:00:26,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:26,709 INFO L85 PathProgramCache]: Analyzing trace with hash 643118041, now seen corresponding path program 2 times [2022-01-19 05:00:26,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:26,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119213010] [2022-01-19 05:00:26,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:26,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:27,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:27,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119213010] [2022-01-19 05:00:27,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119213010] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:27,508 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:27,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-19 05:00:27,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043445086] [2022-01-19 05:00:27,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:27,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-19 05:00:27,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:27,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-19 05:00:27,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2022-01-19 05:00:27,509 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 152 [2022-01-19 05:00:27,510 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 325 transitions, 3052 flow. Second operand has 25 states, 25 states have (on average 95.72) internal successors, (2393), 25 states have internal predecessors, (2393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:27,510 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:27,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 152 [2022-01-19 05:00:27,511 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:29,317 INFO L129 PetriNetUnfolder]: 1895/6167 cut-off events. [2022-01-19 05:00:29,317 INFO L130 PetriNetUnfolder]: For 41554/43119 co-relation queries the response was YES. [2022-01-19 05:00:29,370 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24686 conditions, 6167 events. 1895/6167 cut-off events. For 41554/43119 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 66777 event pairs, 417 based on Foata normal form. 484/6397 useless extension candidates. Maximal degree in co-relation 24521. Up to 1321 conditions per place. [2022-01-19 05:00:29,385 INFO L132 encePairwiseOnDemand]: 128/152 looper letters, 185 selfloop transitions, 115 changer transitions 14/418 dead transitions. [2022-01-19 05:00:29,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 418 transitions, 4869 flow [2022-01-19 05:00:29,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-19 05:00:29,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-01-19 05:00:29,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 3036 transitions. [2022-01-19 05:00:29,388 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6443123938879457 [2022-01-19 05:00:29,388 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 3036 transitions. [2022-01-19 05:00:29,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 3036 transitions. [2022-01-19 05:00:29,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:29,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 3036 transitions. [2022-01-19 05:00:29,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 97.93548387096774) internal successors, (3036), 31 states have internal predecessors, (3036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:29,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 152.0) internal successors, (4864), 32 states have internal predecessors, (4864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:29,394 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 152.0) internal successors, (4864), 32 states have internal predecessors, (4864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:29,394 INFO L186 Difference]: Start difference. First operand has 268 places, 325 transitions, 3052 flow. Second operand 31 states and 3036 transitions. [2022-01-19 05:00:29,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 418 transitions, 4869 flow [2022-01-19 05:00:29,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 418 transitions, 4724 flow, removed 49 selfloop flow, removed 21 redundant places. [2022-01-19 05:00:29,542 INFO L242 Difference]: Finished difference. Result has 281 places, 361 transitions, 3862 flow [2022-01-19 05:00:29,542 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=2956, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=3862, PETRI_PLACES=281, PETRI_TRANSITIONS=361} [2022-01-19 05:00:29,542 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 122 predicate places. [2022-01-19 05:00:29,542 INFO L470 AbstractCegarLoop]: Abstraction has has 281 places, 361 transitions, 3862 flow [2022-01-19 05:00:29,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 95.72) internal successors, (2393), 25 states have internal predecessors, (2393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:29,543 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:29,543 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:29,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 05:00:29,543 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 05:00:29,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:29,543 INFO L85 PathProgramCache]: Analyzing trace with hash -221029267, now seen corresponding path program 3 times [2022-01-19 05:00:29,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:29,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959360694] [2022-01-19 05:00:29,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:29,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:30,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:30,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959360694] [2022-01-19 05:00:30,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959360694] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:30,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:30,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-19 05:00:30,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853831052] [2022-01-19 05:00:30,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:30,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-19 05:00:30,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:30,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-19 05:00:30,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2022-01-19 05:00:30,678 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 152 [2022-01-19 05:00:30,679 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 361 transitions, 3862 flow. Second operand has 28 states, 28 states have (on average 91.67857142857143) internal successors, (2567), 28 states have internal predecessors, (2567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:30,679 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:30,679 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 152 [2022-01-19 05:00:30,679 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:32,687 INFO L129 PetriNetUnfolder]: 2018/6572 cut-off events. [2022-01-19 05:00:32,687 INFO L130 PetriNetUnfolder]: For 50578/51995 co-relation queries the response was YES. [2022-01-19 05:00:32,741 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27741 conditions, 6572 events. 2018/6572 cut-off events. For 50578/51995 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 72242 event pairs, 478 based on Foata normal form. 361/6666 useless extension candidates. Maximal degree in co-relation 27567. Up to 1702 conditions per place. [2022-01-19 05:00:32,758 INFO L132 encePairwiseOnDemand]: 125/152 looper letters, 241 selfloop transitions, 78 changer transitions 14/433 dead transitions. [2022-01-19 05:00:32,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 433 transitions, 5551 flow [2022-01-19 05:00:32,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-19 05:00:32,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-01-19 05:00:32,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 3079 transitions. [2022-01-19 05:00:32,761 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.613835725677831 [2022-01-19 05:00:32,761 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 3079 transitions. [2022-01-19 05:00:32,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 3079 transitions. [2022-01-19 05:00:32,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:32,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 3079 transitions. [2022-01-19 05:00:32,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 93.3030303030303) internal successors, (3079), 33 states have internal predecessors, (3079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:32,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 152.0) internal successors, (5168), 34 states have internal predecessors, (5168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:32,767 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 152.0) internal successors, (5168), 34 states have internal predecessors, (5168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:32,767 INFO L186 Difference]: Start difference. First operand has 281 places, 361 transitions, 3862 flow. Second operand 33 states and 3079 transitions. [2022-01-19 05:00:32,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 433 transitions, 5551 flow [2022-01-19 05:00:32,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 433 transitions, 5412 flow, removed 45 selfloop flow, removed 22 redundant places. [2022-01-19 05:00:32,926 INFO L242 Difference]: Finished difference. Result has 296 places, 389 transitions, 4524 flow [2022-01-19 05:00:32,926 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=3753, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=4524, PETRI_PLACES=296, PETRI_TRANSITIONS=389} [2022-01-19 05:00:32,926 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 137 predicate places. [2022-01-19 05:00:32,926 INFO L470 AbstractCegarLoop]: Abstraction has has 296 places, 389 transitions, 4524 flow [2022-01-19 05:00:32,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 91.67857142857143) internal successors, (2567), 28 states have internal predecessors, (2567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:32,927 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:32,927 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:32,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 05:00:32,927 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 05:00:32,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:32,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1323642483, now seen corresponding path program 4 times [2022-01-19 05:00:32,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:32,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144850309] [2022-01-19 05:00:32,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:32,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:33,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:33,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:33,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144850309] [2022-01-19 05:00:33,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144850309] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:33,343 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:33,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-19 05:00:33,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037271034] [2022-01-19 05:00:33,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:33,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 05:00:33,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:33,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 05:00:33,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2022-01-19 05:00:33,344 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 152 [2022-01-19 05:00:33,345 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 389 transitions, 4524 flow. Second operand has 18 states, 18 states have (on average 112.88888888888889) internal successors, (2032), 18 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:33,345 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:33,345 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 152 [2022-01-19 05:00:33,345 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:34,958 INFO L129 PetriNetUnfolder]: 2201/7003 cut-off events. [2022-01-19 05:00:34,958 INFO L130 PetriNetUnfolder]: For 61862/64025 co-relation queries the response was YES. [2022-01-19 05:00:35,037 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30840 conditions, 7003 events. 2201/7003 cut-off events. For 61862/64025 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 77801 event pairs, 452 based on Foata normal form. 653/7361 useless extension candidates. Maximal degree in co-relation 30667. Up to 1622 conditions per place. [2022-01-19 05:00:35,059 INFO L132 encePairwiseOnDemand]: 134/152 looper letters, 214 selfloop transitions, 89 changer transitions 19/441 dead transitions. [2022-01-19 05:00:35,059 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 441 transitions, 5893 flow [2022-01-19 05:00:35,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-19 05:00:35,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-01-19 05:00:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2642 transitions. [2022-01-19 05:00:35,065 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.755720823798627 [2022-01-19 05:00:35,065 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2642 transitions. [2022-01-19 05:00:35,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2642 transitions. [2022-01-19 05:00:35,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:35,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2642 transitions. [2022-01-19 05:00:35,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 114.8695652173913) internal successors, (2642), 23 states have internal predecessors, (2642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:35,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 152.0) internal successors, (3648), 24 states have internal predecessors, (3648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:35,074 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 152.0) internal successors, (3648), 24 states have internal predecessors, (3648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:35,074 INFO L186 Difference]: Start difference. First operand has 296 places, 389 transitions, 4524 flow. Second operand 23 states and 2642 transitions. [2022-01-19 05:00:35,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 441 transitions, 5893 flow [2022-01-19 05:00:35,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 441 transitions, 5743 flow, removed 29 selfloop flow, removed 27 redundant places. [2022-01-19 05:00:35,333 INFO L242 Difference]: Finished difference. Result has 298 places, 397 transitions, 4851 flow [2022-01-19 05:00:35,334 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=4398, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4851, PETRI_PLACES=298, PETRI_TRANSITIONS=397} [2022-01-19 05:00:35,334 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 139 predicate places. [2022-01-19 05:00:35,334 INFO L470 AbstractCegarLoop]: Abstraction has has 298 places, 397 transitions, 4851 flow [2022-01-19 05:00:35,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 112.88888888888889) internal successors, (2032), 18 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:35,335 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:35,335 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:35,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 05:00:35,335 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 05:00:35,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:35,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1429985361, now seen corresponding path program 1 times [2022-01-19 05:00:35,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:35,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658422790] [2022-01-19 05:00:35,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:35,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:35,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:35,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:35,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658422790] [2022-01-19 05:00:35,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658422790] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:35,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:35,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-19 05:00:35,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382879452] [2022-01-19 05:00:35,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:35,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 05:00:35,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:35,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 05:00:35,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-01-19 05:00:35,684 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 152 [2022-01-19 05:00:35,684 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 397 transitions, 4851 flow. Second operand has 15 states, 15 states have (on average 112.4) internal successors, (1686), 15 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:35,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:35,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 152 [2022-01-19 05:00:35,684 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:37,642 INFO L129 PetriNetUnfolder]: 2678/8727 cut-off events. [2022-01-19 05:00:37,642 INFO L130 PetriNetUnfolder]: For 84119/86750 co-relation queries the response was YES. [2022-01-19 05:00:37,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38587 conditions, 8727 events. 2678/8727 cut-off events. For 84119/86750 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 100894 event pairs, 586 based on Foata normal form. 744/9081 useless extension candidates. Maximal degree in co-relation 38412. Up to 1824 conditions per place. [2022-01-19 05:00:37,747 INFO L132 encePairwiseOnDemand]: 138/152 looper letters, 188 selfloop transitions, 157 changer transitions 10/473 dead transitions. [2022-01-19 05:00:37,748 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 473 transitions, 6683 flow [2022-01-19 05:00:37,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 05:00:37,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 05:00:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1860 transitions. [2022-01-19 05:00:37,749 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7648026315789473 [2022-01-19 05:00:37,749 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1860 transitions. [2022-01-19 05:00:37,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1860 transitions. [2022-01-19 05:00:37,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:37,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1860 transitions. [2022-01-19 05:00:37,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 116.25) internal successors, (1860), 16 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:37,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 152.0) internal successors, (2584), 17 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:37,753 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 152.0) internal successors, (2584), 17 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:37,753 INFO L186 Difference]: Start difference. First operand has 298 places, 397 transitions, 4851 flow. Second operand 16 states and 1860 transitions. [2022-01-19 05:00:37,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 473 transitions, 6683 flow [2022-01-19 05:00:37,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 473 transitions, 6504 flow, removed 81 selfloop flow, removed 17 redundant places. [2022-01-19 05:00:37,993 INFO L242 Difference]: Finished difference. Result has 296 places, 408 transitions, 5491 flow [2022-01-19 05:00:37,994 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=4770, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5491, PETRI_PLACES=296, PETRI_TRANSITIONS=408} [2022-01-19 05:00:37,994 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 137 predicate places. [2022-01-19 05:00:37,994 INFO L470 AbstractCegarLoop]: Abstraction has has 296 places, 408 transitions, 5491 flow [2022-01-19 05:00:37,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 112.4) internal successors, (1686), 15 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:37,994 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:37,994 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:37,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-19 05:00:37,994 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 05:00:37,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:37,995 INFO L85 PathProgramCache]: Analyzing trace with hash -3122253, now seen corresponding path program 2 times [2022-01-19 05:00:37,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:37,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087282769] [2022-01-19 05:00:37,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:37,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:38,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:38,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087282769] [2022-01-19 05:00:38,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087282769] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:38,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:38,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 05:00:38,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660683225] [2022-01-19 05:00:38,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:38,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 05:00:38,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:38,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 05:00:38,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-19 05:00:38,158 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 152 [2022-01-19 05:00:38,159 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 408 transitions, 5491 flow. Second operand has 9 states, 9 states have (on average 126.33333333333333) internal successors, (1137), 9 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:38,159 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:38,159 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 152 [2022-01-19 05:00:38,159 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:41,783 INFO L129 PetriNetUnfolder]: 9048/19663 cut-off events. [2022-01-19 05:00:41,783 INFO L130 PetriNetUnfolder]: For 404947/407784 co-relation queries the response was YES. [2022-01-19 05:00:42,022 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124393 conditions, 19663 events. 9048/19663 cut-off events. For 404947/407784 co-relation queries the response was YES. Maximal size of possible extension queue 1970. Compared 215315 event pairs, 648 based on Foata normal form. 470/18927 useless extension candidates. Maximal degree in co-relation 124310. Up to 6172 conditions per place. [2022-01-19 05:00:42,065 INFO L132 encePairwiseOnDemand]: 142/152 looper letters, 539 selfloop transitions, 19 changer transitions 115/807 dead transitions. [2022-01-19 05:00:42,065 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 807 transitions, 14834 flow [2022-01-19 05:00:42,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 05:00:42,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 05:00:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1574 transitions. [2022-01-19 05:00:42,067 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8629385964912281 [2022-01-19 05:00:42,067 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1574 transitions. [2022-01-19 05:00:42,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1574 transitions. [2022-01-19 05:00:42,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:42,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1574 transitions. [2022-01-19 05:00:42,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 131.16666666666666) internal successors, (1574), 12 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:42,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 152.0) internal successors, (1976), 13 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:42,070 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 152.0) internal successors, (1976), 13 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:42,070 INFO L186 Difference]: Start difference. First operand has 296 places, 408 transitions, 5491 flow. Second operand 12 states and 1574 transitions. [2022-01-19 05:00:42,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 807 transitions, 14834 flow [2022-01-19 05:00:43,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 807 transitions, 14135 flow, removed 123 selfloop flow, removed 20 redundant places. [2022-01-19 05:00:43,658 INFO L242 Difference]: Finished difference. Result has 287 places, 398 transitions, 5140 flow [2022-01-19 05:00:43,659 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=5202, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5140, PETRI_PLACES=287, PETRI_TRANSITIONS=398} [2022-01-19 05:00:43,659 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 128 predicate places. [2022-01-19 05:00:43,659 INFO L470 AbstractCegarLoop]: Abstraction has has 287 places, 398 transitions, 5140 flow [2022-01-19 05:00:43,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 126.33333333333333) internal successors, (1137), 9 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:43,660 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:43,660 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:43,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-19 05:00:43,660 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 05:00:43,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:43,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1053123448, now seen corresponding path program 1 times [2022-01-19 05:00:43,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:43,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605537100] [2022-01-19 05:00:43,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:43,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:44,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:44,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:44,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605537100] [2022-01-19 05:00:44,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605537100] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:44,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:44,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-19 05:00:44,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225278527] [2022-01-19 05:00:44,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:44,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-19 05:00:44,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:44,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-19 05:00:44,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-01-19 05:00:44,188 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 152 [2022-01-19 05:00:44,188 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 398 transitions, 5140 flow. Second operand has 20 states, 20 states have (on average 99.15) internal successors, (1983), 20 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:44,188 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:44,189 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 152 [2022-01-19 05:00:44,189 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:47,375 INFO L129 PetriNetUnfolder]: 4519/14852 cut-off events. [2022-01-19 05:00:47,376 INFO L130 PetriNetUnfolder]: For 107302/111903 co-relation queries the response was YES. [2022-01-19 05:00:47,710 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62756 conditions, 14852 events. 4519/14852 cut-off events. For 107302/111903 co-relation queries the response was YES. Maximal size of possible extension queue 1794. Compared 198817 event pairs, 610 based on Foata normal form. 590/14628 useless extension candidates. Maximal degree in co-relation 62592. Up to 2639 conditions per place. [2022-01-19 05:00:47,746 INFO L132 encePairwiseOnDemand]: 133/152 looper letters, 247 selfloop transitions, 164 changer transitions 19/536 dead transitions. [2022-01-19 05:00:47,747 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 536 transitions, 8138 flow [2022-01-19 05:00:47,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 05:00:47,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 05:00:47,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1867 transitions. [2022-01-19 05:00:47,749 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6823830409356725 [2022-01-19 05:00:47,749 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1867 transitions. [2022-01-19 05:00:47,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1867 transitions. [2022-01-19 05:00:47,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:47,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1867 transitions. [2022-01-19 05:00:47,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 103.72222222222223) internal successors, (1867), 18 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:47,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 152.0) internal successors, (2888), 19 states have internal predecessors, (2888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:47,753 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 152.0) internal successors, (2888), 19 states have internal predecessors, (2888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:47,753 INFO L186 Difference]: Start difference. First operand has 287 places, 398 transitions, 5140 flow. Second operand 18 states and 1867 transitions. [2022-01-19 05:00:47,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 536 transitions, 8138 flow [2022-01-19 05:00:48,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 536 transitions, 7173 flow, removed 428 selfloop flow, removed 24 redundant places. [2022-01-19 05:00:48,737 INFO L242 Difference]: Finished difference. Result has 282 places, 458 transitions, 6083 flow [2022-01-19 05:00:48,737 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=4617, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6083, PETRI_PLACES=282, PETRI_TRANSITIONS=458} [2022-01-19 05:00:48,738 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 123 predicate places. [2022-01-19 05:00:48,738 INFO L470 AbstractCegarLoop]: Abstraction has has 282 places, 458 transitions, 6083 flow [2022-01-19 05:00:48,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 99.15) internal successors, (1983), 20 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:48,738 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:48,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:48,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-19 05:00:48,738 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 05:00:48,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:48,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1535785186, now seen corresponding path program 2 times [2022-01-19 05:00:48,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:48,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013595796] [2022-01-19 05:00:48,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:48,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:49,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:49,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013595796] [2022-01-19 05:00:49,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013595796] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:49,324 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:49,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 05:00:49,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965636475] [2022-01-19 05:00:49,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:49,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 05:00:49,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:49,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 05:00:49,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-01-19 05:00:49,326 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 152 [2022-01-19 05:00:49,327 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 458 transitions, 6083 flow. Second operand has 19 states, 19 states have (on average 100.21052631578948) internal successors, (1904), 19 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:49,327 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:49,327 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 152 [2022-01-19 05:00:49,327 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:53,175 INFO L129 PetriNetUnfolder]: 7056/24076 cut-off events. [2022-01-19 05:00:53,175 INFO L130 PetriNetUnfolder]: For 95312/99756 co-relation queries the response was YES. [2022-01-19 05:00:53,367 INFO L84 FinitePrefix]: Finished finitePrefix Result has 69023 conditions, 24076 events. 7056/24076 cut-off events. For 95312/99756 co-relation queries the response was YES. Maximal size of possible extension queue 3231. Compared 353016 event pairs, 879 based on Foata normal form. 775/23416 useless extension candidates. Maximal degree in co-relation 68955. Up to 3928 conditions per place. [2022-01-19 05:00:53,398 INFO L132 encePairwiseOnDemand]: 134/152 looper letters, 229 selfloop transitions, 140 changer transitions 60/536 dead transitions. [2022-01-19 05:00:53,398 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 536 transitions, 8039 flow [2022-01-19 05:00:53,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 05:00:53,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 05:00:53,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1758 transitions. [2022-01-19 05:00:53,399 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6803405572755418 [2022-01-19 05:00:53,399 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1758 transitions. [2022-01-19 05:00:53,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1758 transitions. [2022-01-19 05:00:53,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:53,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1758 transitions. [2022-01-19 05:00:53,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 103.41176470588235) internal successors, (1758), 17 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:53,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 152.0) internal successors, (2736), 18 states have internal predecessors, (2736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:53,402 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 152.0) internal successors, (2736), 18 states have internal predecessors, (2736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:53,402 INFO L186 Difference]: Start difference. First operand has 282 places, 458 transitions, 6083 flow. Second operand 17 states and 1758 transitions. [2022-01-19 05:00:53,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 536 transitions, 8039 flow [2022-01-19 05:00:53,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 536 transitions, 7897 flow, removed 38 selfloop flow, removed 8 redundant places. [2022-01-19 05:00:53,720 INFO L242 Difference]: Finished difference. Result has 296 places, 455 transitions, 6448 flow [2022-01-19 05:00:53,720 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=5975, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=6448, PETRI_PLACES=296, PETRI_TRANSITIONS=455} [2022-01-19 05:00:53,721 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 137 predicate places. [2022-01-19 05:00:53,721 INFO L470 AbstractCegarLoop]: Abstraction has has 296 places, 455 transitions, 6448 flow [2022-01-19 05:00:53,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 100.21052631578948) internal successors, (1904), 19 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:53,721 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:00:53,721 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:00:53,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-19 05:00:53,721 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 05:00:53,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:00:53,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1200441168, now seen corresponding path program 3 times [2022-01-19 05:00:53,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:00:53,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044047531] [2022-01-19 05:00:53,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:00:53,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:00:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:00:54,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:00:54,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:00:54,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044047531] [2022-01-19 05:00:54,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044047531] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:00:54,516 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:00:54,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-19 05:00:54,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027396208] [2022-01-19 05:00:54,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:00:54,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-19 05:00:54,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:00:54,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-19 05:00:54,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2022-01-19 05:00:54,519 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 152 [2022-01-19 05:00:54,520 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 455 transitions, 6448 flow. Second operand has 21 states, 21 states have (on average 96.19047619047619) internal successors, (2020), 21 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:54,520 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:00:54,520 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 152 [2022-01-19 05:00:54,520 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:00:59,406 INFO L129 PetriNetUnfolder]: 7397/25634 cut-off events. [2022-01-19 05:00:59,407 INFO L130 PetriNetUnfolder]: For 106518/111182 co-relation queries the response was YES. [2022-01-19 05:00:59,660 INFO L84 FinitePrefix]: Finished finitePrefix Result has 72053 conditions, 25634 events. 7397/25634 cut-off events. For 106518/111182 co-relation queries the response was YES. Maximal size of possible extension queue 3536. Compared 381987 event pairs, 855 based on Foata normal form. 705/24757 useless extension candidates. Maximal degree in co-relation 71964. Up to 4222 conditions per place. [2022-01-19 05:00:59,693 INFO L132 encePairwiseOnDemand]: 135/152 looper letters, 237 selfloop transitions, 138 changer transitions 51/529 dead transitions. [2022-01-19 05:00:59,693 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 529 transitions, 8226 flow [2022-01-19 05:00:59,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-19 05:00:59,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-19 05:00:59,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2180 transitions. [2022-01-19 05:00:59,695 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6519138755980861 [2022-01-19 05:00:59,695 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2180 transitions. [2022-01-19 05:00:59,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2180 transitions. [2022-01-19 05:00:59,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:00:59,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2180 transitions. [2022-01-19 05:00:59,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 99.0909090909091) internal successors, (2180), 22 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:59,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 152.0) internal successors, (3496), 23 states have internal predecessors, (3496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:59,699 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 152.0) internal successors, (3496), 23 states have internal predecessors, (3496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:00:59,699 INFO L186 Difference]: Start difference. First operand has 296 places, 455 transitions, 6448 flow. Second operand 22 states and 2180 transitions. [2022-01-19 05:00:59,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 529 transitions, 8226 flow [2022-01-19 05:01:00,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 529 transitions, 8089 flow, removed 63 selfloop flow, removed 11 redundant places. [2022-01-19 05:01:00,202 INFO L242 Difference]: Finished difference. Result has 311 places, 456 transitions, 6764 flow [2022-01-19 05:01:00,202 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=6379, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=6764, PETRI_PLACES=311, PETRI_TRANSITIONS=456} [2022-01-19 05:01:00,202 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 152 predicate places. [2022-01-19 05:01:00,202 INFO L470 AbstractCegarLoop]: Abstraction has has 311 places, 456 transitions, 6764 flow [2022-01-19 05:01:00,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 96.19047619047619) internal successors, (2020), 21 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:00,203 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:00,203 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:01:00,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-19 05:01:00,203 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 05:01:00,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:00,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1011261858, now seen corresponding path program 4 times [2022-01-19 05:01:00,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:00,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821275538] [2022-01-19 05:01:00,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:00,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:01,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:01,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:01,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821275538] [2022-01-19 05:01:01,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821275538] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:01,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:01,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-01-19 05:01:01,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096024669] [2022-01-19 05:01:01,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:01,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-19 05:01:01,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:01,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-19 05:01:01,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2022-01-19 05:01:01,286 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 152 [2022-01-19 05:01:01,287 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 456 transitions, 6764 flow. Second operand has 26 states, 26 states have (on average 90.92307692307692) internal successors, (2364), 26 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:01,287 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:01,287 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 152 [2022-01-19 05:01:01,287 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:06,103 INFO L129 PetriNetUnfolder]: 7090/24754 cut-off events. [2022-01-19 05:01:06,103 INFO L130 PetriNetUnfolder]: For 110724/114916 co-relation queries the response was YES. [2022-01-19 05:01:06,372 INFO L84 FinitePrefix]: Finished finitePrefix Result has 72392 conditions, 24754 events. 7090/24754 cut-off events. For 110724/114916 co-relation queries the response was YES. Maximal size of possible extension queue 3317. Compared 367299 event pairs, 856 based on Foata normal form. 205/23544 useless extension candidates. Maximal degree in co-relation 72285. Up to 4052 conditions per place. [2022-01-19 05:01:06,403 INFO L132 encePairwiseOnDemand]: 128/152 looper letters, 370 selfloop transitions, 35 changer transitions 14/518 dead transitions. [2022-01-19 05:01:06,403 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 518 transitions, 8454 flow [2022-01-19 05:01:06,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-19 05:01:06,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-01-19 05:01:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2605 transitions. [2022-01-19 05:01:06,405 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6120770676691729 [2022-01-19 05:01:06,405 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 2605 transitions. [2022-01-19 05:01:06,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 2605 transitions. [2022-01-19 05:01:06,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:06,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 2605 transitions. [2022-01-19 05:01:06,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 93.03571428571429) internal successors, (2605), 28 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:06,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 152.0) internal successors, (4408), 29 states have internal predecessors, (4408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:06,409 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 152.0) internal successors, (4408), 29 states have internal predecessors, (4408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:06,409 INFO L186 Difference]: Start difference. First operand has 311 places, 456 transitions, 6764 flow. Second operand 28 states and 2605 transitions. [2022-01-19 05:01:06,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 518 transitions, 8454 flow [2022-01-19 05:01:06,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 518 transitions, 8135 flow, removed 56 selfloop flow, removed 17 redundant places. [2022-01-19 05:01:06,817 INFO L242 Difference]: Finished difference. Result has 326 places, 478 transitions, 7069 flow [2022-01-19 05:01:06,817 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=6524, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=7069, PETRI_PLACES=326, PETRI_TRANSITIONS=478} [2022-01-19 05:01:06,817 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 167 predicate places. [2022-01-19 05:01:06,817 INFO L470 AbstractCegarLoop]: Abstraction has has 326 places, 478 transitions, 7069 flow [2022-01-19 05:01:06,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 90.92307692307692) internal successors, (2364), 26 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:06,818 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:06,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:01:06,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-19 05:01:06,818 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 05:01:06,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:06,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1970919910, now seen corresponding path program 5 times [2022-01-19 05:01:06,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:06,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114306802] [2022-01-19 05:01:06,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:06,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:08,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:08,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:08,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114306802] [2022-01-19 05:01:08,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114306802] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:08,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:08,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-01-19 05:01:08,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265186916] [2022-01-19 05:01:08,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:08,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-19 05:01:08,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:08,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-19 05:01:08,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2022-01-19 05:01:08,245 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 152 [2022-01-19 05:01:08,246 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 478 transitions, 7069 flow. Second operand has 24 states, 24 states have (on average 94.04166666666667) internal successors, (2257), 24 states have internal predecessors, (2257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:08,246 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:08,246 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 152 [2022-01-19 05:01:08,246 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:16,468 INFO L129 PetriNetUnfolder]: 10699/36992 cut-off events. [2022-01-19 05:01:16,469 INFO L130 PetriNetUnfolder]: For 148930/157916 co-relation queries the response was YES. [2022-01-19 05:01:17,084 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104621 conditions, 36992 events. 10699/36992 cut-off events. For 148930/157916 co-relation queries the response was YES. Maximal size of possible extension queue 5118. Compared 577305 event pairs, 647 based on Foata normal form. 878/35869 useless extension candidates. Maximal degree in co-relation 104493. Up to 6148 conditions per place. [2022-01-19 05:01:17,274 INFO L132 encePairwiseOnDemand]: 131/152 looper letters, 298 selfloop transitions, 236 changer transitions 53/683 dead transitions. [2022-01-19 05:01:17,275 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 683 transitions, 11034 flow [2022-01-19 05:01:17,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-19 05:01:17,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-01-19 05:01:17,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 3055 transitions. [2022-01-19 05:01:17,278 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6483446519524618 [2022-01-19 05:01:17,278 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 3055 transitions. [2022-01-19 05:01:17,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 3055 transitions. [2022-01-19 05:01:17,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:17,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 3055 transitions. [2022-01-19 05:01:17,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 98.54838709677419) internal successors, (3055), 31 states have internal predecessors, (3055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:17,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 152.0) internal successors, (4864), 32 states have internal predecessors, (4864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:17,284 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 152.0) internal successors, (4864), 32 states have internal predecessors, (4864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:17,284 INFO L186 Difference]: Start difference. First operand has 326 places, 478 transitions, 7069 flow. Second operand 31 states and 3055 transitions. [2022-01-19 05:01:17,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 683 transitions, 11034 flow [2022-01-19 05:01:17,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 683 transitions, 10661 flow, removed 177 selfloop flow, removed 16 redundant places. [2022-01-19 05:01:17,833 INFO L242 Difference]: Finished difference. Result has 354 places, 539 transitions, 8729 flow [2022-01-19 05:01:17,834 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=6878, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=8729, PETRI_PLACES=354, PETRI_TRANSITIONS=539} [2022-01-19 05:01:17,834 INFO L334 CegarLoopForPetriNet]: 159 programPoint places, 195 predicate places. [2022-01-19 05:01:17,834 INFO L470 AbstractCegarLoop]: Abstraction has has 354 places, 539 transitions, 8729 flow [2022-01-19 05:01:17,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 94.04166666666667) internal successors, (2257), 24 states have internal predecessors, (2257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:17,834 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:17,834 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:01:17,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-19 05:01:17,834 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 05:01:17,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:17,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1624387860, now seen corresponding path program 6 times [2022-01-19 05:01:17,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:17,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687601056] [2022-01-19 05:01:17,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:17,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 05:01:17,925 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 05:01:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 05:01:18,072 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 05:01:18,072 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 05:01:18,073 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-19 05:01:18,075 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-19 05:01:18,075 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-01-19 05:01:18,075 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-01-19 05:01:18,075 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-01-19 05:01:18,075 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-01-19 05:01:18,075 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-19 05:01:18,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-19 05:01:18,078 INFO L732 BasicCegarLoop]: Path program histogram: [6, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:01:18,081 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 05:01:18,081 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 05:01:18,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 05:01:18 BasicIcfg [2022-01-19 05:01:18,264 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 05:01:18,264 INFO L158 Benchmark]: Toolchain (without parser) took 88228.90ms. Allocated memory was 402.7MB in the beginning and 9.5GB in the end (delta: 9.1GB). Free memory was 347.7MB in the beginning and 6.6GB in the end (delta: -6.3GB). Peak memory consumption was 2.8GB. Max. memory is 16.0GB. [2022-01-19 05:01:18,264 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 402.7MB. Free memory is still 365.6MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 05:01:18,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.25ms. Allocated memory was 402.7MB in the beginning and 616.6MB in the end (delta: 213.9MB). Free memory was 347.5MB in the beginning and 575.1MB in the end (delta: -227.7MB). Peak memory consumption was 9.0MB. Max. memory is 16.0GB. [2022-01-19 05:01:18,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.17ms. Allocated memory is still 616.6MB. Free memory was 575.1MB in the beginning and 573.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 05:01:18,265 INFO L158 Benchmark]: Boogie Preprocessor took 35.74ms. Allocated memory is still 616.6MB. Free memory was 573.0MB in the beginning and 569.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 05:01:18,265 INFO L158 Benchmark]: RCFGBuilder took 1194.58ms. Allocated memory is still 616.6MB. Free memory was 569.9MB in the beginning and 391.2MB in the end (delta: 178.6MB). Peak memory consumption was 178.3MB. Max. memory is 16.0GB. [2022-01-19 05:01:18,265 INFO L158 Benchmark]: TraceAbstraction took 86508.15ms. Allocated memory was 616.6MB in the beginning and 9.5GB in the end (delta: 8.9GB). Free memory was 391.2MB in the beginning and 6.6GB in the end (delta: -6.2GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. [2022-01-19 05:01:18,269 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.11ms. Allocated memory is still 402.7MB. Free memory is still 365.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 440.25ms. Allocated memory was 402.7MB in the beginning and 616.6MB in the end (delta: 213.9MB). Free memory was 347.5MB in the beginning and 575.1MB in the end (delta: -227.7MB). Peak memory consumption was 9.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 44.17ms. Allocated memory is still 616.6MB. Free memory was 575.1MB in the beginning and 573.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.74ms. Allocated memory is still 616.6MB. Free memory was 573.0MB in the beginning and 569.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 1194.58ms. Allocated memory is still 616.6MB. Free memory was 569.9MB in the beginning and 391.2MB in the end (delta: 178.6MB). Peak memory consumption was 178.3MB. Max. memory is 16.0GB. * TraceAbstraction took 86508.15ms. Allocated memory was 616.6MB in the beginning and 9.5GB in the end (delta: 8.9GB). Free memory was 391.2MB in the beginning and 6.6GB in the end (delta: -6.2GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. * 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_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L717] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0] [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0] [L719] 0 int __unbuffered_p2_EAX$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0] [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0] [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0] [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0] [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0] [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0] [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0] [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0] [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0] [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0] [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0] [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0] [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}] [L732] 0 int __unbuffered_p2_EAX$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0] [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0] [L734] 0 int __unbuffered_p2_EAX$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0] [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0] [L736] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0] [L737] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L739] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}] [L740] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0] [L741] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0] [L742] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L743] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L744] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L745] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3: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] [L746] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3: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] [L747] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3: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] [L748] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3: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] [L749] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3: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] [L750] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3: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] [L751] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3: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] [L752] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3: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] [L753] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3: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}] [L754] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3: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] [L755] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3: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] [L756] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3: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] [L757] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3: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] [L759] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3: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] [L760] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x={3: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] [L761] 0 _Bool weak$$choice1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, x={3: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] [L762] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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] [L882] 0 pthread_t t2229; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t2229={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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] [L883] FCALL, FORK 0 pthread_create(&t2229, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2229, ((void *)0), P0, ((void *)0))=-3, t2229={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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] [L884] 0 pthread_t t2230; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2229={5:0}, t2230={4:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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] [L885] FCALL, FORK 0 pthread_create(&t2230, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2230, ((void *)0), P1, ((void *)0))=-2, t2229={5:0}, t2230={4:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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] [L794] 2 x$w_buff1 = x$w_buff0 [L795] 2 x$w_buff0 = 1 [L796] 2 x$w_buff1_used = x$w_buff0_used [L797] 2 x$w_buff0_used = (_Bool)1 [L798] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L798] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L799] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L800] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L801] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L802] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L803] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L804] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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] [L886] 0 pthread_t t2231; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2229={5:0}, t2230={4:0}, t2231={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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] [L887] FCALL, FORK 0 pthread_create(&t2231, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2231, ((void *)0), P2, ((void *)0))=-1, t2229={5:0}, t2230={4:0}, t2231={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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] [L821] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 3 x$flush_delayed = weak$$choice2 [L824] EXPR 3 \read(x) [L824] 3 x$mem_tmp = x [L825] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L826] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L826] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L826] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L826] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L826] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L826] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L826] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L826] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L827] EXPR 3 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L827] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L828] EXPR 3 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L828] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L829] EXPR 3 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L829] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L830] EXPR 3 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L830] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L831] EXPR 3 weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L831] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L832] EXPR 3 weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L832] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L833] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L834] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L835] EXPR 3 \read(x) [L835] 3 __unbuffered_p2_EAX = x [L836] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L836] 3 x = x$flush_delayed ? x$mem_tmp : x [L837] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=255, x={3: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] [L888] 0 pthread_t t2232; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2229={5:0}, t2230={4:0}, t2231={6:0}, t2232={7:0}, weak$$choice0=1, weak$$choice1=0, weak$$choice2=255, x={3: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] [L889] FCALL, FORK 0 pthread_create(&t2232, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2232, ((void *)0), P3, ((void *)0))=0, t2229={5:0}, t2230={4:0}, t2231={6:0}, t2232={7:0}, weak$$choice0=1, weak$$choice1=0, weak$$choice2=255, x={3: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] [L840] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=255, x={3: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] [L857] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=1, weak$$choice1=0, weak$$choice2=255, x={3: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=2] [L860] 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) [L860] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L860] EXPR 4 \read(x) [L860] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L860] 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) [L860] 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) [L861] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L861] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L862] 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 [L863] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L863] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L864] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L864] 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 [L843] 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) [L843] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L843] EXPR 3 \read(x) [L843] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L843] 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) [L843] 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) [L844] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L844] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L845] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L845] 3 x$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 [L846] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L846] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L847] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L847] 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 [L766] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=1, weak$$choice1=0, weak$$choice2=255, x={3: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=2] [L769] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 1 x$flush_delayed = weak$$choice2 [L772] EXPR 1 \read(x) [L772] 1 x$mem_tmp = x [L773] 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) [L773] EXPR 1 \read(x) [L773] 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) [L773] 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) [L774] 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)) [L774] EXPR 1 !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) [L774] 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)) [L774] 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)) [L775] 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)) [L775] EXPR 1 !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) [L775] 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)) [L775] 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)) [L776] 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)) [L776] EXPR 1 !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) [L776] 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)) [L776] 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)) [L777] 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)) [L777] EXPR 1 !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) [L777] 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)) [L777] 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)) [L778] 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)) [L778] EXPR 1 !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) [L778] 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)) [L778] 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)) [L779] 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)) [L779] EXPR 1 !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) [L779] 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)) [L779] 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)) [L780] EXPR 1 \read(x) [L780] 1 __unbuffered_p0_EBX = x [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] EXPR 1 \read(x) [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] 1 x = x$flush_delayed ? x$mem_tmp : x [L782] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=4, weak$$choice1=0, weak$$choice2=0, x={3: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=2] [L807] 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) [L807] 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) [L808] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L808] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L809] 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 [L810] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L810] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L811] 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 [L814] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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=4, weak$$choice1=0, weak$$choice2=0, x={3: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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L850] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=4, weak$$choice1=0, weak$$choice2=0, x={3: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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=4, weak$$choice1=0, weak$$choice2=0, x={3: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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L867] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=4, weak$$choice1=0, weak$$choice2=0, x={3: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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L891] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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, t2229={5:0}, t2230={4:0}, t2231={6:0}, t2232={7:0}, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x={3: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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L893] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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=4, weak$$choice1=0, weak$$choice2=0, x={3: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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L893] RET 0 assume_abort_if_not(main$tmp_guard0) [L895] 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) [L895] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L895] EXPR 0 \read(x) [L895] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L895] 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) [L895] 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) [L896] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L896] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L897] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L897] 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 [L898] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L898] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L899] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L899] 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 [L902] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L903] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L903] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L903] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L903] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L904] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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, t2229={5:0}, t2230={4:0}, t2231={6:0}, t2232={7:0}, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x={3: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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L906] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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=4, weak$$choice1=0, weak$$choice2=0, x={3: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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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=4, weak$$choice1=0, weak$$choice2=0, x={3: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=0, x$w_buff1=0, x$w_buff1_used=0, y=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: 883]: 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: 885]: 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: 887]: 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: 889]: 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, 185 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: 86.1s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 72.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2354 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2354 mSDsluCounter, 4245 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5835 mSDsCounter, 1383 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12328 IncrementalHoareTripleChecker+Invalid, 13711 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1383 mSolverCounterUnsat, 567 mSDtfsCounter, 12328 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 745 GetRequests, 83 SyntacticMatches, 4 SemanticMatches, 658 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4608 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8729occurred in iteration=28, InterpolantAutomatonStates: 540, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 3285 NumberOfCodeBlocks, 3285 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 3136 ConstructedInterpolants, 0 QuantifiedInterpolants, 40515 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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! [2022-01-19 05:01:18,302 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...