/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-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe000_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:57:04,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:57:04,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:57:04,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:57:04,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:57:04,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:57:04,978 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:57:04,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:57:04,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:57:04,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:57:04,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:57:04,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:57:04,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:57:04,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:57:04,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:57:04,996 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:57:04,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:57:05,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:57:05,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:57:05,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:57:05,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:57:05,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:57:05,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:57:05,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:57:05,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:57:05,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:57:05,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:57:05,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:57:05,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:57:05,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:57:05,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:57:05,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:57:05,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:57:05,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:57:05,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:57:05,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:57:05,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:57:05,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:57:05,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:57:05,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:57:05,130 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:57:05,136 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-RepeatedVariableLbe.epf [2021-03-25 04:57:05,171 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:57:05,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:57:05,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:57:05,175 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:57:05,175 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:57:05,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:57:05,175 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:57:05,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:57:05,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:57:05,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:57:05,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:57:05,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:57:05,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:57:05,176 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:57:05,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:57:05,177 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:57:05,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:57:05,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:57:05,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:57:05,177 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:57:05,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:57:05,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:57:05,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:57:05,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:57:05,178 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:57:05,178 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:57:05,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:57:05,178 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:57:05,178 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:57:05,178 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:57:05,179 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true 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-03-25 04:57:05,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:57:05,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:57:05,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:57:05,532 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:57:05,532 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:57:05,533 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_rmo.oepc.i [2021-03-25 04:57:05,594 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31029bc5a/be6ce3be3a154b05a7088f77a408c4eb/FLAGa745d3df3 [2021-03-25 04:57:06,152 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:57:06,153 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_rmo.oepc.i [2021-03-25 04:57:06,177 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31029bc5a/be6ce3be3a154b05a7088f77a408c4eb/FLAGa745d3df3 [2021-03-25 04:57:06,582 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31029bc5a/be6ce3be3a154b05a7088f77a408c4eb [2021-03-25 04:57:06,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:57:06,585 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:57:06,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:57:06,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:57:06,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:57:06,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:57:06" (1/1) ... [2021-03-25 04:57:06,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b0b9a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:57:06, skipping insertion in model container [2021-03-25 04:57:06,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:57:06" (1/1) ... [2021-03-25 04:57:06,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:57:06,628 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:57:06,791 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/safe000_rmo.oepc.i[993,1006] [2021-03-25 04:57:06,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:57:06,950 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:57:06,967 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/safe000_rmo.oepc.i[993,1006] [2021-03-25 04:57:07,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:57:07,107 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:57:07,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:57:07 WrapperNode [2021-03-25 04:57:07,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:57:07,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:57:07,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:57:07,111 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:57:07,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:57:07" (1/1) ... [2021-03-25 04:57:07,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:57:07" (1/1) ... [2021-03-25 04:57:07,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:57:07,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:57:07,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:57:07,194 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:57:07,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:57:07" (1/1) ... [2021-03-25 04:57:07,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:57:07" (1/1) ... [2021-03-25 04:57:07,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:57:07" (1/1) ... [2021-03-25 04:57:07,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:57:07" (1/1) ... [2021-03-25 04:57:07,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:57:07" (1/1) ... [2021-03-25 04:57:07,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:57:07" (1/1) ... [2021-03-25 04:57:07,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:57:07" (1/1) ... [2021-03-25 04:57:07,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:57:07,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:57:07,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:57:07,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:57:07,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:57:07" (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-03-25 04:57:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-25 04:57:07,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:57:07,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:57:07,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:57:07,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:57:07,340 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:57:07,340 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:57:07,340 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:57:07,341 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:57:07,341 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:57:07,341 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:57:07,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:57:07,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:57:07,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:57:07,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:57:07,343 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 04:57:10,237 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:57:10,237 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-03-25 04:57:10,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:57:10 BoogieIcfgContainer [2021-03-25 04:57:10,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:57:10,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:57:10,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:57:10,243 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:57:10,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:57:06" (1/3) ... [2021-03-25 04:57:10,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569b729b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:57:10, skipping insertion in model container [2021-03-25 04:57:10,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:57:07" (2/3) ... [2021-03-25 04:57:10,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569b729b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:57:10, skipping insertion in model container [2021-03-25 04:57:10,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:57:10" (3/3) ... [2021-03-25 04:57:10,246 INFO L111 eAbstractionObserver]: Analyzing ICFG safe000_rmo.oepc.i [2021-03-25 04:57:10,251 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:57:10,255 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-25 04:57:10,255 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:57:10,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,299 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,299 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,299 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,299 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,313 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,313 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,313 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,313 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,317 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,317 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,317 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,317 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,323 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,323 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,323 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,323 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,323 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,323 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,323 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,323 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,333 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,334 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,337 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,338 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,342 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,342 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:57:10,346 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:57:10,361 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-03-25 04:57:10,377 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:57:10,378 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:57:10,378 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:57:10,378 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:57:10,378 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:57:10,378 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:57:10,378 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:57:10,378 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:57:10,387 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2021-03-25 04:57:10,424 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-25 04:57:10,424 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:57:10,427 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2021-03-25 04:57:10,427 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2021-03-25 04:57:10,431 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 99 transitions, 207 flow [2021-03-25 04:57:10,432 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:57:10,439 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 99 transitions, 207 flow [2021-03-25 04:57:10,441 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 99 transitions, 207 flow [2021-03-25 04:57:10,443 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 99 transitions, 207 flow [2021-03-25 04:57:10,461 INFO L129 PetriNetUnfolder]: 1/99 cut-off events. [2021-03-25 04:57:10,461 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:57:10,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 99 events. 1/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2021-03-25 04:57:10,464 INFO L142 LiptonReduction]: Number of co-enabled transitions 1018 [2021-03-25 04:57:11,376 WARN L205 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 191 [2021-03-25 04:57:11,659 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 04:57:13,115 WARN L205 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 315 DAG size of output: 271 [2021-03-25 04:57:13,730 WARN L205 SmtUtils]: Spent 612.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 04:57:14,818 WARN L205 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 198 [2021-03-25 04:57:15,148 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-03-25 04:57:16,560 WARN L205 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 322 DAG size of output: 278 [2021-03-25 04:57:17,176 WARN L205 SmtUtils]: Spent 614.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2021-03-25 04:57:17,415 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-03-25 04:57:17,941 WARN L205 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2021-03-25 04:57:18,105 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-25 04:57:19,688 WARN L205 SmtUtils]: Spent 922.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 238 [2021-03-25 04:57:20,080 WARN L205 SmtUtils]: Spent 390.00 ms on a formula simplification that was a NOOP. DAG size: 236 [2021-03-25 04:57:21,757 WARN L205 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 370 DAG size of output: 326 [2021-03-25 04:57:22,522 WARN L205 SmtUtils]: Spent 763.00 ms on a formula simplification that was a NOOP. DAG size: 323 [2021-03-25 04:57:23,083 INFO L154 LiptonReduction]: Checked pairs total: 1971 [2021-03-25 04:57:23,084 INFO L156 LiptonReduction]: Total number of compositions: 63 [2021-03-25 04:57:23,085 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12654 [2021-03-25 04:57:23,102 INFO L129 PetriNetUnfolder]: 1/37 cut-off events. [2021-03-25 04:57:23,102 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:57:23,102 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:57:23,103 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] [2021-03-25 04:57:23,103 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:57:23,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:57:23,108 INFO L82 PathProgramCache]: Analyzing trace with hash -231262278, now seen corresponding path program 1 times [2021-03-25 04:57:23,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:57:23,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680514408] [2021-03-25 04:57:23,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:57:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:57:23,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:23,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:57:23,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:23,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:57:23,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:57:23,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680514408] [2021-03-25 04:57:23,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:57:23,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:57:23,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022727709] [2021-03-25 04:57:23,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-03-25 04:57:23,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:57:23,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-03-25 04:57:23,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-03-25 04:57:23,364 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 177 [2021-03-25 04:57:23,368 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 2 states, 2 states have (on average 172.5) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 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-03-25 04:57:23,368 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:57:23,368 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 177 [2021-03-25 04:57:23,369 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:57:23,389 INFO L129 PetriNetUnfolder]: 0/36 cut-off events. [2021-03-25 04:57:23,390 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:57:23,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2021-03-25 04:57:23,391 INFO L132 encePairwiseOnDemand]: 176/177 looper letters, 0 selfloop transitions, 0 changer transitions 0/36 dead transitions. [2021-03-25 04:57:23,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 81 flow [2021-03-25 04:57:23,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-03-25 04:57:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-03-25 04:57:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 345 transitions. [2021-03-25 04:57:23,407 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9745762711864406 [2021-03-25 04:57:23,407 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 345 transitions. [2021-03-25 04:57:23,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 345 transitions. [2021-03-25 04:57:23,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:57:23,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 345 transitions. [2021-03-25 04:57:23,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 172.5) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 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-03-25 04:57:23,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 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-03-25 04:57:23,425 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 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-03-25 04:57:23,426 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 2 states and 345 transitions. [2021-03-25 04:57:23,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 81 flow [2021-03-25 04:57:23,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 36 transitions, 78 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 04:57:23,431 INFO L241 Difference]: Finished difference. Result has 44 places, 36 transitions, 78 flow [2021-03-25 04:57:23,433 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2021-03-25 04:57:23,433 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-25 04:57:23,433 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:57:23,433 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 36 transitions, 78 flow [2021-03-25 04:57:23,435 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 36 transitions, 78 flow [2021-03-25 04:57:23,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 36 transitions, 78 flow [2021-03-25 04:57:23,442 INFO L129 PetriNetUnfolder]: 0/36 cut-off events. [2021-03-25 04:57:23,443 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:57:23,443 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2021-03-25 04:57:23,443 INFO L142 LiptonReduction]: Number of co-enabled transitions 230 [2021-03-25 04:57:23,578 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2021-03-25 04:57:24,482 WARN L205 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 238 [2021-03-25 04:57:24,853 WARN L205 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2021-03-25 04:57:26,332 WARN L205 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 326 DAG size of output: 325 [2021-03-25 04:57:27,060 WARN L205 SmtUtils]: Spent 726.00 ms on a formula simplification that was a NOOP. DAG size: 325 [2021-03-25 04:57:27,411 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-03-25 04:57:27,532 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-03-25 04:57:28,071 INFO L154 LiptonReduction]: Checked pairs total: 965 [2021-03-25 04:57:28,071 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 04:57:28,071 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4638 [2021-03-25 04:57:28,072 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 54 flow [2021-03-25 04:57:28,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 172.5) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 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-03-25 04:57:28,072 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:57:28,072 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] [2021-03-25 04:57:28,073 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:57:28,073 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:57:28,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:57:28,073 INFO L82 PathProgramCache]: Analyzing trace with hash -231401623, now seen corresponding path program 1 times [2021-03-25 04:57:28,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:57:28,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027365878] [2021-03-25 04:57:28,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:57:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:57:28,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:28,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:57:28,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:28,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:57:28,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:28,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:57:28,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:28,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:57:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:57:28,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027365878] [2021-03-25 04:57:28,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:57:28,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:57:28,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78315110] [2021-03-25 04:57:28,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:57:28,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:57:28,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:57:28,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:57:28,343 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 189 [2021-03-25 04:57:28,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 0 states have call successors, (0), 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-03-25 04:57:28,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:57:28,345 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 189 [2021-03-25 04:57:28,345 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:57:28,370 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-25 04:57:28,370 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:57:28,370 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 1/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:57:28,371 INFO L132 encePairwiseOnDemand]: 185/189 looper letters, 1 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2021-03-25 04:57:28,371 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 24 transitions, 62 flow [2021-03-25 04:57:28,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:57:28,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:57:28,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 677 transitions. [2021-03-25 04:57:28,376 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8955026455026455 [2021-03-25 04:57:28,376 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 677 transitions. [2021-03-25 04:57:28,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 677 transitions. [2021-03-25 04:57:28,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:57:28,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 677 transitions. [2021-03-25 04:57:28,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 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-03-25 04:57:28,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 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-03-25 04:57:28,381 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 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-03-25 04:57:28,381 INFO L185 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 4 states and 677 transitions. [2021-03-25 04:57:28,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 24 transitions, 62 flow [2021-03-25 04:57:28,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 24 transitions, 62 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 04:57:28,383 INFO L241 Difference]: Finished difference. Result has 35 places, 24 transitions, 64 flow [2021-03-25 04:57:28,383 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2021-03-25 04:57:28,383 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -12 predicate places. [2021-03-25 04:57:28,384 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:57:28,384 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 24 transitions, 64 flow [2021-03-25 04:57:28,384 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 24 transitions, 64 flow [2021-03-25 04:57:28,384 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 24 transitions, 64 flow [2021-03-25 04:57:28,388 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-25 04:57:28,389 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 04:57:28,389 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 24 events. 0/24 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:57:28,389 INFO L142 LiptonReduction]: Number of co-enabled transitions 184 [2021-03-25 04:57:29,105 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-25 04:57:29,244 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-25 04:57:29,518 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-25 04:57:29,694 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-25 04:57:30,211 WARN L205 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 159 [2021-03-25 04:57:30,466 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2021-03-25 04:57:31,022 WARN L205 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 159 [2021-03-25 04:57:31,270 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2021-03-25 04:57:31,272 INFO L154 LiptonReduction]: Checked pairs total: 840 [2021-03-25 04:57:31,273 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 04:57:31,273 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2889 [2021-03-25 04:57:31,273 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2021-03-25 04:57:31,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 0 states have call successors, (0), 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-03-25 04:57:31,274 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:57:31,274 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:57:31,274 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:57:31,274 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:57:31,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:57:31,275 INFO L82 PathProgramCache]: Analyzing trace with hash -842049774, now seen corresponding path program 1 times [2021-03-25 04:57:31,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:57:31,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212474973] [2021-03-25 04:57:31,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:57:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:57:31,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:31,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:57:31,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:31,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:57:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:57:31,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212474973] [2021-03-25 04:57:31,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:57:31,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:57:31,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316014120] [2021-03-25 04:57:31,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:57:31,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:57:31,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:57:31,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:57:31,413 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 193 [2021-03-25 04:57:31,414 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:57:31,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:57:31,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 193 [2021-03-25 04:57:31,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:57:31,429 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-03-25 04:57:31,429 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 04:57:31,430 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 20 events. 0/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 1/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:57:31,430 INFO L132 encePairwiseOnDemand]: 190/193 looper letters, 1 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2021-03-25 04:57:31,430 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 20 transitions, 60 flow [2021-03-25 04:57:31,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:57:31,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:57:31,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2021-03-25 04:57:31,432 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918825561312608 [2021-03-25 04:57:31,432 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 532 transitions. [2021-03-25 04:57:31,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 532 transitions. [2021-03-25 04:57:31,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:57:31,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 532 transitions. [2021-03-25 04:57:31,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:57:31,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 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-03-25 04:57:31,435 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 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-03-25 04:57:31,435 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 3 states and 532 transitions. [2021-03-25 04:57:31,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 20 transitions, 60 flow [2021-03-25 04:57:31,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 20 transitions, 56 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:57:31,435 INFO L241 Difference]: Finished difference. Result has 31 places, 20 transitions, 58 flow [2021-03-25 04:57:31,436 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2021-03-25 04:57:31,436 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -16 predicate places. [2021-03-25 04:57:31,436 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:57:31,436 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 58 flow [2021-03-25 04:57:31,436 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 20 transitions, 58 flow [2021-03-25 04:57:31,437 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 20 transitions, 58 flow [2021-03-25 04:57:31,442 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-03-25 04:57:31,442 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 04:57:31,443 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 20 events. 0/20 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:57:31,443 INFO L142 LiptonReduction]: Number of co-enabled transitions 182 [2021-03-25 04:57:31,448 INFO L154 LiptonReduction]: Checked pairs total: 198 [2021-03-25 04:57:31,448 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:57:31,448 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12 [2021-03-25 04:57:31,449 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 58 flow [2021-03-25 04:57:31,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:57:31,450 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:57:31,450 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:57:31,450 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:57:31,450 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:57:31,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:57:31,450 INFO L82 PathProgramCache]: Analyzing trace with hash -958839420, now seen corresponding path program 1 times [2021-03-25 04:57:31,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:57:31,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548864610] [2021-03-25 04:57:31,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:57:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:57:31,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:31,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:57:31,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:31,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:57:31,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:57:31,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548864610] [2021-03-25 04:57:31,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:57:31,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:57:31,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240956228] [2021-03-25 04:57:31,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:57:31,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:57:31,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:57:31,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:57:31,542 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 193 [2021-03-25 04:57:31,543 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:57:31,543 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:57:31,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 193 [2021-03-25 04:57:31,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:57:31,568 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2021-03-25 04:57:31,569 INFO L130 PetriNetUnfolder]: For 11/18 co-relation queries the response was YES. [2021-03-25 04:57:31,569 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 26 events. 0/26 cut-off events. For 11/18 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 2/28 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-25 04:57:31,569 INFO L132 encePairwiseOnDemand]: 189/193 looper letters, 1 selfloop transitions, 3 changer transitions 1/21 dead transitions. [2021-03-25 04:57:31,569 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 21 transitions, 73 flow [2021-03-25 04:57:31,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:57:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:57:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 683 transitions. [2021-03-25 04:57:31,572 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8847150259067358 [2021-03-25 04:57:31,572 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 683 transitions. [2021-03-25 04:57:31,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 683 transitions. [2021-03-25 04:57:31,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:57:31,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 683 transitions. [2021-03-25 04:57:31,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 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-03-25 04:57:31,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 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-03-25 04:57:31,577 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 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-03-25 04:57:31,577 INFO L185 Difference]: Start difference. First operand has 31 places, 20 transitions, 58 flow. Second operand 4 states and 683 transitions. [2021-03-25 04:57:31,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 21 transitions, 73 flow [2021-03-25 04:57:31,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 21 transitions, 67 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:57:31,578 INFO L241 Difference]: Finished difference. Result has 34 places, 20 transitions, 68 flow [2021-03-25 04:57:31,578 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2021-03-25 04:57:31,578 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -13 predicate places. [2021-03-25 04:57:31,578 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:57:31,579 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 20 transitions, 68 flow [2021-03-25 04:57:31,579 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 20 transitions, 68 flow [2021-03-25 04:57:31,579 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 20 transitions, 68 flow [2021-03-25 04:57:31,584 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-03-25 04:57:31,585 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2021-03-25 04:57:31,585 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 20 events. 0/20 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:57:31,585 INFO L142 LiptonReduction]: Number of co-enabled transitions 164 [2021-03-25 04:57:31,898 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2021-03-25 04:57:32,219 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2021-03-25 04:57:32,821 WARN L205 SmtUtils]: Spent 599.00 ms on a formula simplification that was a NOOP. DAG size: 277 [2021-03-25 04:57:33,452 WARN L205 SmtUtils]: Spent 629.00 ms on a formula simplification that was a NOOP. DAG size: 277 [2021-03-25 04:57:33,455 INFO L154 LiptonReduction]: Checked pairs total: 312 [2021-03-25 04:57:33,455 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:57:33,455 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1877 [2021-03-25 04:57:33,455 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 19 transitions, 66 flow [2021-03-25 04:57:33,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:57:33,456 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:57:33,456 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:57:33,456 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:57:33,456 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:57:33,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:57:33,456 INFO L82 PathProgramCache]: Analyzing trace with hash 581861582, now seen corresponding path program 1 times [2021-03-25 04:57:33,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:57:33,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018281419] [2021-03-25 04:57:33,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:57:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:57:33,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:33,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:57:33,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:57:33,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018281419] [2021-03-25 04:57:33,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:57:33,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 04:57:33,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298648203] [2021-03-25 04:57:33,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:57:33,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:57:33,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:57:33,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:57:33,507 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 194 [2021-03-25 04:57:33,508 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 19 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 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-03-25 04:57:33,508 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:57:33,508 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 194 [2021-03-25 04:57:33,508 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:57:33,521 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2021-03-25 04:57:33,521 INFO L130 PetriNetUnfolder]: For 23/25 co-relation queries the response was YES. [2021-03-25 04:57:33,521 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 19 events. 0/19 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 1/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:57:33,521 INFO L132 encePairwiseOnDemand]: 191/194 looper letters, 1 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2021-03-25 04:57:33,521 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 19 transitions, 72 flow [2021-03-25 04:57:33,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:57:33,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:57:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2021-03-25 04:57:33,523 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9192439862542955 [2021-03-25 04:57:33,523 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 535 transitions. [2021-03-25 04:57:33,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 535 transitions. [2021-03-25 04:57:33,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:57:33,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 535 transitions. [2021-03-25 04:57:33,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:57:33,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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-03-25 04:57:33,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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-03-25 04:57:33,526 INFO L185 Difference]: Start difference. First operand has 33 places, 19 transitions, 66 flow. Second operand 3 states and 535 transitions. [2021-03-25 04:57:33,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 19 transitions, 72 flow [2021-03-25 04:57:33,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 19 transitions, 56 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-03-25 04:57:33,527 INFO L241 Difference]: Finished difference. Result has 31 places, 19 transitions, 58 flow [2021-03-25 04:57:33,528 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2021-03-25 04:57:33,528 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -16 predicate places. [2021-03-25 04:57:33,528 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:57:33,528 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 19 transitions, 58 flow [2021-03-25 04:57:33,528 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 19 transitions, 58 flow [2021-03-25 04:57:33,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 19 transitions, 58 flow [2021-03-25 04:57:33,532 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2021-03-25 04:57:33,532 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 04:57:33,533 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 19 events. 0/19 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:57:33,533 INFO L142 LiptonReduction]: Number of co-enabled transitions 142 [2021-03-25 04:57:33,534 INFO L154 LiptonReduction]: Checked pairs total: 140 [2021-03-25 04:57:33,534 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:57:33,534 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6 [2021-03-25 04:57:33,535 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 58 flow [2021-03-25 04:57:33,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 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-03-25 04:57:33,535 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:57:33,535 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:57:33,535 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:57:33,535 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:57:33,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:57:33,536 INFO L82 PathProgramCache]: Analyzing trace with hash -106232614, now seen corresponding path program 1 times [2021-03-25 04:57:33,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:57:33,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571270846] [2021-03-25 04:57:33,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:57:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:57:33,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:33,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 04:57:33,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:33,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 04:57:33,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:33,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 04:57:33,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:33,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 04:57:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:57:33,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571270846] [2021-03-25 04:57:33,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:57:33,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:57:33,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867915131] [2021-03-25 04:57:33,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:57:33,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:57:33,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:57:33,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:57:33,712 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 194 [2021-03-25 04:57:33,713 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 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-03-25 04:57:33,713 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:57:33,713 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 194 [2021-03-25 04:57:33,713 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:57:33,895 INFO L129 PetriNetUnfolder]: 54/136 cut-off events. [2021-03-25 04:57:33,895 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-03-25 04:57:33,896 INFO L84 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 136 events. 54/136 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 526 event pairs, 19 based on Foata normal form. 4/138 useless extension candidates. Maximal degree in co-relation 294. Up to 89 conditions per place. [2021-03-25 04:57:33,897 INFO L132 encePairwiseOnDemand]: 186/194 looper letters, 11 selfloop transitions, 9 changer transitions 0/28 dead transitions. [2021-03-25 04:57:33,897 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 28 transitions, 118 flow [2021-03-25 04:57:33,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:57:33,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:57:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2021-03-25 04:57:33,905 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6824742268041237 [2021-03-25 04:57:33,905 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2021-03-25 04:57:33,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2021-03-25 04:57:33,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:57:33,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2021-03-25 04:57:33,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 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-03-25 04:57:33,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 194.0) internal successors, (1164), 6 states have internal predecessors, (1164), 0 states have call successors, (0), 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-03-25 04:57:33,910 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 194.0) internal successors, (1164), 6 states have internal predecessors, (1164), 0 states have call successors, (0), 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-03-25 04:57:33,910 INFO L185 Difference]: Start difference. First operand has 31 places, 19 transitions, 58 flow. Second operand 5 states and 662 transitions. [2021-03-25 04:57:33,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 28 transitions, 118 flow [2021-03-25 04:57:33,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:57:33,912 INFO L241 Difference]: Finished difference. Result has 35 places, 25 transitions, 107 flow [2021-03-25 04:57:33,913 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2021-03-25 04:57:33,913 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -12 predicate places. [2021-03-25 04:57:33,913 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:57:33,913 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 107 flow [2021-03-25 04:57:33,913 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 25 transitions, 107 flow [2021-03-25 04:57:33,913 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 107 flow [2021-03-25 04:57:33,922 INFO L129 PetriNetUnfolder]: 9/46 cut-off events. [2021-03-25 04:57:33,922 INFO L130 PetriNetUnfolder]: For 29/30 co-relation queries the response was YES. [2021-03-25 04:57:33,923 INFO L84 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 46 events. 9/46 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 3 based on Foata normal form. 1/46 useless extension candidates. Maximal degree in co-relation 107. Up to 19 conditions per place. [2021-03-25 04:57:33,923 INFO L142 LiptonReduction]: Number of co-enabled transitions 168 [2021-03-25 04:57:33,956 INFO L154 LiptonReduction]: Checked pairs total: 284 [2021-03-25 04:57:33,958 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:57:33,958 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 45 [2021-03-25 04:57:33,960 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 109 flow [2021-03-25 04:57:33,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 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-03-25 04:57:33,960 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:57:33,961 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:57:33,961 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:57:33,961 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:57:33,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:57:33,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1054428533, now seen corresponding path program 1 times [2021-03-25 04:57:33,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:57:33,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052279844] [2021-03-25 04:57:33,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:57:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:57:34,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:34,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 04:57:34,132 INFO L142 QuantifierPusher]: treesize reduction 35, result has 69.8 percent of original size [2021-03-25 04:57:34,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 81 [2021-03-25 04:57:34,158 INFO L142 QuantifierPusher]: treesize reduction 35, result has 69.8 percent of original size [2021-03-25 04:57:34,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 81 [2021-03-25 04:57:34,163 INFO L142 QuantifierPusher]: treesize reduction 35, result has 68.8 percent of original size [2021-03-25 04:57:34,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 77 [2021-03-25 04:57:34,184 INFO L142 QuantifierPusher]: treesize reduction 14, result has 22.2 percent of original size [2021-03-25 04:57:34,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:57:34,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:34,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:57:34,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:57:34,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052279844] [2021-03-25 04:57:34,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:57:34,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:57:34,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58805530] [2021-03-25 04:57:34,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:57:34,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:57:34,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:57:34,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:57:34,192 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 195 [2021-03-25 04:57:34,193 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 109 flow. Second operand has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 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-03-25 04:57:34,193 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:57:34,193 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 195 [2021-03-25 04:57:34,193 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:57:34,324 INFO L129 PetriNetUnfolder]: 56/151 cut-off events. [2021-03-25 04:57:34,325 INFO L130 PetriNetUnfolder]: For 153/155 co-relation queries the response was YES. [2021-03-25 04:57:34,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 151 events. 56/151 cut-off events. For 153/155 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 663 event pairs, 12 based on Foata normal form. 9/157 useless extension candidates. Maximal degree in co-relation 402. Up to 52 conditions per place. [2021-03-25 04:57:34,326 INFO L132 encePairwiseOnDemand]: 187/195 looper letters, 14 selfloop transitions, 3 changer transitions 14/39 dead transitions. [2021-03-25 04:57:34,326 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 220 flow [2021-03-25 04:57:34,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:57:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:57:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 633 transitions. [2021-03-25 04:57:34,329 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6492307692307693 [2021-03-25 04:57:34,329 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 633 transitions. [2021-03-25 04:57:34,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 633 transitions. [2021-03-25 04:57:34,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:57:34,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 633 transitions. [2021-03-25 04:57:34,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 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-03-25 04:57:34,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 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-03-25 04:57:34,333 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 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-03-25 04:57:34,333 INFO L185 Difference]: Start difference. First operand has 35 places, 25 transitions, 109 flow. Second operand 5 states and 633 transitions. [2021-03-25 04:57:34,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 220 flow [2021-03-25 04:57:34,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:57:34,335 INFO L241 Difference]: Finished difference. Result has 41 places, 21 transitions, 104 flow [2021-03-25 04:57:34,335 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=41, PETRI_TRANSITIONS=21} [2021-03-25 04:57:34,335 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -6 predicate places. [2021-03-25 04:57:34,335 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:57:34,335 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 21 transitions, 104 flow [2021-03-25 04:57:34,335 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 21 transitions, 104 flow [2021-03-25 04:57:34,336 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 21 transitions, 104 flow [2021-03-25 04:57:34,343 INFO L129 PetriNetUnfolder]: 7/39 cut-off events. [2021-03-25 04:57:34,343 INFO L130 PetriNetUnfolder]: For 73/75 co-relation queries the response was YES. [2021-03-25 04:57:34,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 39 events. 7/39 cut-off events. For 73/75 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 81 event pairs, 5 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 103. Up to 14 conditions per place. [2021-03-25 04:57:34,344 INFO L142 LiptonReduction]: Number of co-enabled transitions 120 [2021-03-25 04:57:34,371 INFO L154 LiptonReduction]: Checked pairs total: 126 [2021-03-25 04:57:34,372 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:57:34,372 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 37 [2021-03-25 04:57:34,372 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 20 transitions, 102 flow [2021-03-25 04:57:34,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 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-03-25 04:57:34,373 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:57:34,373 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:57:34,373 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:57:34,373 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:57:34,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:57:34,373 INFO L82 PathProgramCache]: Analyzing trace with hash -817635197, now seen corresponding path program 1 times [2021-03-25 04:57:34,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:57:34,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105213686] [2021-03-25 04:57:34,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:57:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:57:34,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:34,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 04:57:34,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:34,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 04:57:34,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:34,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 04:57:34,479 INFO L142 QuantifierPusher]: treesize reduction 17, result has 59.5 percent of original size [2021-03-25 04:57:34,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 04:57:34,496 INFO L142 QuantifierPusher]: treesize reduction 17, result has 52.8 percent of original size [2021-03-25 04:57:34,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 04:57:34,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:57:34,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105213686] [2021-03-25 04:57:34,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:57:34,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:57:34,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495432573] [2021-03-25 04:57:34,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:57:34,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:57:34,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:57:34,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:57:34,513 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 196 [2021-03-25 04:57:34,513 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 20 transitions, 102 flow. Second operand has 6 states, 6 states have (on average 131.5) internal successors, (789), 6 states have internal predecessors, (789), 0 states have call successors, (0), 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-03-25 04:57:34,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:57:34,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 196 [2021-03-25 04:57:34,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:57:34,643 INFO L129 PetriNetUnfolder]: 35/104 cut-off events. [2021-03-25 04:57:34,643 INFO L130 PetriNetUnfolder]: For 207/211 co-relation queries the response was YES. [2021-03-25 04:57:34,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 104 events. 35/104 cut-off events. For 207/211 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 6 based on Foata normal form. 4/107 useless extension candidates. Maximal degree in co-relation 357. Up to 61 conditions per place. [2021-03-25 04:57:34,644 INFO L132 encePairwiseOnDemand]: 188/196 looper letters, 15 selfloop transitions, 12 changer transitions 0/34 dead transitions. [2021-03-25 04:57:34,644 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 223 flow [2021-03-25 04:57:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:57:34,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:57:34,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 674 transitions. [2021-03-25 04:57:34,647 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6877551020408164 [2021-03-25 04:57:34,648 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 674 transitions. [2021-03-25 04:57:34,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 674 transitions. [2021-03-25 04:57:34,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:57:34,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 674 transitions. [2021-03-25 04:57:34,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 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-03-25 04:57:34,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 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-03-25 04:57:34,651 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 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-03-25 04:57:34,651 INFO L185 Difference]: Start difference. First operand has 39 places, 20 transitions, 102 flow. Second operand 5 states and 674 transitions. [2021-03-25 04:57:34,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 223 flow [2021-03-25 04:57:34,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 187 flow, removed 9 selfloop flow, removed 7 redundant places. [2021-03-25 04:57:34,654 INFO L241 Difference]: Finished difference. Result has 39 places, 30 transitions, 179 flow [2021-03-25 04:57:34,654 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2021-03-25 04:57:34,654 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -8 predicate places. [2021-03-25 04:57:34,654 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:57:34,655 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 30 transitions, 179 flow [2021-03-25 04:57:34,655 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 179 flow [2021-03-25 04:57:34,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 179 flow [2021-03-25 04:57:34,668 INFO L129 PetriNetUnfolder]: 24/88 cut-off events. [2021-03-25 04:57:34,669 INFO L130 PetriNetUnfolder]: For 137/137 co-relation queries the response was YES. [2021-03-25 04:57:34,669 INFO L84 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 88 events. 24/88 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 315 event pairs, 7 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 268. Up to 31 conditions per place. [2021-03-25 04:57:34,672 INFO L142 LiptonReduction]: Number of co-enabled transitions 138 [2021-03-25 04:57:34,675 INFO L154 LiptonReduction]: Checked pairs total: 110 [2021-03-25 04:57:34,675 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:57:34,675 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-25 04:57:34,675 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 179 flow [2021-03-25 04:57:34,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 131.5) internal successors, (789), 6 states have internal predecessors, (789), 0 states have call successors, (0), 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-03-25 04:57:34,676 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:57:34,676 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:57:34,676 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:57:34,676 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:57:34,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:57:34,676 INFO L82 PathProgramCache]: Analyzing trace with hash 190453502, now seen corresponding path program 1 times [2021-03-25 04:57:34,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:57:34,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419637578] [2021-03-25 04:57:34,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:57:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:57:34,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:34,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:57:34,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:34,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:57:34,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:34,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:57:34,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:57:34,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419637578] [2021-03-25 04:57:34,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:57:34,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:57:34,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029482944] [2021-03-25 04:57:34,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:57:34,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:57:34,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:57:34,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:57:34,784 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 196 [2021-03-25 04:57:34,784 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:57:34,784 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:57:34,784 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 196 [2021-03-25 04:57:34,784 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:57:34,844 INFO L129 PetriNetUnfolder]: 92/218 cut-off events. [2021-03-25 04:57:34,844 INFO L130 PetriNetUnfolder]: For 498/603 co-relation queries the response was YES. [2021-03-25 04:57:34,845 INFO L84 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 218 events. 92/218 cut-off events. For 498/603 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1064 event pairs, 25 based on Foata normal form. 48/249 useless extension candidates. Maximal degree in co-relation 663. Up to 109 conditions per place. [2021-03-25 04:57:34,846 INFO L132 encePairwiseOnDemand]: 190/196 looper letters, 10 selfloop transitions, 8 changer transitions 0/40 dead transitions. [2021-03-25 04:57:34,846 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 235 flow [2021-03-25 04:57:34,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:57:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:57:34,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 863 transitions. [2021-03-25 04:57:34,849 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8806122448979592 [2021-03-25 04:57:34,850 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 863 transitions. [2021-03-25 04:57:34,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 863 transitions. [2021-03-25 04:57:34,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:57:34,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 863 transitions. [2021-03-25 04:57:34,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.6) internal successors, (863), 5 states have internal predecessors, (863), 0 states have call successors, (0), 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-03-25 04:57:34,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 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-03-25 04:57:34,854 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 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-03-25 04:57:34,854 INFO L185 Difference]: Start difference. First operand has 39 places, 30 transitions, 179 flow. Second operand 5 states and 863 transitions. [2021-03-25 04:57:34,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 235 flow [2021-03-25 04:57:34,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 40 transitions, 230 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 04:57:34,857 INFO L241 Difference]: Finished difference. Result has 45 places, 37 transitions, 242 flow [2021-03-25 04:57:34,857 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=242, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2021-03-25 04:57:34,857 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2021-03-25 04:57:34,858 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:57:34,858 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 37 transitions, 242 flow [2021-03-25 04:57:34,858 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 37 transitions, 242 flow [2021-03-25 04:57:34,858 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 37 transitions, 242 flow [2021-03-25 04:57:34,891 INFO L129 PetriNetUnfolder]: 96/225 cut-off events. [2021-03-25 04:57:34,891 INFO L130 PetriNetUnfolder]: For 478/510 co-relation queries the response was YES. [2021-03-25 04:57:34,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 225 events. 96/225 cut-off events. For 478/510 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1104 event pairs, 33 based on Foata normal form. 1/207 useless extension candidates. Maximal degree in co-relation 790. Up to 119 conditions per place. [2021-03-25 04:57:34,894 INFO L142 LiptonReduction]: Number of co-enabled transitions 206 [2021-03-25 04:57:34,902 INFO L154 LiptonReduction]: Checked pairs total: 45 [2021-03-25 04:57:34,902 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:57:34,902 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 44 [2021-03-25 04:57:34,903 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 242 flow [2021-03-25 04:57:34,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:57:34,904 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:57:34,904 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:57:34,904 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:57:34,904 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:57:34,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:57:34,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1426602044, now seen corresponding path program 1 times [2021-03-25 04:57:34,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:57:34,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90069305] [2021-03-25 04:57:34,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:57:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:57:35,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:35,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 04:57:35,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:35,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 04:57:35,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:35,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 04:57:35,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:35,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 04:57:35,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:35,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-25 04:57:35,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:35,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 04:57:35,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:57:35,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90069305] [2021-03-25 04:57:35,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:57:35,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 04:57:35,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710254334] [2021-03-25 04:57:35,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 04:57:35,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:57:35,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 04:57:35,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-03-25 04:57:35,142 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 196 [2021-03-25 04:57:35,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 242 flow. Second operand has 8 states, 8 states have (on average 129.125) internal successors, (1033), 8 states have internal predecessors, (1033), 0 states have call successors, (0), 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-03-25 04:57:35,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:57:35,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 196 [2021-03-25 04:57:35,144 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:57:35,338 INFO L129 PetriNetUnfolder]: 106/242 cut-off events. [2021-03-25 04:57:35,338 INFO L130 PetriNetUnfolder]: For 735/832 co-relation queries the response was YES. [2021-03-25 04:57:35,339 INFO L84 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 242 events. 106/242 cut-off events. For 735/832 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1151 event pairs, 34 based on Foata normal form. 19/240 useless extension candidates. Maximal degree in co-relation 964. Up to 120 conditions per place. [2021-03-25 04:57:35,340 INFO L132 encePairwiseOnDemand]: 190/196 looper letters, 12 selfloop transitions, 15 changer transitions 0/41 dead transitions. [2021-03-25 04:57:35,341 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 41 transitions, 329 flow [2021-03-25 04:57:35,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:57:35,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:57:35,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2021-03-25 04:57:35,343 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.673469387755102 [2021-03-25 04:57:35,343 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2021-03-25 04:57:35,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2021-03-25 04:57:35,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:57:35,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2021-03-25 04:57:35,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 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-03-25 04:57:35,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 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-03-25 04:57:35,347 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 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-03-25 04:57:35,347 INFO L185 Difference]: Start difference. First operand has 45 places, 37 transitions, 242 flow. Second operand 5 states and 660 transitions. [2021-03-25 04:57:35,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 41 transitions, 329 flow [2021-03-25 04:57:35,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 41 transitions, 325 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:57:35,351 INFO L241 Difference]: Finished difference. Result has 49 places, 39 transitions, 302 flow [2021-03-25 04:57:35,351 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2021-03-25 04:57:35,351 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2021-03-25 04:57:35,351 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:57:35,351 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 39 transitions, 302 flow [2021-03-25 04:57:35,351 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 39 transitions, 302 flow [2021-03-25 04:57:35,352 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 39 transitions, 302 flow [2021-03-25 04:57:35,379 INFO L129 PetriNetUnfolder]: 97/223 cut-off events. [2021-03-25 04:57:35,379 INFO L130 PetriNetUnfolder]: For 691/733 co-relation queries the response was YES. [2021-03-25 04:57:35,380 INFO L84 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 223 events. 97/223 cut-off events. For 691/733 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1055 event pairs, 25 based on Foata normal form. 1/205 useless extension candidates. Maximal degree in co-relation 851. Up to 115 conditions per place. [2021-03-25 04:57:35,382 INFO L142 LiptonReduction]: Number of co-enabled transitions 210 [2021-03-25 04:57:35,386 INFO L154 LiptonReduction]: Checked pairs total: 45 [2021-03-25 04:57:35,386 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:57:35,386 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35 [2021-03-25 04:57:35,387 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 302 flow [2021-03-25 04:57:35,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 129.125) internal successors, (1033), 8 states have internal predecessors, (1033), 0 states have call successors, (0), 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-03-25 04:57:35,387 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:57:35,387 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:57:35,387 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:57:35,387 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:57:35,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:57:35,388 INFO L82 PathProgramCache]: Analyzing trace with hash -351208204, now seen corresponding path program 1 times [2021-03-25 04:57:35,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:57:35,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397085883] [2021-03-25 04:57:35,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:57:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:57:35,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:35,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:57:35,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:35,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:57:35,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:35,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:57:35,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:35,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:57:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:57:35,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397085883] [2021-03-25 04:57:35,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:57:35,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:57:35,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705162062] [2021-03-25 04:57:35,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:57:35,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:57:35,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:57:35,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:57:35,483 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 196 [2021-03-25 04:57:35,484 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 0 states have call successors, (0), 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-03-25 04:57:35,484 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:57:35,484 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 196 [2021-03-25 04:57:35,484 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:57:35,565 INFO L129 PetriNetUnfolder]: 48/146 cut-off events. [2021-03-25 04:57:35,565 INFO L130 PetriNetUnfolder]: For 640/820 co-relation queries the response was YES. [2021-03-25 04:57:35,566 INFO L84 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 146 events. 48/146 cut-off events. For 640/820 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 659 event pairs, 7 based on Foata normal form. 89/227 useless extension candidates. Maximal degree in co-relation 603. Up to 85 conditions per place. [2021-03-25 04:57:35,567 INFO L132 encePairwiseOnDemand]: 190/196 looper letters, 7 selfloop transitions, 13 changer transitions 5/49 dead transitions. [2021-03-25 04:57:35,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 410 flow [2021-03-25 04:57:35,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:57:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:57:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1208 transitions. [2021-03-25 04:57:35,571 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.880466472303207 [2021-03-25 04:57:35,571 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1208 transitions. [2021-03-25 04:57:35,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1208 transitions. [2021-03-25 04:57:35,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:57:35,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1208 transitions. [2021-03-25 04:57:35,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 172.57142857142858) internal successors, (1208), 7 states have internal predecessors, (1208), 0 states have call successors, (0), 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-03-25 04:57:35,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 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-03-25 04:57:35,577 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 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-03-25 04:57:35,577 INFO L185 Difference]: Start difference. First operand has 49 places, 39 transitions, 302 flow. Second operand 7 states and 1208 transitions. [2021-03-25 04:57:35,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 410 flow [2021-03-25 04:57:35,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 49 transitions, 401 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:57:35,581 INFO L241 Difference]: Finished difference. Result has 56 places, 44 transitions, 383 flow [2021-03-25 04:57:35,581 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=383, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2021-03-25 04:57:35,581 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2021-03-25 04:57:35,581 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:57:35,581 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 44 transitions, 383 flow [2021-03-25 04:57:35,581 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 44 transitions, 383 flow [2021-03-25 04:57:35,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 44 transitions, 383 flow [2021-03-25 04:57:35,601 INFO L129 PetriNetUnfolder]: 38/133 cut-off events. [2021-03-25 04:57:35,601 INFO L130 PetriNetUnfolder]: For 642/747 co-relation queries the response was YES. [2021-03-25 04:57:35,602 INFO L84 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 133 events. 38/133 cut-off events. For 642/747 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 637 event pairs, 5 based on Foata normal form. 13/139 useless extension candidates. Maximal degree in co-relation 598. Up to 72 conditions per place. [2021-03-25 04:57:35,603 INFO L142 LiptonReduction]: Number of co-enabled transitions 236 [2021-03-25 04:57:36,874 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 297 DAG size of output: 246 [2021-03-25 04:57:37,192 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 222 [2021-03-25 04:57:39,774 WARN L205 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 406 DAG size of output: 326 [2021-03-25 04:57:40,444 WARN L205 SmtUtils]: Spent 665.00 ms on a formula simplification that was a NOOP. DAG size: 301 [2021-03-25 04:57:40,451 INFO L154 LiptonReduction]: Checked pairs total: 171 [2021-03-25 04:57:40,451 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:57:40,451 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4870 [2021-03-25 04:57:40,452 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 391 flow [2021-03-25 04:57:40,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 0 states have call successors, (0), 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-03-25 04:57:40,452 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:57:40,452 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:57:40,452 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 04:57:40,452 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:57:40,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:57:40,452 INFO L82 PathProgramCache]: Analyzing trace with hash 244295430, now seen corresponding path program 1 times [2021-03-25 04:57:40,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:57:40,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189821415] [2021-03-25 04:57:40,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:57:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:57:40,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:40,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:57:40,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:40,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:57:40,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:40,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:57:40,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:40,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:57:40,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:57:40,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:57:40,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:57:40,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189821415] [2021-03-25 04:57:40,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:57:40,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:57:40,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913287318] [2021-03-25 04:57:40,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:57:40,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:57:40,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:57:40,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:57:40,545 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 197 [2021-03-25 04:57:40,546 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 391 flow. Second operand has 6 states, 6 states have (on average 169.83333333333334) internal successors, (1019), 6 states have internal predecessors, (1019), 0 states have call successors, (0), 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-03-25 04:57:40,546 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:57:40,546 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 197 [2021-03-25 04:57:40,546 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:57:40,628 INFO L129 PetriNetUnfolder]: 27/109 cut-off events. [2021-03-25 04:57:40,628 INFO L130 PetriNetUnfolder]: For 667/882 co-relation queries the response was YES. [2021-03-25 04:57:40,629 INFO L84 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 109 events. 27/109 cut-off events. For 667/882 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 491 event pairs, 1 based on Foata normal form. 87/192 useless extension candidates. Maximal degree in co-relation 541. Up to 71 conditions per place. [2021-03-25 04:57:40,630 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 2 selfloop transitions, 17 changer transitions 3/43 dead transitions. [2021-03-25 04:57:40,630 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 43 transitions, 399 flow [2021-03-25 04:57:40,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 04:57:40,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 04:57:40,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1545 transitions. [2021-03-25 04:57:40,634 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.871404399323181 [2021-03-25 04:57:40,634 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1545 transitions. [2021-03-25 04:57:40,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1545 transitions. [2021-03-25 04:57:40,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:57:40,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1545 transitions. [2021-03-25 04:57:40,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 171.66666666666666) internal successors, (1545), 9 states have internal predecessors, (1545), 0 states have call successors, (0), 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-03-25 04:57:40,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 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-03-25 04:57:40,641 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 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-03-25 04:57:40,641 INFO L185 Difference]: Start difference. First operand has 56 places, 44 transitions, 391 flow. Second operand 9 states and 1545 transitions. [2021-03-25 04:57:40,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 43 transitions, 399 flow [2021-03-25 04:57:40,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 43 transitions, 332 flow, removed 18 selfloop flow, removed 5 redundant places. [2021-03-25 04:57:40,645 INFO L241 Difference]: Finished difference. Result has 62 places, 40 transitions, 312 flow [2021-03-25 04:57:40,645 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=312, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2021-03-25 04:57:40,645 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 15 predicate places. [2021-03-25 04:57:40,645 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:57:40,645 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 40 transitions, 312 flow [2021-03-25 04:57:40,645 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 40 transitions, 312 flow [2021-03-25 04:57:40,646 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 40 transitions, 312 flow [2021-03-25 04:57:40,658 INFO L129 PetriNetUnfolder]: 23/100 cut-off events. [2021-03-25 04:57:40,658 INFO L130 PetriNetUnfolder]: For 288/301 co-relation queries the response was YES. [2021-03-25 04:57:40,658 INFO L84 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 100 events. 23/100 cut-off events. For 288/301 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 485 event pairs, 1 based on Foata normal form. 3/99 useless extension candidates. Maximal degree in co-relation 397. Up to 32 conditions per place. [2021-03-25 04:57:40,659 INFO L142 LiptonReduction]: Number of co-enabled transitions 228 [2021-03-25 04:57:42,060 WARN L205 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 297 DAG size of output: 246 [2021-03-25 04:57:42,387 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 222 [2021-03-25 04:57:45,459 WARN L205 SmtUtils]: Spent 3.07 s on a formula simplification. DAG size of input: 406 DAG size of output: 326 [2021-03-25 04:57:46,364 WARN L205 SmtUtils]: Spent 900.00 ms on a formula simplification that was a NOOP. DAG size: 301 [2021-03-25 04:57:46,767 WARN L205 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 232 [2021-03-25 04:57:47,162 WARN L205 SmtUtils]: Spent 390.00 ms on a formula simplification that was a NOOP. DAG size: 232 [2021-03-25 04:57:47,901 WARN L205 SmtUtils]: Spent 731.00 ms on a formula simplification that was a NOOP. DAG size: 311 [2021-03-25 04:57:48,595 WARN L205 SmtUtils]: Spent 692.00 ms on a formula simplification that was a NOOP. DAG size: 311 [2021-03-25 04:57:48,601 INFO L154 LiptonReduction]: Checked pairs total: 227 [2021-03-25 04:57:48,601 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 04:57:48,601 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7956 [2021-03-25 04:57:48,601 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 35 transitions, 282 flow [2021-03-25 04:57:48,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 169.83333333333334) internal successors, (1019), 6 states have internal predecessors, (1019), 0 states have call successors, (0), 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-03-25 04:57:48,602 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:57:48,602 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:57:48,602 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 04:57:48,602 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:57:48,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:57:48,603 INFO L82 PathProgramCache]: Analyzing trace with hash 145505793, now seen corresponding path program 1 times [2021-03-25 04:57:48,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:57:48,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213636078] [2021-03-25 04:57:48,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:57:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:57:48,660 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:57:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:57:48,750 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:57:48,797 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:57:48,798 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:57:48,798 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 04:57:48,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:57:48 BasicIcfg [2021-03-25 04:57:48,914 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:57:48,915 INFO L168 Benchmark]: Toolchain (without parser) took 42329.28 ms. Allocated memory was 350.2 MB in the beginning and 826.3 MB in the end (delta: 476.1 MB). Free memory was 313.2 MB in the beginning and 624.4 MB in the end (delta: -311.2 MB). Peak memory consumption was 169.0 MB. Max. memory is 16.0 GB. [2021-03-25 04:57:48,915 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 350.2 MB. Free memory is still 331.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:57:48,915 INFO L168 Benchmark]: CACSL2BoogieTranslator took 522.82 ms. Allocated memory is still 350.2 MB. Free memory was 313.0 MB in the beginning and 305.8 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. [2021-03-25 04:57:48,915 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.91 ms. Allocated memory is still 350.2 MB. Free memory was 305.8 MB in the beginning and 302.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:57:48,918 INFO L168 Benchmark]: Boogie Preprocessor took 61.98 ms. Allocated memory is still 350.2 MB. Free memory was 302.7 MB in the beginning and 300.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:57:48,923 INFO L168 Benchmark]: RCFGBuilder took 2982.95 ms. Allocated memory was 350.2 MB in the beginning and 421.5 MB in the end (delta: 71.3 MB). Free memory was 300.6 MB in the beginning and 239.1 MB in the end (delta: 61.4 MB). Peak memory consumption was 155.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:57:48,925 INFO L168 Benchmark]: TraceAbstraction took 38673.12 ms. Allocated memory was 421.5 MB in the beginning and 826.3 MB in the end (delta: 404.8 MB). Free memory was 239.1 MB in the beginning and 624.4 MB in the end (delta: -385.3 MB). Peak memory consumption was 21.6 MB. Max. memory is 16.0 GB. [2021-03-25 04:57:48,926 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.15 ms. Allocated memory is still 350.2 MB. Free memory is still 331.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 522.82 ms. Allocated memory is still 350.2 MB. Free memory was 313.0 MB in the beginning and 305.8 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 82.91 ms. Allocated memory is still 350.2 MB. Free memory was 305.8 MB in the beginning and 302.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 61.98 ms. Allocated memory is still 350.2 MB. Free memory was 302.7 MB in the beginning and 300.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2982.95 ms. Allocated memory was 350.2 MB in the beginning and 421.5 MB in the end (delta: 71.3 MB). Free memory was 300.6 MB in the beginning and 239.1 MB in the end (delta: 61.4 MB). Peak memory consumption was 155.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 38673.12 ms. Allocated memory was 421.5 MB in the beginning and 826.3 MB in the end (delta: 404.8 MB). Free memory was 239.1 MB in the beginning and 624.4 MB in the end (delta: -385.3 MB). Peak memory consumption was 21.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12642.2ms, 108 PlacesBefore, 47 PlacesAfterwards, 99 TransitionsBefore, 38 TransitionsAfterwards, 1018 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 22 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 63 TotalNumberOfCompositions, 1971 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 840, positive: 762, positive conditional: 0, positive unconditional: 762, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 470, positive: 449, positive conditional: 0, positive unconditional: 449, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 470, positive: 449, positive conditional: 0, positive unconditional: 449, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 840, positive: 313, positive conditional: 0, positive unconditional: 313, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 470, unknown conditional: 0, unknown unconditional: 470] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 45, Positive conditional cache size: 0, Positive unconditional cache size: 45, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4635.5ms, 44 PlacesBefore, 31 PlacesAfterwards, 36 TransitionsBefore, 24 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 4 FixpointIterations, 10 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 965 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 289, positive: 212, positive conditional: 0, positive unconditional: 212, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 23, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 289, positive: 198, positive conditional: 0, positive unconditional: 198, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 23, unknown conditional: 0, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 36, Positive conditional cache size: 0, Positive unconditional cache size: 36, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2888.8ms, 35 PlacesBefore, 30 PlacesAfterwards, 24 TransitionsBefore, 20 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 4 FixpointIterations, 4 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 840 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 257, positive: 185, positive conditional: 0, positive unconditional: 185, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 257, positive: 183, positive conditional: 0, positive unconditional: 183, negative: 71, negative conditional: 0, negative unconditional: 71, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 38, Positive conditional cache size: 0, Positive unconditional cache size: 38, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.9ms, 31 PlacesBefore, 31 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 198 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 68, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 68, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1876.1ms, 34 PlacesBefore, 33 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 312 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 76, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 76, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 21, Positive conditional cache size: 0, Positive unconditional cache size: 21, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8ms, 31 PlacesBefore, 31 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 140 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 43, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 44.7ms, 35 PlacesBefore, 35 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 284 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 72, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 72, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 36.2ms, 41 PlacesBefore, 39 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 126 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 50, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 50, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 19, Positive conditional cache size: 0, Positive unconditional cache size: 19, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.9ms, 39 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 110 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 19, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 44.5ms, 45 PlacesBefore, 45 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 45 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 45, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 45, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.7ms, 49 PlacesBefore, 49 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 45 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 45, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 45, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4869.7ms, 56 PlacesBefore, 56 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 171 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 157, positive: 143, positive conditional: 0, positive unconditional: 143, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 157, positive: 143, positive conditional: 0, positive unconditional: 143, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 19, Positive conditional cache size: 0, Positive unconditional cache size: 19, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7955.5ms, 62 PlacesBefore, 59 PlacesAfterwards, 40 TransitionsBefore, 35 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 227 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 185, positive: 167, positive conditional: 0, positive unconditional: 167, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 185, positive: 164, positive conditional: 0, positive unconditional: 164, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 13, Positive conditional cache size: 0, Positive unconditional cache size: 13, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L852] 0 pthread_t t1789; [L853] FCALL, FORK 0 pthread_create(&t1789, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L766] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L766] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L767] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L767] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L768] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L769] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L770] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L770] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L771] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] EXPR 1 \read(y) [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 [L779] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L854] 0 pthread_t t1790; [L855] FCALL, FORK 0 pthread_create(&t1790, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 2 __unbuffered_p1_EAX = x [L794] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t1791; [L857] FCALL, FORK 0 pthread_create(&t1791, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 y$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(y) [L814] 3 y$mem_tmp = y [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] EXPR 3 \read(y) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L816] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L816] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L817] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L817] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L817] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L817] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L818] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L818] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L818] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L819] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L819] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L820] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L820] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L820] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L821] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L821] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 \read(y) [L822] 3 __unbuffered_p2_EAX = y [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] EXPR 3 \read(y) [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] 3 y = y$flush_delayed ? y$mem_tmp : y [L824] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=0, weak$$choice2=0, x=1, y={8:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=0, weak$$choice2=0, x=1, y={8:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 \read(y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L831] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L832] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L833] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L833] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L834] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 \read(y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L798] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L799] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L800] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L800] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L801] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 \read(y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L864] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L865] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L866] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L867] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 y$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(y) [L873] 0 y$mem_tmp = y [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] EXPR 0 \read(y) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L875] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L876] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L877] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L879] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 \read(y) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=1, weak$$choice2=255, x=1, y={8:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 12.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 38424.1ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1171.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12710.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 34 SDtfs, 25 SDslu, 19 SDs, 0 SdLazy, 273 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 405.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 467.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=11, InterpolantAutomatonStates: 57, 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: 54.3ms SsaConstructionTime, 730.8ms SatisfiabilityAnalysisTime, 990.7ms InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 1305 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...