/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.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_power.oepc.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065
[2021-06-10 12:17:12,059 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-06-10 12:17:12,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-06-10 12:17:12,100 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-06-10 12:17:12,101 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-06-10 12:17:12,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-06-10 12:17:12,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-06-10 12:17:12,111 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-06-10 12:17:12,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-06-10 12:17:12,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-06-10 12:17:12,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-06-10 12:17:12,119 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-06-10 12:17:12,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-06-10 12:17:12,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-06-10 12:17:12,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-06-10 12:17:12,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-06-10 12:17:12,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-06-10 12:17:12,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-06-10 12:17:12,129 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-06-10 12:17:12,134 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-06-10 12:17:12,135 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-06-10 12:17:12,136 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-06-10 12:17:12,137 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-06-10 12:17:12,138 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-06-10 12:17:12,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-06-10 12:17:12,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-06-10 12:17:12,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-06-10 12:17:12,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-06-10 12:17:12,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-06-10 12:17:12,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-06-10 12:17:12,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-06-10 12:17:12,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-06-10 12:17:12,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-06-10 12:17:12,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-06-10 12:17:12,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-06-10 12:17:12,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-06-10 12:17:12,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-06-10 12:17:12,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-06-10 12:17:12,152 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-06-10 12:17:12,153 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-06-10 12:17:12,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-06-10 12:17:12,157 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.epf
[2021-06-10 12:17:12,190 INFO L113 SettingsManager]: Loading preferences was successful
[2021-06-10 12:17:12,190 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-06-10 12:17:12,193 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-06-10 12:17:12,193 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-06-10 12:17:12,194 INFO L138 SettingsManager]: * Use SBE=true
[2021-06-10 12:17:12,194 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-06-10 12:17:12,194 INFO L138 SettingsManager]: * sizeof long=4
[2021-06-10 12:17:12,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-06-10 12:17:12,194 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-06-10 12:17:12,195 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-06-10 12:17:12,195 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-06-10 12:17:12,196 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-06-10 12:17:12,196 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-06-10 12:17:12,196 INFO L138 SettingsManager]: * sizeof long double=12
[2021-06-10 12:17:12,196 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-06-10 12:17:12,196 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-06-10 12:17:12,196 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-06-10 12:17:12,197 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-06-10 12:17:12,197 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-06-10 12:17:12,197 INFO L138 SettingsManager]: * To the following directory=./dump/
[2021-06-10 12:17:12,197 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-06-10 12:17:12,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-10 12:17:12,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-06-10 12:17:12,198 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-06-10 12:17:12,198 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-06-10 12:17:12,198 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-06-10 12:17:12,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-06-10 12:17:12,198 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2021-06-10 12:17:12,198 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2021-06-10 12:17:12,199 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
[2021-06-10 12:17:12,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-06-10 12:17:12,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-06-10 12:17:12,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-06-10 12:17:12,535 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-06-10 12:17:12,536 INFO L275 PluginConnector]: CDTParser initialized
[2021-06-10 12:17:12,536 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.oepc.i
[2021-06-10 12:17:12,601 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1771d0a/a1fbf0d261ee4c0c9bb0028affba1f61/FLAGa843ae1aa
[2021-06-10 12:17:13,083 INFO L306 CDTParser]: Found 1 translation units.
[2021-06-10 12:17:13,083 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.oepc.i
[2021-06-10 12:17:13,099 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1771d0a/a1fbf0d261ee4c0c9bb0028affba1f61/FLAGa843ae1aa
[2021-06-10 12:17:13,584 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1771d0a/a1fbf0d261ee4c0c9bb0028affba1f61
[2021-06-10 12:17:13,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-06-10 12:17:13,588 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2021-06-10 12:17:13,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-06-10 12:17:13,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-06-10 12:17:13,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-06-10 12:17:13,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 12:17:13" (1/1) ...
[2021-06-10 12:17:13,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d04ea55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:17:13, skipping insertion in model container
[2021-06-10 12:17:13,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 12:17:13" (1/1) ...
[2021-06-10 12:17:13,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-06-10 12:17:13,661 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-06-10 12:17:13,809 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.oepc.i[951,964]
[2021-06-10 12:17:13,972 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-06-10 12:17:13,984 INFO L203 MainTranslator]: Completed pre-run
[2021-06-10 12:17:13,994 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.oepc.i[951,964]
[2021-06-10 12:17:14,066 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-06-10 12:17:14,139 INFO L208 MainTranslator]: Completed translation
[2021-06-10 12:17:14,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:17:14 WrapperNode
[2021-06-10 12:17:14,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-06-10 12:17:14,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-06-10 12:17:14,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-06-10 12:17:14,142 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-06-10 12:17:14,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:17:14" (1/1) ...
[2021-06-10 12:17:14,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:17:14" (1/1) ...
[2021-06-10 12:17:14,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-06-10 12:17:14,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-06-10 12:17:14,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-06-10 12:17:14,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-06-10 12:17:14,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:17:14" (1/1) ...
[2021-06-10 12:17:14,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:17:14" (1/1) ...
[2021-06-10 12:17:14,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:17:14" (1/1) ...
[2021-06-10 12:17:14,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:17:14" (1/1) ...
[2021-06-10 12:17:14,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:17:14" (1/1) ...
[2021-06-10 12:17:14,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:17:14" (1/1) ...
[2021-06-10 12:17:14,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:17:14" (1/1) ...
[2021-06-10 12:17:14,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-06-10 12:17:14,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-06-10 12:17:14,262 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-06-10 12:17:14,262 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-06-10 12:17:14,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:17:14" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-10 12:17:14,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-06-10 12:17:14,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-06-10 12:17:14,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-06-10 12:17:14,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-06-10 12:17:14,341 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2021-06-10 12:17:14,341 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2021-06-10 12:17:14,341 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2021-06-10 12:17:14,342 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2021-06-10 12:17:14,342 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2021-06-10 12:17:14,342 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2021-06-10 12:17:14,342 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2021-06-10 12:17:14,342 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2021-06-10 12:17:14,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-06-10 12:17:14,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-06-10 12:17:14,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-06-10 12:17:14,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-06-10 12:17:14,344 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-06-10 12:17:16,149 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-06-10 12:17:16,149 INFO L299 CfgBuilder]: Removed 10 assume(true) statements.
[2021-06-10 12:17:16,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 12:17:16 BoogieIcfgContainer
[2021-06-10 12:17:16,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-06-10 12:17:16,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-06-10 12:17:16,152 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-06-10 12:17:16,157 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-06-10 12:17:16,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.06 12:17:13" (1/3) ...
[2021-06-10 12:17:16,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36100245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 12:17:16, skipping insertion in model container
[2021-06-10 12:17:16,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:17:14" (2/3) ...
[2021-06-10 12:17:16,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36100245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 12:17:16, skipping insertion in model container
[2021-06-10 12:17:16,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 12:17:16" (3/3) ...
[2021-06-10 12:17:16,160 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_power.oepc.i
[2021-06-10 12:17:16,167 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-06-10 12:17:16,171 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2021-06-10 12:17:16,172 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-06-10 12:17:16,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,214 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,214 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,214 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,214 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,214 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,215 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,215 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,215 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,220 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,220 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,220 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,220 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,224 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,224 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,224 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,224 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,228 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,228 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,229 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,229 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,229 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,229 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,229 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,230 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,230 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,232 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,233 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,234 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,234 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,238 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,239 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,239 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,239 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,239 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,239 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,239 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,239 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,239 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,239 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,239 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,239 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,240 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,240 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,240 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,240 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,240 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,240 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,240 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,240 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,240 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,242 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,242 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,242 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,243 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,243 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,243 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,244 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,244 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,244 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,244 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,244 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,244 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,244 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,244 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,244 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,244 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,244 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,244 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,245 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,245 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,245 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,245 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,245 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,245 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,245 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,245 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,245 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,245 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,245 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,245 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,246 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,246 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,246 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,246 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,246 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,246 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,246 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,246 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,246 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,246 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,246 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,249 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,250 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,250 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,250 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,250 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,250 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,250 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,250 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,251 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,251 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,251 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,251 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,251 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,251 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,251 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,252 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,252 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,252 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,255 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,255 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,255 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,257 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,257 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,259 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,259 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,268 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,269 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,271 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,272 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,272 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,272 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,273 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,273 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,273 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,273 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,273 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,273 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,275 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,275 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,275 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,275 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,275 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,275 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,275 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:17:16,277 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-06-10 12:17:16,292 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2021-06-10 12:17:16,322 INFO L376 AbstractCegarLoop]: Interprodecural is true
[2021-06-10 12:17:16,323 INFO L377 AbstractCegarLoop]: Hoare is false
[2021-06-10 12:17:16,323 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-10 12:17:16,323 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-10 12:17:16,323 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-10 12:17:16,323 INFO L381 AbstractCegarLoop]: Difference is false
[2021-06-10 12:17:16,323 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-10 12:17:16,323 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-06-10 12:17:16,336 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 118 transitions, 256 flow
[2021-06-10 12:17:16,369 INFO L129 PetriNetUnfolder]: 2/114 cut-off events.
[2021-06-10 12:17:16,370 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-10 12:17:16,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 89 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place.
[2021-06-10 12:17:16,374 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 118 transitions, 256 flow
[2021-06-10 12:17:16,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 114 transitions, 240 flow
[2021-06-10 12:17:16,390 INFO L129 PetriNetUnfolder]: 0/45 cut-off events.
[2021-06-10 12:17:16,391 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-10 12:17:16,391 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:17:16,391 INFO L263 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]
[2021-06-10 12:17:16,392 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:17:16,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:17:16,398 INFO L82 PathProgramCache]: Analyzing trace with hash 284457276, now seen corresponding path program 1 times
[2021-06-10 12:17:16,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:17:16,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443209077]
[2021-06-10 12:17:16,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:17:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:17:16,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:16,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:17:16,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:16,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:17:16,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:17:16,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443209077]
[2021-06-10 12:17:16,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:17:16,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-06-10 12:17:16,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908335460]
[2021-06-10 12:17:16,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-06-10 12:17:16,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:17:16,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-06-10 12:17:16,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-10 12:17:16,675 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 118
[2021-06-10 12:17:16,678 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 114 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:16,678 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:17:16,678 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 118
[2021-06-10 12:17:16,679 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:17:16,919 INFO L129 PetriNetUnfolder]: 133/475 cut-off events.
[2021-06-10 12:17:16,919 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-10 12:17:16,924 INFO L84 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 475 events. 133/475 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2605 event pairs, 110 based on Foata normal form. 54/503 useless extension candidates. Maximal degree in co-relation 643. Up to 153 conditions per place.
[2021-06-10 12:17:16,929 INFO L132 encePairwiseOnDemand]: 113/118 looper letters, 11 selfloop transitions, 2 changer transitions 0/115 dead transitions.
[2021-06-10 12:17:16,929 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 115 transitions, 268 flow
[2021-06-10 12:17:16,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-06-10 12:17:16,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-06-10 12:17:16,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions.
[2021-06-10 12:17:16,945 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9491525423728814
[2021-06-10 12:17:16,946 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions.
[2021-06-10 12:17:16,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions.
[2021-06-10 12:17:16,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:17:16,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions.
[2021-06-10 12:17:16,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:16,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:16,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:16,963 INFO L185 Difference]: Start difference. First operand has 125 places, 114 transitions, 240 flow. Second operand 3 states and 336 transitions.
[2021-06-10 12:17:16,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 115 transitions, 268 flow
[2021-06-10 12:17:16,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 115 transitions, 264 flow, removed 0 selfloop flow, removed 4 redundant places.
[2021-06-10 12:17:16,975 INFO L241 Difference]: Finished difference. Result has 121 places, 110 transitions, 232 flow
[2021-06-10 12:17:16,977 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=121, PETRI_TRANSITIONS=110}
[2021-06-10 12:17:16,978 INFO L343 CegarLoopForPetriNet]: 125 programPoint places, -4 predicate places.
[2021-06-10 12:17:16,978 INFO L480 AbstractCegarLoop]: Abstraction has has 121 places, 110 transitions, 232 flow
[2021-06-10 12:17:16,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:16,978 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:17:16,979 INFO L263 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]
[2021-06-10 12:17:16,979 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-06-10 12:17:16,979 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:17:16,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:17:16,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1129825178, now seen corresponding path program 1 times
[2021-06-10 12:17:16,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:17:16,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639987802]
[2021-06-10 12:17:16,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:17:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:17:17,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:17,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:17:17,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:17,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:17:17,195 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size
[2021-06-10 12:17:17,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21
[2021-06-10 12:17:17,213 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-06-10 12:17:17,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-06-10 12:17:17,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:17,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:17:17,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:17,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:17:17,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:17,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:17:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:17:17,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639987802]
[2021-06-10 12:17:17,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:17:17,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-10 12:17:17,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731362655]
[2021-06-10 12:17:17,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-10 12:17:17,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:17:17,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-10 12:17:17,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-06-10 12:17:17,273 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 118
[2021-06-10 12:17:17,274 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 110 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 96.57142857142857) internal successors, (676), 7 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:17,274 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:17:17,274 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 118
[2021-06-10 12:17:17,274 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:17:18,320 INFO L129 PetriNetUnfolder]: 2129/5676 cut-off events.
[2021-06-10 12:17:18,320 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-10 12:17:18,342 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8807 conditions, 5676 events. 2129/5676 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 53642 event pairs, 157 based on Foata normal form. 0/5557 useless extension candidates. Maximal degree in co-relation 8753. Up to 739 conditions per place.
[2021-06-10 12:17:18,420 INFO L132 encePairwiseOnDemand]: 106/118 looper letters, 26 selfloop transitions, 8 changer transitions 84/197 dead transitions.
[2021-06-10 12:17:18,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 197 transitions, 620 flow
[2021-06-10 12:17:18,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-06-10 12:17:18,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2021-06-10 12:17:18,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1345 transitions.
[2021-06-10 12:17:18,424 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8767926988265972
[2021-06-10 12:17:18,424 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1345 transitions.
[2021-06-10 12:17:18,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1345 transitions.
[2021-06-10 12:17:18,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:17:18,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1345 transitions.
[2021-06-10 12:17:18,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 103.46153846153847) internal successors, (1345), 13 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)
[2021-06-10 12:17:18,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 118.0) internal successors, (1652), 14 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:18,432 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 118.0) internal successors, (1652), 14 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:18,432 INFO L185 Difference]: Start difference. First operand has 121 places, 110 transitions, 232 flow. Second operand 13 states and 1345 transitions.
[2021-06-10 12:17:18,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 197 transitions, 620 flow
[2021-06-10 12:17:18,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 197 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-06-10 12:17:18,436 INFO L241 Difference]: Finished difference. Result has 143 places, 104 transitions, 318 flow
[2021-06-10 12:17:18,437 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=318, PETRI_PLACES=143, PETRI_TRANSITIONS=104}
[2021-06-10 12:17:18,437 INFO L343 CegarLoopForPetriNet]: 125 programPoint places, 18 predicate places.
[2021-06-10 12:17:18,437 INFO L480 AbstractCegarLoop]: Abstraction has has 143 places, 104 transitions, 318 flow
[2021-06-10 12:17:18,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 96.57142857142857) internal successors, (676), 7 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:18,438 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:17:18,438 INFO L263 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]
[2021-06-10 12:17:18,438 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-06-10 12:17:18,438 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:17:18,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:17:18,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1835473512, now seen corresponding path program 1 times
[2021-06-10 12:17:18,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:17:18,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215198274]
[2021-06-10 12:17:18,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:17:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:17:18,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:18,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:17:18,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:18,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:17:18,551 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size
[2021-06-10 12:17:18,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21
[2021-06-10 12:17:18,564 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-06-10 12:17:18,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-06-10 12:17:18,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:18,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:17:18,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:18,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:17:18,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:18,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:17:18,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:17:18,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215198274]
[2021-06-10 12:17:18,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:17:18,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-10 12:17:18,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358913724]
[2021-06-10 12:17:18,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-10 12:17:18,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:17:18,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-10 12:17:18,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-06-10 12:17:18,606 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 118
[2021-06-10 12:17:18,607 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 104 transitions, 318 flow. Second operand has 7 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:18,607 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:17:18,607 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 118
[2021-06-10 12:17:18,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:17:19,327 INFO L129 PetriNetUnfolder]: 1138/3089 cut-off events.
[2021-06-10 12:17:19,328 INFO L130 PetriNetUnfolder]: For 6317/7538 co-relation queries the response was YES.
[2021-06-10 12:17:19,341 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9684 conditions, 3089 events. 1138/3089 cut-off events. For 6317/7538 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 26650 event pairs, 110 based on Foata normal form. 59/3124 useless extension candidates. Maximal degree in co-relation 9618. Up to 677 conditions per place.
[2021-06-10 12:17:19,356 INFO L132 encePairwiseOnDemand]: 103/118 looper letters, 27 selfloop transitions, 20 changer transitions 70/196 dead transitions.
[2021-06-10 12:17:19,356 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 196 transitions, 1258 flow
[2021-06-10 12:17:19,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-06-10 12:17:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2021-06-10 12:17:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1337 transitions.
[2021-06-10 12:17:19,359 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8715775749674055
[2021-06-10 12:17:19,359 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1337 transitions.
[2021-06-10 12:17:19,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1337 transitions.
[2021-06-10 12:17:19,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:17:19,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1337 transitions.
[2021-06-10 12:17:19,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 102.84615384615384) internal successors, (1337), 13 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:19,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 118.0) internal successors, (1652), 14 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:19,367 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 118.0) internal successors, (1652), 14 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:19,367 INFO L185 Difference]: Start difference. First operand has 143 places, 104 transitions, 318 flow. Second operand 13 states and 1337 transitions.
[2021-06-10 12:17:19,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 196 transitions, 1258 flow
[2021-06-10 12:17:19,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 196 transitions, 1230 flow, removed 12 selfloop flow, removed 4 redundant places.
[2021-06-10 12:17:19,387 INFO L241 Difference]: Finished difference. Result has 142 places, 117 transitions, 541 flow
[2021-06-10 12:17:19,387 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=541, PETRI_PLACES=142, PETRI_TRANSITIONS=117}
[2021-06-10 12:17:19,388 INFO L343 CegarLoopForPetriNet]: 125 programPoint places, 17 predicate places.
[2021-06-10 12:17:19,388 INFO L480 AbstractCegarLoop]: Abstraction has has 142 places, 117 transitions, 541 flow
[2021-06-10 12:17:19,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:19,388 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:17:19,388 INFO L263 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]
[2021-06-10 12:17:19,388 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-06-10 12:17:19,388 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:17:19,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:17:19,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1978981757, now seen corresponding path program 1 times
[2021-06-10 12:17:19,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:17:19,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093061094]
[2021-06-10 12:17:19,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:17:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:17:19,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:19,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:17:19,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:19,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:17:19,470 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-06-10 12:17:19,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-06-10 12:17:19,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:19,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:17:19,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:19,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:17:19,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:19,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:17:19,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:17:19,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093061094]
[2021-06-10 12:17:19,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:17:19,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-10 12:17:19,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312112167]
[2021-06-10 12:17:19,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-10 12:17:19,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:17:19,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-10 12:17:19,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-10 12:17:19,503 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 118
[2021-06-10 12:17:19,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 117 transitions, 541 flow. Second operand has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:19,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:17:19,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 118
[2021-06-10 12:17:19,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:17:19,888 INFO L129 PetriNetUnfolder]: 647/1833 cut-off events.
[2021-06-10 12:17:19,889 INFO L130 PetriNetUnfolder]: For 8967/10154 co-relation queries the response was YES.
[2021-06-10 12:17:19,901 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7077 conditions, 1833 events. 647/1833 cut-off events. For 8967/10154 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 14202 event pairs, 153 based on Foata normal form. 269/2039 useless extension candidates. Maximal degree in co-relation 7001. Up to 451 conditions per place.
[2021-06-10 12:17:19,913 INFO L132 encePairwiseOnDemand]: 111/118 looper letters, 12 selfloop transitions, 7 changer transitions 31/154 dead transitions.
[2021-06-10 12:17:19,914 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 154 transitions, 1037 flow
[2021-06-10 12:17:19,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-10 12:17:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-06-10 12:17:19,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 977 transitions.
[2021-06-10 12:17:19,917 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199623352165726
[2021-06-10 12:17:19,917 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 977 transitions.
[2021-06-10 12:17:19,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 977 transitions.
[2021-06-10 12:17:19,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:17:19,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 977 transitions.
[2021-06-10 12:17:19,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 108.55555555555556) internal successors, (977), 9 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:19,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 118.0) internal successors, (1180), 10 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:19,924 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 118.0) internal successors, (1180), 10 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:19,924 INFO L185 Difference]: Start difference. First operand has 142 places, 117 transitions, 541 flow. Second operand 9 states and 977 transitions.
[2021-06-10 12:17:19,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 154 transitions, 1037 flow
[2021-06-10 12:17:19,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 154 transitions, 995 flow, removed 21 selfloop flow, removed 3 redundant places.
[2021-06-10 12:17:19,956 INFO L241 Difference]: Finished difference. Result has 145 places, 123 transitions, 666 flow
[2021-06-10 12:17:19,956 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=666, PETRI_PLACES=145, PETRI_TRANSITIONS=123}
[2021-06-10 12:17:19,956 INFO L343 CegarLoopForPetriNet]: 125 programPoint places, 20 predicate places.
[2021-06-10 12:17:19,956 INFO L480 AbstractCegarLoop]: Abstraction has has 145 places, 123 transitions, 666 flow
[2021-06-10 12:17:19,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:19,957 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:17:19,957 INFO L263 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]
[2021-06-10 12:17:19,957 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-06-10 12:17:19,958 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:17:19,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:17:19,958 INFO L82 PathProgramCache]: Analyzing trace with hash -613633943, now seen corresponding path program 1 times
[2021-06-10 12:17:19,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:17:19,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308307155]
[2021-06-10 12:17:19,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:17:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:17:20,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:20,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:17:20,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:20,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:17:20,042 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size
[2021-06-10 12:17:20,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21
[2021-06-10 12:17:20,054 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-06-10 12:17:20,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-06-10 12:17:20,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:20,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:17:20,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:20,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:17:20,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:20,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:17:20,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:17:20,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308307155]
[2021-06-10 12:17:20,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:17:20,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-10 12:17:20,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911482656]
[2021-06-10 12:17:20,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-10 12:17:20,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:17:20,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-10 12:17:20,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-06-10 12:17:20,106 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 118
[2021-06-10 12:17:20,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 123 transitions, 666 flow. Second operand has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:20,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:17:20,112 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 118
[2021-06-10 12:17:20,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:17:20,772 INFO L129 PetriNetUnfolder]: 722/2310 cut-off events.
[2021-06-10 12:17:20,773 INFO L130 PetriNetUnfolder]: For 10600/12608 co-relation queries the response was YES.
[2021-06-10 12:17:20,790 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9072 conditions, 2310 events. 722/2310 cut-off events. For 10600/12608 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 19802 event pairs, 61 based on Foata normal form. 50/2345 useless extension candidates. Maximal degree in co-relation 9036. Up to 514 conditions per place.
[2021-06-10 12:17:20,808 INFO L132 encePairwiseOnDemand]: 103/118 looper letters, 35 selfloop transitions, 32 changer transitions 54/200 dead transitions.
[2021-06-10 12:17:20,809 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 200 transitions, 1726 flow
[2021-06-10 12:17:20,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-06-10 12:17:20,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2021-06-10 12:17:20,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1319 transitions.
[2021-06-10 12:17:20,813 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8598435462842242
[2021-06-10 12:17:20,813 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1319 transitions.
[2021-06-10 12:17:20,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1319 transitions.
[2021-06-10 12:17:20,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:17:20,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1319 transitions.
[2021-06-10 12:17:20,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 101.46153846153847) internal successors, (1319), 13 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:20,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 118.0) internal successors, (1652), 14 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:20,820 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 118.0) internal successors, (1652), 14 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:20,820 INFO L185 Difference]: Start difference. First operand has 145 places, 123 transitions, 666 flow. Second operand 13 states and 1319 transitions.
[2021-06-10 12:17:20,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 200 transitions, 1726 flow
[2021-06-10 12:17:20,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 200 transitions, 1660 flow, removed 29 selfloop flow, removed 10 redundant places.
[2021-06-10 12:17:20,839 INFO L241 Difference]: Finished difference. Result has 153 places, 134 transitions, 935 flow
[2021-06-10 12:17:20,840 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=935, PETRI_PLACES=153, PETRI_TRANSITIONS=134}
[2021-06-10 12:17:20,840 INFO L343 CegarLoopForPetriNet]: 125 programPoint places, 28 predicate places.
[2021-06-10 12:17:20,840 INFO L480 AbstractCegarLoop]: Abstraction has has 153 places, 134 transitions, 935 flow
[2021-06-10 12:17:20,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:20,840 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:17:20,841 INFO L263 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]
[2021-06-10 12:17:20,841 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-06-10 12:17:20,841 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:17:20,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:17:20,841 INFO L82 PathProgramCache]: Analyzing trace with hash -893317724, now seen corresponding path program 1 times
[2021-06-10 12:17:20,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:17:20,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574525555]
[2021-06-10 12:17:20,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:17:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:17:20,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:20,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:17:20,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:20,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:17:20,925 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size
[2021-06-10 12:17:20,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-06-10 12:17:20,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:20,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-06-10 12:17:20,948 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size
[2021-06-10 12:17:20,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:17:20,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:20,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:17:20,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:17:20,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574525555]
[2021-06-10 12:17:20,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:17:20,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-10 12:17:20,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382074064]
[2021-06-10 12:17:20,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-10 12:17:20,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:17:20,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-10 12:17:20,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-10 12:17:20,961 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 118
[2021-06-10 12:17:20,961 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 134 transitions, 935 flow. Second operand has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:20,961 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:17:20,961 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 118
[2021-06-10 12:17:20,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:17:22,499 INFO L129 PetriNetUnfolder]: 4226/9336 cut-off events.
[2021-06-10 12:17:22,499 INFO L130 PetriNetUnfolder]: For 19326/20460 co-relation queries the response was YES.
[2021-06-10 12:17:22,565 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22812 conditions, 9336 events. 4226/9336 cut-off events. For 19326/20460 co-relation queries the response was YES. Maximal size of possible extension queue 1317. Compared 98993 event pairs, 281 based on Foata normal form. 386/8654 useless extension candidates. Maximal degree in co-relation 22722. Up to 2696 conditions per place.
[2021-06-10 12:17:22,613 INFO L132 encePairwiseOnDemand]: 107/118 looper letters, 29 selfloop transitions, 20 changer transitions 0/171 dead transitions.
[2021-06-10 12:17:22,613 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 171 transitions, 1107 flow
[2021-06-10 12:17:22,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2021-06-10 12:17:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-06-10 12:17:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1081 transitions.
[2021-06-10 12:17:22,616 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9161016949152543
[2021-06-10 12:17:22,616 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1081 transitions.
[2021-06-10 12:17:22,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1081 transitions.
[2021-06-10 12:17:22,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:17:22,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1081 transitions.
[2021-06-10 12:17:22,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 108.1) internal successors, (1081), 10 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:22,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 118.0) internal successors, (1298), 11 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:22,622 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 118.0) internal successors, (1298), 11 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:22,622 INFO L185 Difference]: Start difference. First operand has 153 places, 134 transitions, 935 flow. Second operand 10 states and 1081 transitions.
[2021-06-10 12:17:22,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 171 transitions, 1107 flow
[2021-06-10 12:17:22,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 171 transitions, 1087 flow, removed 10 selfloop flow, removed 3 redundant places.
[2021-06-10 12:17:22,648 INFO L241 Difference]: Finished difference. Result has 156 places, 152 transitions, 1058 flow
[2021-06-10 12:17:22,648 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1058, PETRI_PLACES=156, PETRI_TRANSITIONS=152}
[2021-06-10 12:17:22,648 INFO L343 CegarLoopForPetriNet]: 125 programPoint places, 31 predicate places.
[2021-06-10 12:17:22,648 INFO L480 AbstractCegarLoop]: Abstraction has has 156 places, 152 transitions, 1058 flow
[2021-06-10 12:17:22,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:22,649 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:17:22,649 INFO L263 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]
[2021-06-10 12:17:22,649 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-06-10 12:17:22,649 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:17:22,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:17:22,649 INFO L82 PathProgramCache]: Analyzing trace with hash 960715023, now seen corresponding path program 1 times
[2021-06-10 12:17:22,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:17:22,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011312421]
[2021-06-10 12:17:22,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:17:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:17:22,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:22,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:17:22,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:22,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:17:22,705 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size
[2021-06-10 12:17:22,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21
[2021-06-10 12:17:22,715 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-06-10 12:17:22,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-06-10 12:17:22,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:22,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:17:22,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:22,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:17:22,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:22,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:17:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:17:22,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011312421]
[2021-06-10 12:17:22,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:17:22,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-10 12:17:22,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650292580]
[2021-06-10 12:17:22,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-10 12:17:22,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:17:22,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-10 12:17:22,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-06-10 12:17:22,750 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 118
[2021-06-10 12:17:22,750 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 152 transitions, 1058 flow. Second operand has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:22,751 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:17:22,751 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 118
[2021-06-10 12:17:22,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:17:24,566 INFO L129 PetriNetUnfolder]: 2768/10280 cut-off events.
[2021-06-10 12:17:24,566 INFO L130 PetriNetUnfolder]: For 34917/40113 co-relation queries the response was YES.
[2021-06-10 12:17:24,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34086 conditions, 10280 events. 2768/10280 cut-off events. For 34917/40113 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 130900 event pairs, 896 based on Foata normal form. 325/9916 useless extension candidates. Maximal degree in co-relation 33986. Up to 3162 conditions per place.
[2021-06-10 12:17:24,688 INFO L132 encePairwiseOnDemand]: 103/118 looper letters, 81 selfloop transitions, 64 changer transitions 3/245 dead transitions.
[2021-06-10 12:17:24,688 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 245 transitions, 2711 flow
[2021-06-10 12:17:24,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-06-10 12:17:24,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2021-06-10 12:17:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1320 transitions.
[2021-06-10 12:17:24,691 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8604954367666232
[2021-06-10 12:17:24,691 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1320 transitions.
[2021-06-10 12:17:24,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1320 transitions.
[2021-06-10 12:17:24,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:17:24,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1320 transitions.
[2021-06-10 12:17:24,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 101.53846153846153) internal successors, (1320), 13 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:24,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 118.0) internal successors, (1652), 14 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:24,698 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 118.0) internal successors, (1652), 14 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:24,698 INFO L185 Difference]: Start difference. First operand has 156 places, 152 transitions, 1058 flow. Second operand 13 states and 1320 transitions.
[2021-06-10 12:17:24,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 245 transitions, 2711 flow
[2021-06-10 12:17:24,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 245 transitions, 2709 flow, removed 0 selfloop flow, removed 1 redundant places.
[2021-06-10 12:17:24,781 INFO L241 Difference]: Finished difference. Result has 179 places, 194 transitions, 2018 flow
[2021-06-10 12:17:24,782 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2018, PETRI_PLACES=179, PETRI_TRANSITIONS=194}
[2021-06-10 12:17:24,782 INFO L343 CegarLoopForPetriNet]: 125 programPoint places, 54 predicate places.
[2021-06-10 12:17:24,782 INFO L480 AbstractCegarLoop]: Abstraction has has 179 places, 194 transitions, 2018 flow
[2021-06-10 12:17:24,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:24,782 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:17:24,783 INFO L263 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]
[2021-06-10 12:17:24,783 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-06-10 12:17:24,783 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:17:24,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:17:24,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1570524711, now seen corresponding path program 1 times
[2021-06-10 12:17:24,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:17:24,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829422489]
[2021-06-10 12:17:24,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:17:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:17:24,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:24,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:17:24,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:24,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:17:24,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:24,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:17:24,841 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size
[2021-06-10 12:17:24,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-06-10 12:17:24,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:24,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-06-10 12:17:24,865 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size
[2021-06-10 12:17:24,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:17:24,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:24,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:17:24,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:17:24,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829422489]
[2021-06-10 12:17:24,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:17:24,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-10 12:17:24,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954223683]
[2021-06-10 12:17:24,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-10 12:17:24,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:17:24,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-10 12:17:24,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-06-10 12:17:24,879 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 118
[2021-06-10 12:17:24,879 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 194 transitions, 2018 flow. Second operand has 7 states, 7 states have (on average 104.14285714285714) internal successors, (729), 7 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:24,879 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:17:24,879 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 118
[2021-06-10 12:17:24,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:17:27,505 INFO L129 PetriNetUnfolder]: 6697/15798 cut-off events.
[2021-06-10 12:17:27,505 INFO L130 PetriNetUnfolder]: For 54395/77783 co-relation queries the response was YES.
[2021-06-10 12:17:27,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58867 conditions, 15798 events. 6697/15798 cut-off events. For 54395/77783 co-relation queries the response was YES. Maximal size of possible extension queue 2047. Compared 187295 event pairs, 355 based on Foata normal form. 2109/16559 useless extension candidates. Maximal degree in co-relation 58754. Up to 6988 conditions per place.
[2021-06-10 12:17:27,699 INFO L132 encePairwiseOnDemand]: 107/118 looper letters, 34 selfloop transitions, 38 changer transitions 3/230 dead transitions.
[2021-06-10 12:17:27,699 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 230 transitions, 2322 flow
[2021-06-10 12:17:27,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-06-10 12:17:27,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2021-06-10 12:17:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1407 transitions.
[2021-06-10 12:17:27,703 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9172099087353325
[2021-06-10 12:17:27,703 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1407 transitions.
[2021-06-10 12:17:27,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1407 transitions.
[2021-06-10 12:17:27,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:17:27,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1407 transitions.
[2021-06-10 12:17:27,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 108.23076923076923) internal successors, (1407), 13 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:27,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 118.0) internal successors, (1652), 14 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:27,709 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 118.0) internal successors, (1652), 14 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:27,709 INFO L185 Difference]: Start difference. First operand has 179 places, 194 transitions, 2018 flow. Second operand 13 states and 1407 transitions.
[2021-06-10 12:17:27,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 230 transitions, 2322 flow
[2021-06-10 12:17:27,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 230 transitions, 2240 flow, removed 41 selfloop flow, removed 0 redundant places.
[2021-06-10 12:17:27,897 INFO L241 Difference]: Finished difference. Result has 197 places, 205 transitions, 2061 flow
[2021-06-10 12:17:27,897 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=1816, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2061, PETRI_PLACES=197, PETRI_TRANSITIONS=205}
[2021-06-10 12:17:27,897 INFO L343 CegarLoopForPetriNet]: 125 programPoint places, 72 predicate places.
[2021-06-10 12:17:27,897 INFO L480 AbstractCegarLoop]: Abstraction has has 197 places, 205 transitions, 2061 flow
[2021-06-10 12:17:27,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 104.14285714285714) internal successors, (729), 7 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:27,898 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:17:27,898 INFO L263 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]
[2021-06-10 12:17:27,898 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-06-10 12:17:27,898 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:17:27,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:17:27,899 INFO L82 PathProgramCache]: Analyzing trace with hash 61746909, now seen corresponding path program 1 times
[2021-06-10 12:17:27,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:17:27,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428525099]
[2021-06-10 12:17:27,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:17:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:17:27,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:27,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:17:27,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:27,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:17:27,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:27,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:17:27,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:27,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:17:27,996 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size
[2021-06-10 12:17:27,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-06-10 12:17:28,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:28,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-06-10 12:17:28,118 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size
[2021-06-10 12:17:28,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:17:28,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:28,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:17:28,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:17:28,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428525099]
[2021-06-10 12:17:28,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:17:28,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-06-10 12:17:28,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547765930]
[2021-06-10 12:17:28,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-06-10 12:17:28,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:17:28,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-06-10 12:17:28,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-06-10 12:17:28,131 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 118
[2021-06-10 12:17:28,131 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 205 transitions, 2061 flow. Second operand has 8 states, 8 states have (on average 104.125) internal successors, (833), 8 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:28,132 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:17:28,132 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 118
[2021-06-10 12:17:28,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:17:30,786 INFO L129 PetriNetUnfolder]: 6447/15508 cut-off events.
[2021-06-10 12:17:30,787 INFO L130 PetriNetUnfolder]: For 111438/171526 co-relation queries the response was YES.
[2021-06-10 12:17:30,912 INFO L84 FinitePrefix]: Finished finitePrefix Result has 76463 conditions, 15508 events. 6447/15508 cut-off events. For 111438/171526 co-relation queries the response was YES. Maximal size of possible extension queue 2041. Compared 186824 event pairs, 28 based on Foata normal form. 2889/17068 useless extension candidates. Maximal degree in co-relation 76341. Up to 6756 conditions per place.
[2021-06-10 12:17:30,986 INFO L132 encePairwiseOnDemand]: 107/118 looper letters, 28 selfloop transitions, 58 changer transitions 25/247 dead transitions.
[2021-06-10 12:17:30,987 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 247 transitions, 2655 flow
[2021-06-10 12:17:30,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2021-06-10 12:17:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2021-06-10 12:17:30,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1733 transitions.
[2021-06-10 12:17:30,990 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9179025423728814
[2021-06-10 12:17:30,991 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1733 transitions.
[2021-06-10 12:17:30,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1733 transitions.
[2021-06-10 12:17:30,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:17:30,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1733 transitions.
[2021-06-10 12:17:30,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 108.3125) internal successors, (1733), 16 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:30,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 118.0) internal successors, (2006), 17 states have internal predecessors, (2006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:30,999 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 118.0) internal successors, (2006), 17 states have internal predecessors, (2006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:30,999 INFO L185 Difference]: Start difference. First operand has 197 places, 205 transitions, 2061 flow. Second operand 16 states and 1733 transitions.
[2021-06-10 12:17:30,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 247 transitions, 2655 flow
[2021-06-10 12:17:32,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 247 transitions, 2493 flow, removed 68 selfloop flow, removed 8 redundant places.
[2021-06-10 12:17:32,475 INFO L241 Difference]: Finished difference. Result has 208 places, 212 transitions, 2100 flow
[2021-06-10 12:17:32,475 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=1799, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2100, PETRI_PLACES=208, PETRI_TRANSITIONS=212}
[2021-06-10 12:17:32,475 INFO L343 CegarLoopForPetriNet]: 125 programPoint places, 83 predicate places.
[2021-06-10 12:17:32,475 INFO L480 AbstractCegarLoop]: Abstraction has has 208 places, 212 transitions, 2100 flow
[2021-06-10 12:17:32,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 104.125) internal successors, (833), 8 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:32,476 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:17:32,476 INFO L263 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]
[2021-06-10 12:17:32,476 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-06-10 12:17:32,476 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:17:32,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:17:32,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1009230782, now seen corresponding path program 1 times
[2021-06-10 12:17:32,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:17:32,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87728887]
[2021-06-10 12:17:32,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:17:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:17:32,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:32,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:17:32,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:32,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:17:32,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:32,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:17:32,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:32,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:17:32,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:32,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:17:32,589 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size
[2021-06-10 12:17:32,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-06-10 12:17:32,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:32,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-06-10 12:17:32,616 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size
[2021-06-10 12:17:32,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:17:32,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:17:32,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:17:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:17:32,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87728887]
[2021-06-10 12:17:32,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:17:32,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-06-10 12:17:32,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541815953]
[2021-06-10 12:17:32,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-06-10 12:17:32,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:17:32,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-06-10 12:17:32,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2021-06-10 12:17:32,631 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 118
[2021-06-10 12:17:32,632 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 212 transitions, 2100 flow. Second operand has 9 states, 9 states have (on average 104.11111111111111) internal successors, (937), 9 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:32,632 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:17:32,632 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 118
[2021-06-10 12:17:32,632 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:17:35,206 INFO L129 PetriNetUnfolder]: 5973/14845 cut-off events.
[2021-06-10 12:17:35,207 INFO L130 PetriNetUnfolder]: For 110019/139753 co-relation queries the response was YES.
[2021-06-10 12:17:35,351 INFO L84 FinitePrefix]: Finished finitePrefix Result has 72506 conditions, 14845 events. 5973/14845 cut-off events. For 110019/139753 co-relation queries the response was YES. Maximal size of possible extension queue 2041. Compared 182502 event pairs, 16 based on Foata normal form. 2447/15965 useless extension candidates. Maximal degree in co-relation 72448. Up to 4317 conditions per place.
[2021-06-10 12:17:35,391 INFO L132 encePairwiseOnDemand]: 107/118 looper letters, 22 selfloop transitions, 63 changer transitions 28/247 dead transitions.
[2021-06-10 12:17:35,391 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 247 transitions, 2633 flow
[2021-06-10 12:17:35,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2021-06-10 12:17:35,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2021-06-10 12:17:35,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2039 transitions.
[2021-06-10 12:17:35,395 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9094558429973238
[2021-06-10 12:17:35,395 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2039 transitions.
[2021-06-10 12:17:35,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2039 transitions.
[2021-06-10 12:17:35,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:17:35,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2039 transitions.
[2021-06-10 12:17:35,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 107.3157894736842) internal successors, (2039), 19 states have internal predecessors, (2039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:35,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 118.0) internal successors, (2360), 20 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:35,403 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 118.0) internal successors, (2360), 20 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:35,403 INFO L185 Difference]: Start difference. First operand has 208 places, 212 transitions, 2100 flow. Second operand 19 states and 2039 transitions.
[2021-06-10 12:17:35,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 247 transitions, 2633 flow
[2021-06-10 12:17:39,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 247 transitions, 2039 flow, removed 251 selfloop flow, removed 30 redundant places.
[2021-06-10 12:17:39,301 INFO L241 Difference]: Finished difference. Result has 194 places, 209 transitions, 1719 flow
[2021-06-10 12:17:39,305 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1719, PETRI_PLACES=194, PETRI_TRANSITIONS=209}
[2021-06-10 12:17:39,305 INFO L343 CegarLoopForPetriNet]: 125 programPoint places, 69 predicate places.
[2021-06-10 12:17:39,305 INFO L480 AbstractCegarLoop]: Abstraction has has 194 places, 209 transitions, 1719 flow
[2021-06-10 12:17:39,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 104.11111111111111) internal successors, (937), 9 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:17:39,306 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:17:39,306 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-10 12:17:39,306 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-06-10 12:17:39,306 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:17:39,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:17:39,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1500698420, now seen corresponding path program 1 times
[2021-06-10 12:17:39,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:17:39,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036257718]
[2021-06-10 12:17:39,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:17:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-10 12:17:39,361 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-10 12:17:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-10 12:17:39,419 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-10 12:17:39,455 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-06-10 12:17:39,455 INFO L634 BasicCegarLoop]: Counterexample might be feasible
[2021-06-10 12:17:39,455 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-06-10 12:17:39,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.06 12:17:39 BasicIcfg
[2021-06-10 12:17:39,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-06-10 12:17:39,630 INFO L168 Benchmark]: Toolchain (without parser) took 26041.63 ms. Allocated memory was 339.7 MB in the beginning and 9.1 GB in the end (delta: 8.7 GB). Free memory was 302.1 MB in the beginning and 7.8 GB in the end (delta: -7.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.0 GB.
[2021-06-10 12:17:39,630 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 339.7 MB. Free memory was 320.5 MB in the beginning and 320.4 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB.
[2021-06-10 12:17:39,630 INFO L168 Benchmark]: CACSL2BoogieTranslator took 550.03 ms. Allocated memory is still 339.7 MB. Free memory was 301.9 MB in the beginning and 296.3 MB in the end (delta: 5.6 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB.
[2021-06-10 12:17:39,630 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.42 ms. Allocated memory is still 339.7 MB. Free memory was 296.3 MB in the beginning and 294.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-10 12:17:39,631 INFO L168 Benchmark]: Boogie Preprocessor took 48.05 ms. Allocated memory is still 339.7 MB. Free memory was 294.3 MB in the beginning and 292.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-10 12:17:39,631 INFO L168 Benchmark]: RCFGBuilder took 1889.20 ms. Allocated memory is still 339.7 MB. Free memory was 292.2 MB in the beginning and 193.7 MB in the end (delta: 98.5 MB). Peak memory consumption was 133.1 MB. Max. memory is 16.0 GB.
[2021-06-10 12:17:39,631 INFO L168 Benchmark]: TraceAbstraction took 23476.56 ms. Allocated memory was 339.7 MB in the beginning and 9.1 GB in the end (delta: 8.7 GB). Free memory was 192.6 MB in the beginning and 7.8 GB in the end (delta: -7.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 16.0 GB.
[2021-06-10 12:17:39,633 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.13 ms. Allocated memory is still 339.7 MB. Free memory was 320.5 MB in the beginning and 320.4 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB.
* CACSL2BoogieTranslator took 550.03 ms. Allocated memory is still 339.7 MB. Free memory was 301.9 MB in the beginning and 296.3 MB in the end (delta: 5.6 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB.
* Boogie Procedure Inliner took 70.42 ms. Allocated memory is still 339.7 MB. Free memory was 296.3 MB in the beginning and 294.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
* Boogie Preprocessor took 48.05 ms. Allocated memory is still 339.7 MB. Free memory was 294.3 MB in the beginning and 292.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
* RCFGBuilder took 1889.20 ms. Allocated memory is still 339.7 MB. Free memory was 292.2 MB in the beginning and 193.7 MB in the end (delta: 98.5 MB). Peak memory consumption was 133.1 MB. Max. memory is 16.0 GB.
* TraceAbstraction took 23476.56 ms. Allocated memory was 339.7 MB in the beginning and 9.1 GB in the end (delta: 8.7 GB). Free memory was 192.6 MB in the beginning and 7.8 GB in the end (delta: -7.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 16.0 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
VAL [__unbuffered_cnt=0]
[L712] 0 int __unbuffered_p3_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0]
[L714] 0 int __unbuffered_p3_EBX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0]
[L716] 0 int a = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0]
[L718] 0 int b = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0]
[L719] 0 _Bool b$flush_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0]
[L720] 0 int b$mem_tmp;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0]
[L721] 0 _Bool b$r_buff0_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0]
[L722] 0 _Bool b$r_buff0_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0]
[L723] 0 _Bool b$r_buff0_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0]
[L724] 0 _Bool b$r_buff0_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0]
[L725] 0 _Bool b$r_buff0_thd4;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0]
[L726] 0 _Bool b$r_buff1_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0]
[L727] 0 _Bool b$r_buff1_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0]
[L728] 0 _Bool b$r_buff1_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0]
[L729] 0 _Bool b$r_buff1_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0]
[L730] 0 _Bool b$r_buff1_thd4;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0]
[L731] 0 _Bool b$read_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0]
[L732] 0 int *b$read_delayed_var;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}]
[L733] 0 int b$w_buff0;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0]
[L734] 0 _Bool b$w_buff0_used;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0]
[L735] 0 int b$w_buff1;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0]
[L736] 0 _Bool b$w_buff1_used;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0]
[L737] 0 _Bool main$tmp_guard0;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0]
[L738] 0 _Bool main$tmp_guard1;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L740] 0 int x = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L742] 0 int y = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L744] 0 int z = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0]
[L745] 0 _Bool weak$$choice0;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0]
[L746] 0 _Bool weak$$choice2;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L867] 0 pthread_t t1249;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L868] FCALL, FORK 0 pthread_create(&t1249, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L750] 1 b$w_buff1 = b$w_buff0
[L751] 1 b$w_buff0 = 1
[L752] 1 b$w_buff1_used = b$w_buff0_used
[L753] 1 b$w_buff0_used = (_Bool)1
[L18] COND FALSE 1 !(!expression)
[L755] 1 b$r_buff1_thd0 = b$r_buff0_thd0
[L756] 1 b$r_buff1_thd1 = b$r_buff0_thd1
[L757] 1 b$r_buff1_thd2 = b$r_buff0_thd2
[L758] 1 b$r_buff1_thd3 = b$r_buff0_thd3
[L759] 1 b$r_buff1_thd4 = b$r_buff0_thd4
[L760] 1 b$r_buff0_thd1 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L763] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L869] 0 pthread_t t1250;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L870] FCALL, FORK 0 pthread_create(&t1250, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L780] 2 x = 2
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0]
[L783] 2 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0]
[L871] 0 pthread_t t1251;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0]
[L872] FCALL, FORK 0 pthread_create(&t1251, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0]
[L800] 3 y = 2
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0]
[L803] 3 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1]
[L873] 0 pthread_t t1252;
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1]
[L874] FCALL, FORK 0 pthread_create(&t1252, ((void *)0), P3, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1]
[L820] 4 z = 2
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2]
[L823] 4 a = 1
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2]
[L826] 4 __unbuffered_p3_EAX = a
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2]
[L829] 4 weak$$choice0 = __VERIFIER_nondet_bool()
[L830] 4 weak$$choice2 = __VERIFIER_nondet_bool()
[L831] 4 b$flush_delayed = weak$$choice2
[L832] 4 b$mem_tmp = b
[L833] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1)
[L833] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1)
[L834] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0))
[L834] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)
[L834] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0))
[L834] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0))
[L835] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1))
[L835] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)
[L835] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1))
[L835] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1))
[L836] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used))
[L836] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)
[L836] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used))
[L836] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used))
[L837] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L837] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)
[L837] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L837] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L838] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4))
[L838] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)
[L838] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4))
[L838] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4))
[L839] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L839] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)
[L839] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L839] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L840] 4 __unbuffered_p3_EBX = b
[L841] EXPR 4 b$flush_delayed ? b$mem_tmp : b
[L841] 4 b = b$flush_delayed ? b$mem_tmp : b
[L842] 4 b$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2]
[L845] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b)
[L845] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b
[L845] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b)
[L845] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b)
[L846] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used
[L846] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used
[L847] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used
[L847] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used
[L848] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4
[L848] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4
[L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4
[L849] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4
[L766] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b)
[L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b)
[L767] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used
[L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used
[L768] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used
[L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used
[L769] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1
[L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1
[L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1
[L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1
[L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2]
[L806] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b)
[L806] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b
[L806] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b)
[L806] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b)
[L807] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used
[L807] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used
[L808] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used
[L808] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used
[L809] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3
[L809] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3
[L810] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3
[L810] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3
[L786] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b)
[L786] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b
[L786] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b)
[L786] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b)
[L787] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used
[L787] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used
[L788] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used
[L788] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used
[L789] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2
[L789] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2
[L790] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2
[L790] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2
[L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2]
[L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2]
[L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2]
[L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4
VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2]
[L3] COND FALSE 0 !(!cond)
VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2]
[L880] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b)
[L880] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b
[L880] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b)
[L880] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b)
[L881] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used
[L881] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used
[L882] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used
[L882] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used
[L883] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0
[L883] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0
[L884] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0
[L884] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0
[L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2]
[L18] COND TRUE 0 !expression
VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2]
[L18] 0 reach_error()
VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 117 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 6.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 23138.9ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 21211.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 59.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 207 SDtfs, 443 SDslu, 690 SDs, 0 SdLazy, 561 SolverSat, 205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 643.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1566.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2100occurred in iteration=9, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 39.0ms SsaConstructionTime, 374.4ms SatisfiabilityAnalysisTime, 1159.7ms InterpolantComputationTime, 814 NumberOfCodeBlocks, 814 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 2655 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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!
Received shutdown request...