/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-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-24 10:45:01,334 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-24 10:45:01,336 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-24 10:45:01,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-24 10:45:01,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-24 10:45:01,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-24 10:45:01,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-24 10:45:01,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-24 10:45:01,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-24 10:45:01,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-24 10:45:01,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-24 10:45:01,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-24 10:45:01,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-24 10:45:01,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-24 10:45:01,385 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-24 10:45:01,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-24 10:45:01,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-24 10:45:01,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-24 10:45:01,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-24 10:45:01,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-24 10:45:01,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-24 10:45:01,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-24 10:45:01,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-24 10:45:01,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-24 10:45:01,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-24 10:45:01,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-24 10:45:01,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-24 10:45:01,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-24 10:45:01,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-24 10:45:01,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-24 10:45:01,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-24 10:45:01,414 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-24 10:45:01,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-24 10:45:01,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-24 10:45:01,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-24 10:45:01,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-24 10:45:01,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-24 10:45:01,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-24 10:45:01,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-24 10:45:01,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-24 10:45:01,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-24 10:45:01,425 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-VariableLbe.epf [2021-03-24 10:45:01,463 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-24 10:45:01,463 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-24 10:45:01,466 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-24 10:45:01,466 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-24 10:45:01,467 INFO L138 SettingsManager]: * Use SBE=true [2021-03-24 10:45:01,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-24 10:45:01,467 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-24 10:45:01,467 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-24 10:45:01,467 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-24 10:45:01,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-24 10:45:01,468 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-24 10:45:01,468 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-24 10:45:01,468 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-24 10:45:01,468 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-24 10:45:01,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-24 10:45:01,469 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-24 10:45:01,469 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-24 10:45:01,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-24 10:45:01,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-24 10:45:01,469 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-24 10:45:01,469 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-24 10:45:01,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-24 10:45:01,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-24 10:45:01,470 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-24 10:45:01,470 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-24 10:45:01,470 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-24 10:45:01,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-24 10:45:01,470 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-24 10:45:01,470 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-24 10:45:01,471 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-24 10:45:01,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-24 10:45:01,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-24 10:45:01,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-24 10:45:01,778 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-24 10:45:01,778 INFO L275 PluginConnector]: CDTParser initialized [2021-03-24 10:45:01,779 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_pso.oepc.i [2021-03-24 10:45:01,842 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a5a4996/3df106955e8542839907e30ae3f0698a/FLAG4fa3f3638 [2021-03-24 10:45:02,374 INFO L306 CDTParser]: Found 1 translation units. [2021-03-24 10:45:02,375 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_pso.oepc.i [2021-03-24 10:45:02,393 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a5a4996/3df106955e8542839907e30ae3f0698a/FLAG4fa3f3638 [2021-03-24 10:45:02,672 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a5a4996/3df106955e8542839907e30ae3f0698a [2021-03-24 10:45:02,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-24 10:45:02,676 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-24 10:45:02,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-24 10:45:02,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-24 10:45:02,683 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-24 10:45:02,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 10:45:02" (1/1) ... [2021-03-24 10:45:02,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1908953f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:45:02, skipping insertion in model container [2021-03-24 10:45:02,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 10:45:02" (1/1) ... [2021-03-24 10:45:02,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-24 10:45:02,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-24 10:45:02,876 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/mix023_pso.oepc.i[949,962] [2021-03-24 10:45:03,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 10:45:03,049 INFO L203 MainTranslator]: Completed pre-run [2021-03-24 10:45:03,062 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/mix023_pso.oepc.i[949,962] [2021-03-24 10:45:03,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 10:45:03,197 INFO L208 MainTranslator]: Completed translation [2021-03-24 10:45:03,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:45:03 WrapperNode [2021-03-24 10:45:03,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-24 10:45:03,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-24 10:45:03,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-24 10:45:03,199 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-24 10:45:03,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:45:03" (1/1) ... [2021-03-24 10:45:03,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:45:03" (1/1) ... [2021-03-24 10:45:03,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-24 10:45:03,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-24 10:45:03,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-24 10:45:03,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-24 10:45:03,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:45:03" (1/1) ... [2021-03-24 10:45:03,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:45:03" (1/1) ... [2021-03-24 10:45:03,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:45:03" (1/1) ... [2021-03-24 10:45:03,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:45:03" (1/1) ... [2021-03-24 10:45:03,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:45:03" (1/1) ... [2021-03-24 10:45:03,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:45:03" (1/1) ... [2021-03-24 10:45:03,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:45:03" (1/1) ... [2021-03-24 10:45:03,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-24 10:45:03,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-24 10:45:03,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-24 10:45:03,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-24 10:45:03,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:45:03" (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-24 10:45:03,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-24 10:45:03,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-24 10:45:03,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-24 10:45:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-24 10:45:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-24 10:45:03,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-24 10:45:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-24 10:45:03,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-24 10:45:03,399 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-24 10:45:03,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-24 10:45:03,399 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-24 10:45:03,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-24 10:45:03,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-24 10:45:03,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-24 10:45:03,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-24 10:45:03,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-24 10:45:03,401 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-24 10:45:05,164 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-24 10:45:05,164 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-24 10:45:05,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 10:45:05 BoogieIcfgContainer [2021-03-24 10:45:05,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-24 10:45:05,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-24 10:45:05,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-24 10:45:05,169 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-24 10:45:05,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.03 10:45:02" (1/3) ... [2021-03-24 10:45:05,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71bfe499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 10:45:05, skipping insertion in model container [2021-03-24 10:45:05,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:45:03" (2/3) ... [2021-03-24 10:45:05,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71bfe499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 10:45:05, skipping insertion in model container [2021-03-24 10:45:05,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 10:45:05" (3/3) ... [2021-03-24 10:45:05,172 INFO L111 eAbstractionObserver]: Analyzing ICFG mix023_pso.oepc.i [2021-03-24 10:45:05,177 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-24 10:45:05,181 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-24 10:45:05,181 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-24 10:45:05,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,227 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,227 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,228 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,228 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,228 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,228 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,229 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,229 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,229 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,229 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,232 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,232 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,232 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,232 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,232 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,233 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,233 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,233 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,233 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,234 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,234 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,234 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,234 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,238 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,238 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,239 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,239 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,242 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,243 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,243 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,243 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,243 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,243 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,243 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,243 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,243 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,243 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,244 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,244 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,246 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,247 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,247 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,247 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,252 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,252 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,252 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,252 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,253 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,253 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,253 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,253 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,253 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,253 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,253 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,253 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,253 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,253 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,253 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,253 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,254 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,254 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,254 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,254 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,254 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,254 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,254 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,254 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,254 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,254 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,254 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,255 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,255 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,255 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,257 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,257 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,257 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,257 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,257 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,257 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,258 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,258 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,258 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,258 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,258 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,258 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,258 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,258 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,258 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,258 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,258 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,258 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,258 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,259 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,259 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,259 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,259 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,259 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,259 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,259 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,259 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,259 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,259 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,259 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,259 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,260 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,260 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,260 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,260 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,260 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,260 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,260 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,264 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,264 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,264 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,266 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,267 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,275 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,275 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,282 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,282 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,282 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,284 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,284 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,286 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,286 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:45:05,287 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-24 10:45:05,303 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-24 10:45:05,329 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-24 10:45:05,329 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-24 10:45:05,329 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-24 10:45:05,329 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-24 10:45:05,329 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-24 10:45:05,329 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-24 10:45:05,330 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-24 10:45:05,330 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-24 10:45:05,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 119 transitions, 258 flow [2021-03-24 10:45:05,377 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2021-03-24 10:45:05,377 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:45:05,381 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-24 10:45:05,381 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 119 transitions, 258 flow [2021-03-24 10:45:05,385 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 115 transitions, 242 flow [2021-03-24 10:45:05,386 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-24 10:45:05,393 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 115 transitions, 242 flow [2021-03-24 10:45:05,395 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 115 transitions, 242 flow [2021-03-24 10:45:05,400 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 242 flow [2021-03-24 10:45:05,435 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2021-03-24 10:45:05,435 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:45:05,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 96 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-24 10:45:05,440 INFO L142 LiptonReduction]: Number of co-enabled transitions 2894 [2021-03-24 10:45:06,563 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-24 10:45:06,995 WARN L205 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2021-03-24 10:45:07,155 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-24 10:45:08,085 INFO L154 LiptonReduction]: Checked pairs total: 5866 [2021-03-24 10:45:08,085 INFO L156 LiptonReduction]: Total number of compositions: 74 [2021-03-24 10:45:08,087 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2702 [2021-03-24 10:45:08,098 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-24 10:45:08,098 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:45:08,098 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:45:08,099 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:45:08,099 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:45:08,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:45:08,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1838731669, now seen corresponding path program 1 times [2021-03-24 10:45:08,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:45:08,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124788526] [2021-03-24 10:45:08,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:45:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:45:08,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:08,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:45:08,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:08,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:45:08,295 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-24 10:45:08,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124788526] [2021-03-24 10:45:08,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:45:08,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-24 10:45:08,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932951137] [2021-03-24 10:45:08,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-24 10:45:08,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:45:08,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-24 10:45:08,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-24 10:45:08,317 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 193 [2021-03-24 10:45:08,321 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:45:08,322 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:45:08,322 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 193 [2021-03-24 10:45:08,323 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:45:08,447 INFO L129 PetriNetUnfolder]: 133/299 cut-off events. [2021-03-24 10:45:08,447 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:45:08,449 INFO L84 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 299 events. 133/299 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1420 event pairs, 110 based on Foata normal form. 32/316 useless extension candidates. Maximal degree in co-relation 496. Up to 153 conditions per place. [2021-03-24 10:45:08,452 INFO L132 encePairwiseOnDemand]: 189/193 looper letters, 11 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2021-03-24 10:45:08,452 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 140 flow [2021-03-24 10:45:08,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-24 10:45:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-24 10:45:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2021-03-24 10:45:08,470 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9084628670120898 [2021-03-24 10:45:08,470 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 526 transitions. [2021-03-24 10:45:08,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 526 transitions. [2021-03-24 10:45:08,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:45:08,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 526 transitions. [2021-03-24 10:45:08,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 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-24 10:45:08,487 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-24 10:45:08,488 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-24 10:45:08,489 INFO L185 Difference]: Start difference. First operand has 61 places, 49 transitions, 110 flow. Second operand 3 states and 526 transitions. [2021-03-24 10:45:08,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 140 flow [2021-03-24 10:45:08,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 136 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-24 10:45:08,493 INFO L241 Difference]: Finished difference. Result has 57 places, 46 transitions, 104 flow [2021-03-24 10:45:08,495 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2021-03-24 10:45:08,495 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2021-03-24 10:45:08,496 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 104 flow [2021-03-24 10:45:08,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:45:08,496 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:45:08,496 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] [2021-03-24 10:45:08,496 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-24 10:45:08,497 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:45:08,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:45:08,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1536669456, now seen corresponding path program 1 times [2021-03-24 10:45:08,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:45:08,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067042618] [2021-03-24 10:45:08,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:45:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:45:08,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:08,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:45:08,673 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-24 10:45:08,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-24 10:45:08,688 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:45:08,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:45:08,694 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-24 10:45:08,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067042618] [2021-03-24 10:45:08,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:45:08,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-24 10:45:08,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272372507] [2021-03-24 10:45:08,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 10:45:08,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:45:08,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 10:45:08,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 10:45:08,698 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 193 [2021-03-24 10:45:08,699 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 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-24 10:45:08,699 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:45:08,699 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 193 [2021-03-24 10:45:08,699 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:45:09,076 INFO L129 PetriNetUnfolder]: 1182/2616 cut-off events. [2021-03-24 10:45:09,076 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:45:09,085 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4456 conditions, 2616 events. 1182/2616 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 21594 event pairs, 345 based on Foata normal form. 109/2575 useless extension candidates. Maximal degree in co-relation 4433. Up to 806 conditions per place. [2021-03-24 10:45:09,094 INFO L132 encePairwiseOnDemand]: 179/193 looper letters, 12 selfloop transitions, 11 changer transitions 22/73 dead transitions. [2021-03-24 10:45:09,094 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 242 flow [2021-03-24 10:45:09,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 10:45:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 10:45:09,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 809 transitions. [2021-03-24 10:45:09,097 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8383419689119171 [2021-03-24 10:45:09,098 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 809 transitions. [2021-03-24 10:45:09,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 809 transitions. [2021-03-24 10:45:09,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:45:09,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 809 transitions. [2021-03-24 10:45:09,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 161.8) internal successors, (809), 5 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:45:09,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 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-24 10:45:09,103 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 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-24 10:45:09,103 INFO L185 Difference]: Start difference. First operand has 57 places, 46 transitions, 104 flow. Second operand 5 states and 809 transitions. [2021-03-24 10:45:09,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 242 flow [2021-03-24 10:45:09,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-24 10:45:09,106 INFO L241 Difference]: Finished difference. Result has 63 places, 50 transitions, 190 flow [2021-03-24 10:45:09,106 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=190, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2021-03-24 10:45:09,106 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 2 predicate places. [2021-03-24 10:45:09,106 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 190 flow [2021-03-24 10:45:09,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 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-24 10:45:09,107 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:45:09,107 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-24 10:45:09,107 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-24 10:45:09,107 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:45:09,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:45:09,108 INFO L82 PathProgramCache]: Analyzing trace with hash 392101938, now seen corresponding path program 1 times [2021-03-24 10:45:09,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:45:09,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612894727] [2021-03-24 10:45:09,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:45:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:45:09,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:09,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:45:09,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:09,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:45:09,209 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-24 10:45:09,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-24 10:45:09,226 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:45:09,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:45:09,230 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-24 10:45:09,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612894727] [2021-03-24 10:45:09,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:45:09,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 10:45:09,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781039751] [2021-03-24 10:45:09,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 10:45:09,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:45:09,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 10:45:09,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-24 10:45:09,234 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 193 [2021-03-24 10:45:09,235 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 154.4) internal successors, (772), 5 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-24 10:45:09,235 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:45:09,235 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 193 [2021-03-24 10:45:09,235 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:45:09,511 INFO L129 PetriNetUnfolder]: 637/1461 cut-off events. [2021-03-24 10:45:09,511 INFO L130 PetriNetUnfolder]: For 1006/1668 co-relation queries the response was YES. [2021-03-24 10:45:09,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4464 conditions, 1461 events. 637/1461 cut-off events. For 1006/1668 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 10275 event pairs, 64 based on Foata normal form. 84/1517 useless extension candidates. Maximal degree in co-relation 4433. Up to 607 conditions per place. [2021-03-24 10:45:09,523 INFO L132 encePairwiseOnDemand]: 179/193 looper letters, 18 selfloop transitions, 16 changer transitions 24/86 dead transitions. [2021-03-24 10:45:09,523 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 86 transitions, 520 flow [2021-03-24 10:45:09,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 10:45:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 10:45:09,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1123 transitions. [2021-03-24 10:45:09,526 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8312361213915618 [2021-03-24 10:45:09,526 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1123 transitions. [2021-03-24 10:45:09,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1123 transitions. [2021-03-24 10:45:09,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:45:09,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1123 transitions. [2021-03-24 10:45:09,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 160.42857142857142) internal successors, (1123), 7 states have internal predecessors, (1123), 0 states have call successors, (0), 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-24 10:45:09,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 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-24 10:45:09,532 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 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-24 10:45:09,532 INFO L185 Difference]: Start difference. First operand has 63 places, 50 transitions, 190 flow. Second operand 7 states and 1123 transitions. [2021-03-24 10:45:09,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 86 transitions, 520 flow [2021-03-24 10:45:09,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 86 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-24 10:45:09,542 INFO L241 Difference]: Finished difference. Result has 67 places, 58 transitions, 298 flow [2021-03-24 10:45:09,542 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=298, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2021-03-24 10:45:09,542 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 6 predicate places. [2021-03-24 10:45:09,543 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 298 flow [2021-03-24 10:45:09,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 154.4) internal successors, (772), 5 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-24 10:45:09,543 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:45:09,543 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-24 10:45:09,543 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-24 10:45:09,544 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:45:09,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:45:09,544 INFO L82 PathProgramCache]: Analyzing trace with hash 226846456, now seen corresponding path program 1 times [2021-03-24 10:45:09,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:45:09,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187147186] [2021-03-24 10:45:09,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:45:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:45:09,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:09,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:45:09,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:09,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:45:09,617 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-24 10:45:09,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-24 10:45:09,631 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:45:09,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:45:09,636 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-24 10:45:09,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187147186] [2021-03-24 10:45:09,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:45:09,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 10:45:09,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344554317] [2021-03-24 10:45:09,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 10:45:09,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:45:09,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 10:45:09,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-24 10:45:09,639 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 193 [2021-03-24 10:45:09,640 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 298 flow. Second operand has 5 states, 5 states have (on average 154.4) internal successors, (772), 5 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-24 10:45:09,640 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:45:09,640 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 193 [2021-03-24 10:45:09,640 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:45:09,846 INFO L129 PetriNetUnfolder]: 462/1137 cut-off events. [2021-03-24 10:45:09,846 INFO L130 PetriNetUnfolder]: For 3065/4011 co-relation queries the response was YES. [2021-03-24 10:45:09,851 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4065 conditions, 1137 events. 462/1137 cut-off events. For 3065/4011 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7896 event pairs, 76 based on Foata normal form. 102/1220 useless extension candidates. Maximal degree in co-relation 4024. Up to 468 conditions per place. [2021-03-24 10:45:09,857 INFO L132 encePairwiseOnDemand]: 183/193 looper letters, 32 selfloop transitions, 14 changer transitions 27/101 dead transitions. [2021-03-24 10:45:09,857 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 101 transitions, 782 flow [2021-03-24 10:45:09,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 10:45:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 10:45:09,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1120 transitions. [2021-03-24 10:45:09,860 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8290155440414507 [2021-03-24 10:45:09,860 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1120 transitions. [2021-03-24 10:45:09,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1120 transitions. [2021-03-24 10:45:09,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:45:09,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1120 transitions. [2021-03-24 10:45:09,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 160.0) internal successors, (1120), 7 states have internal predecessors, (1120), 0 states have call successors, (0), 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-24 10:45:09,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 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-24 10:45:09,866 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 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-24 10:45:09,866 INFO L185 Difference]: Start difference. First operand has 67 places, 58 transitions, 298 flow. Second operand 7 states and 1120 transitions. [2021-03-24 10:45:09,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 101 transitions, 782 flow [2021-03-24 10:45:09,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 101 transitions, 772 flow, removed 5 selfloop flow, removed 0 redundant places. [2021-03-24 10:45:09,877 INFO L241 Difference]: Finished difference. Result has 76 places, 66 transitions, 446 flow [2021-03-24 10:45:09,877 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=446, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2021-03-24 10:45:09,877 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 15 predicate places. [2021-03-24 10:45:09,877 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 446 flow [2021-03-24 10:45:09,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 154.4) internal successors, (772), 5 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-24 10:45:09,879 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:45:09,879 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:45:09,879 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-24 10:45:09,879 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:45:09,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:45:09,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1292243506, now seen corresponding path program 1 times [2021-03-24 10:45:09,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:45:09,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570798197] [2021-03-24 10:45:09,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:45:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:45:09,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:09,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:45:09,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:09,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:45:09,946 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-24 10:45:09,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-24 10:45:09,965 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:45:09,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:45:09,971 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-24 10:45:09,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570798197] [2021-03-24 10:45:09,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:45:09,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 10:45:09,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399124564] [2021-03-24 10:45:09,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 10:45:09,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:45:09,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 10:45:09,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-24 10:45:09,974 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 193 [2021-03-24 10:45:09,975 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 446 flow. Second operand has 5 states, 5 states have (on average 154.8) internal successors, (774), 5 states have internal predecessors, (774), 0 states have call successors, (0), 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-24 10:45:09,975 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:45:09,975 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 193 [2021-03-24 10:45:09,975 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:45:10,210 INFO L129 PetriNetUnfolder]: 300/786 cut-off events. [2021-03-24 10:45:10,211 INFO L130 PetriNetUnfolder]: For 3509/4551 co-relation queries the response was YES. [2021-03-24 10:45:10,214 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3315 conditions, 786 events. 300/786 cut-off events. For 3509/4551 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4954 event pairs, 30 based on Foata normal form. 51/824 useless extension candidates. Maximal degree in co-relation 3291. Up to 306 conditions per place. [2021-03-24 10:45:10,220 INFO L132 encePairwiseOnDemand]: 183/193 looper letters, 38 selfloop transitions, 13 changer transitions 19/98 dead transitions. [2021-03-24 10:45:10,221 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 98 transitions, 900 flow [2021-03-24 10:45:10,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 10:45:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 10:45:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1114 transitions. [2021-03-24 10:45:10,224 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8245743893412287 [2021-03-24 10:45:10,224 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1114 transitions. [2021-03-24 10:45:10,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1114 transitions. [2021-03-24 10:45:10,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:45:10,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1114 transitions. [2021-03-24 10:45:10,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 159.14285714285714) internal successors, (1114), 7 states have internal predecessors, (1114), 0 states have call successors, (0), 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-24 10:45:10,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 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-24 10:45:10,230 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 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-24 10:45:10,230 INFO L185 Difference]: Start difference. First operand has 76 places, 66 transitions, 446 flow. Second operand 7 states and 1114 transitions. [2021-03-24 10:45:10,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 98 transitions, 900 flow [2021-03-24 10:45:10,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 98 transitions, 868 flow, removed 13 selfloop flow, removed 4 redundant places. [2021-03-24 10:45:10,244 INFO L241 Difference]: Finished difference. Result has 81 places, 73 transitions, 583 flow [2021-03-24 10:45:10,244 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=583, PETRI_PLACES=81, PETRI_TRANSITIONS=73} [2021-03-24 10:45:10,244 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 20 predicate places. [2021-03-24 10:45:10,244 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 73 transitions, 583 flow [2021-03-24 10:45:10,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 154.8) internal successors, (774), 5 states have internal predecessors, (774), 0 states have call successors, (0), 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-24 10:45:10,245 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:45:10,245 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:45:10,245 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-24 10:45:10,245 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:45:10,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:45:10,246 INFO L82 PathProgramCache]: Analyzing trace with hash -912407241, now seen corresponding path program 1 times [2021-03-24 10:45:10,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:45:10,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475532736] [2021-03-24 10:45:10,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:45:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:45:10,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:10,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:45:10,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:10,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 10:45:10,343 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 10:45:10,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 10:45:10,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:10,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:45:10,354 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-24 10:45:10,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475532736] [2021-03-24 10:45:10,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:45:10,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 10:45:10,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526887190] [2021-03-24 10:45:10,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 10:45:10,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:45:10,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 10:45:10,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 10:45:10,356 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2021-03-24 10:45:10,357 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 73 transitions, 583 flow. Second operand has 5 states, 5 states have (on average 160.8) internal successors, (804), 5 states have internal predecessors, (804), 0 states have call successors, (0), 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-24 10:45:10,357 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:45:10,357 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2021-03-24 10:45:10,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:45:10,846 INFO L129 PetriNetUnfolder]: 1440/2834 cut-off events. [2021-03-24 10:45:10,846 INFO L130 PetriNetUnfolder]: For 3704/3966 co-relation queries the response was YES. [2021-03-24 10:45:10,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7366 conditions, 2834 events. 1440/2834 cut-off events. For 3704/3966 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 23700 event pairs, 539 based on Foata normal form. 169/2787 useless extension candidates. Maximal degree in co-relation 7316. Up to 1463 conditions per place. [2021-03-24 10:45:10,884 INFO L132 encePairwiseOnDemand]: 185/193 looper letters, 15 selfloop transitions, 16 changer transitions 0/96 dead transitions. [2021-03-24 10:45:10,884 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 96 transitions, 691 flow [2021-03-24 10:45:10,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 10:45:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 10:45:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1153 transitions. [2021-03-24 10:45:10,887 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8534418948926721 [2021-03-24 10:45:10,888 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1153 transitions. [2021-03-24 10:45:10,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1153 transitions. [2021-03-24 10:45:10,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:45:10,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1153 transitions. [2021-03-24 10:45:10,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 164.71428571428572) internal successors, (1153), 7 states have internal predecessors, (1153), 0 states have call successors, (0), 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-24 10:45:10,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 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-24 10:45:10,892 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 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-24 10:45:10,892 INFO L185 Difference]: Start difference. First operand has 81 places, 73 transitions, 583 flow. Second operand 7 states and 1153 transitions. [2021-03-24 10:45:10,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 96 transitions, 691 flow [2021-03-24 10:45:10,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 96 transitions, 667 flow, removed 10 selfloop flow, removed 5 redundant places. [2021-03-24 10:45:10,909 INFO L241 Difference]: Finished difference. Result has 83 places, 88 transitions, 675 flow [2021-03-24 10:45:10,909 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=675, PETRI_PLACES=83, PETRI_TRANSITIONS=88} [2021-03-24 10:45:10,909 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 22 predicate places. [2021-03-24 10:45:10,909 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 88 transitions, 675 flow [2021-03-24 10:45:10,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 160.8) internal successors, (804), 5 states have internal predecessors, (804), 0 states have call successors, (0), 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-24 10:45:10,910 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:45:10,910 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:45:10,910 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-24 10:45:10,910 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:45:10,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:45:10,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1852231243, now seen corresponding path program 1 times [2021-03-24 10:45:10,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:45:10,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461178001] [2021-03-24 10:45:10,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:45:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:45:10,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:10,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:45:10,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:10,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:45:10,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:10,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 10:45:10,991 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 10:45:10,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 10:45:11,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:11,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:45:11,001 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-24 10:45:11,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461178001] [2021-03-24 10:45:11,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:45:11,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 10:45:11,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473764238] [2021-03-24 10:45:11,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-24 10:45:11,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:45:11,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-24 10:45:11,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-24 10:45:11,003 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2021-03-24 10:45:11,004 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 88 transitions, 675 flow. Second operand has 6 states, 6 states have (on average 160.83333333333334) internal successors, (965), 6 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-24 10:45:11,004 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:45:11,004 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2021-03-24 10:45:11,004 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:45:11,511 INFO L129 PetriNetUnfolder]: 1248/2637 cut-off events. [2021-03-24 10:45:11,512 INFO L130 PetriNetUnfolder]: For 7206/10580 co-relation queries the response was YES. [2021-03-24 10:45:11,533 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11361 conditions, 2637 events. 1248/2637 cut-off events. For 7206/10580 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 22153 event pairs, 156 based on Foata normal form. 1060/3534 useless extension candidates. Maximal degree in co-relation 11310. Up to 1511 conditions per place. [2021-03-24 10:45:11,553 INFO L132 encePairwiseOnDemand]: 185/193 looper letters, 15 selfloop transitions, 32 changer transitions 0/112 dead transitions. [2021-03-24 10:45:11,553 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 112 transitions, 946 flow [2021-03-24 10:45:11,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-24 10:45:11,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-24 10:45:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1647 transitions. [2021-03-24 10:45:11,557 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8533678756476684 [2021-03-24 10:45:11,557 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1647 transitions. [2021-03-24 10:45:11,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1647 transitions. [2021-03-24 10:45:11,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:45:11,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1647 transitions. [2021-03-24 10:45:11,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 164.7) internal successors, (1647), 10 states have internal predecessors, (1647), 0 states have call successors, (0), 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-24 10:45:11,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 193.0) internal successors, (2123), 11 states have internal predecessors, (2123), 0 states have call successors, (0), 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-24 10:45:11,565 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 193.0) internal successors, (2123), 11 states have internal predecessors, (2123), 0 states have call successors, (0), 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-24 10:45:11,565 INFO L185 Difference]: Start difference. First operand has 83 places, 88 transitions, 675 flow. Second operand 10 states and 1647 transitions. [2021-03-24 10:45:11,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 112 transitions, 946 flow [2021-03-24 10:45:11,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 112 transitions, 940 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-24 10:45:11,596 INFO L241 Difference]: Finished difference. Result has 94 places, 104 transitions, 914 flow [2021-03-24 10:45:11,597 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=914, PETRI_PLACES=94, PETRI_TRANSITIONS=104} [2021-03-24 10:45:11,597 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 33 predicate places. [2021-03-24 10:45:11,597 INFO L480 AbstractCegarLoop]: Abstraction has has 94 places, 104 transitions, 914 flow [2021-03-24 10:45:11,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 160.83333333333334) internal successors, (965), 6 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-24 10:45:11,597 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:45:11,598 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:45:11,598 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-24 10:45:11,598 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:45:11,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:45:11,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1539451247, now seen corresponding path program 1 times [2021-03-24 10:45:11,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:45:11,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667876515] [2021-03-24 10:45:11,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:45:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:45:11,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:11,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:45:11,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:11,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:45:11,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:11,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:45:11,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:11,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 10:45:11,729 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 10:45:11,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 10:45:11,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:11,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:45:11,737 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-24 10:45:11,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667876515] [2021-03-24 10:45:11,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:45:11,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-24 10:45:11,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042643412] [2021-03-24 10:45:11,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-24 10:45:11,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:45:11,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-24 10:45:11,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-24 10:45:11,740 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2021-03-24 10:45:11,741 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 104 transitions, 914 flow. Second operand has 7 states, 7 states have (on average 160.85714285714286) internal successors, (1126), 7 states have internal predecessors, (1126), 0 states have call successors, (0), 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-24 10:45:11,741 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:45:11,742 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2021-03-24 10:45:11,742 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:45:12,258 INFO L129 PetriNetUnfolder]: 1130/2422 cut-off events. [2021-03-24 10:45:12,258 INFO L130 PetriNetUnfolder]: For 17064/24179 co-relation queries the response was YES. [2021-03-24 10:45:12,282 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14420 conditions, 2422 events. 1130/2422 cut-off events. For 17064/24179 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 20550 event pairs, 44 based on Foata normal form. 1526/3800 useless extension candidates. Maximal degree in co-relation 14365. Up to 1441 conditions per place. [2021-03-24 10:45:12,303 INFO L132 encePairwiseOnDemand]: 185/193 looper letters, 7 selfloop transitions, 49 changer transitions 8/129 dead transitions. [2021-03-24 10:45:12,303 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 129 transitions, 1355 flow [2021-03-24 10:45:12,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-24 10:45:12,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-24 10:45:12,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2141 transitions. [2021-03-24 10:45:12,308 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.853328019131128 [2021-03-24 10:45:12,308 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2141 transitions. [2021-03-24 10:45:12,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2141 transitions. [2021-03-24 10:45:12,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:45:12,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2141 transitions. [2021-03-24 10:45:12,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 164.69230769230768) internal successors, (2141), 13 states have internal predecessors, (2141), 0 states have call successors, (0), 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-24 10:45:12,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 193.0) internal successors, (2702), 14 states have internal predecessors, (2702), 0 states have call successors, (0), 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-24 10:45:12,319 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 193.0) internal successors, (2702), 14 states have internal predecessors, (2702), 0 states have call successors, (0), 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-24 10:45:12,319 INFO L185 Difference]: Start difference. First operand has 94 places, 104 transitions, 914 flow. Second operand 13 states and 2141 transitions. [2021-03-24 10:45:12,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 129 transitions, 1355 flow [2021-03-24 10:45:12,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 129 transitions, 1256 flow, removed 41 selfloop flow, removed 3 redundant places. [2021-03-24 10:45:12,500 INFO L241 Difference]: Finished difference. Result has 106 places, 121 transitions, 1157 flow [2021-03-24 10:45:12,501 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1157, PETRI_PLACES=106, PETRI_TRANSITIONS=121} [2021-03-24 10:45:12,501 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 45 predicate places. [2021-03-24 10:45:12,501 INFO L480 AbstractCegarLoop]: Abstraction has has 106 places, 121 transitions, 1157 flow [2021-03-24 10:45:12,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 160.85714285714286) internal successors, (1126), 7 states have internal predecessors, (1126), 0 states have call successors, (0), 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-24 10:45:12,501 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:45:12,501 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:45:12,501 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-24 10:45:12,502 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:45:12,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:45:12,502 INFO L82 PathProgramCache]: Analyzing trace with hash 597926247, now seen corresponding path program 1 times [2021-03-24 10:45:12,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:45:12,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478554138] [2021-03-24 10:45:12,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:45:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:45:12,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:12,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:45:12,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:12,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:45:12,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:12,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 10:45:12,645 INFO L142 QuantifierPusher]: treesize reduction 4, result has 88.9 percent of original size [2021-03-24 10:45:12,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-24 10:45:12,669 INFO L142 QuantifierPusher]: treesize reduction 17, result has 74.2 percent of original size [2021-03-24 10:45:12,671 INFO L147 QuantifierPusher]: treesize reduction 9, result has 81.6 percent of original size 40 [2021-03-24 10:45:12,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:12,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 10:45:12,711 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-24 10:45:12,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-24 10:45:12,730 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:45:12,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:45:12,739 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-24 10:45:12,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478554138] [2021-03-24 10:45:12,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:45:12,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-24 10:45:12,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449869719] [2021-03-24 10:45:12,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-24 10:45:12,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:45:12,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-24 10:45:12,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-03-24 10:45:12,741 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 193 [2021-03-24 10:45:12,742 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 121 transitions, 1157 flow. Second operand has 9 states, 9 states have (on average 128.55555555555554) internal successors, (1157), 9 states have internal predecessors, (1157), 0 states have call successors, (0), 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-24 10:45:12,742 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:45:12,742 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 193 [2021-03-24 10:45:12,742 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:45:14,342 INFO L129 PetriNetUnfolder]: 4544/9156 cut-off events. [2021-03-24 10:45:14,342 INFO L130 PetriNetUnfolder]: For 62549/72175 co-relation queries the response was YES. [2021-03-24 10:45:14,518 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46205 conditions, 9156 events. 4544/9156 cut-off events. For 62549/72175 co-relation queries the response was YES. Maximal size of possible extension queue 1249. Compared 90053 event pairs, 108 based on Foata normal form. 733/9235 useless extension candidates. Maximal degree in co-relation 46138. Up to 3024 conditions per place. [2021-03-24 10:45:14,580 INFO L132 encePairwiseOnDemand]: 174/193 looper letters, 60 selfloop transitions, 97 changer transitions 10/232 dead transitions. [2021-03-24 10:45:14,580 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 232 transitions, 2498 flow [2021-03-24 10:45:14,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-24 10:45:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-24 10:45:14,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1613 transitions. [2021-03-24 10:45:14,584 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6964594127806563 [2021-03-24 10:45:14,584 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1613 transitions. [2021-03-24 10:45:14,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1613 transitions. [2021-03-24 10:45:14,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:45:14,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1613 transitions. [2021-03-24 10:45:14,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 134.41666666666666) internal successors, (1613), 12 states have internal predecessors, (1613), 0 states have call successors, (0), 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-24 10:45:14,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 193.0) internal successors, (2509), 13 states have internal predecessors, (2509), 0 states have call successors, (0), 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-24 10:45:14,593 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 193.0) internal successors, (2509), 13 states have internal predecessors, (2509), 0 states have call successors, (0), 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-24 10:45:14,593 INFO L185 Difference]: Start difference. First operand has 106 places, 121 transitions, 1157 flow. Second operand 12 states and 1613 transitions. [2021-03-24 10:45:14,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 232 transitions, 2498 flow [2021-03-24 10:45:17,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 232 transitions, 2252 flow, removed 91 selfloop flow, removed 9 redundant places. [2021-03-24 10:45:17,647 INFO L241 Difference]: Finished difference. Result has 115 places, 189 transitions, 2055 flow [2021-03-24 10:45:17,648 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2055, PETRI_PLACES=115, PETRI_TRANSITIONS=189} [2021-03-24 10:45:17,648 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 54 predicate places. [2021-03-24 10:45:17,648 INFO L480 AbstractCegarLoop]: Abstraction has has 115 places, 189 transitions, 2055 flow [2021-03-24 10:45:17,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 128.55555555555554) internal successors, (1157), 9 states have internal predecessors, (1157), 0 states have call successors, (0), 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-24 10:45:17,649 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:45:17,649 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:45:17,649 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-24 10:45:17,649 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:45:17,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:45:17,649 INFO L82 PathProgramCache]: Analyzing trace with hash 755007103, now seen corresponding path program 2 times [2021-03-24 10:45:17,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:45:17,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508622542] [2021-03-24 10:45:17,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:45:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:45:17,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:17,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:45:17,713 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-24 10:45:17,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-24 10:45:17,727 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-03-24 10:45:17,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-24 10:45:17,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:17,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:45:17,748 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:45:17,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:45:17,755 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-24 10:45:17,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508622542] [2021-03-24 10:45:17,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:45:17,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 10:45:17,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689013696] [2021-03-24 10:45:17,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-24 10:45:17,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:45:17,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-24 10:45:17,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-24 10:45:17,757 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 193 [2021-03-24 10:45:17,758 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 189 transitions, 2055 flow. Second operand has 6 states, 6 states have (on average 156.83333333333334) internal successors, (941), 6 states have internal predecessors, (941), 0 states have call successors, (0), 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-24 10:45:17,758 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:45:17,758 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 193 [2021-03-24 10:45:17,758 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:45:19,331 INFO L129 PetriNetUnfolder]: 6374/13058 cut-off events. [2021-03-24 10:45:19,332 INFO L130 PetriNetUnfolder]: For 47709/50285 co-relation queries the response was YES. [2021-03-24 10:45:19,490 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48877 conditions, 13058 events. 6374/13058 cut-off events. For 47709/50285 co-relation queries the response was YES. Maximal size of possible extension queue 1839. Compared 137223 event pairs, 199 based on Foata normal form. 687/12786 useless extension candidates. Maximal degree in co-relation 48807. Up to 2583 conditions per place. [2021-03-24 10:45:19,551 INFO L132 encePairwiseOnDemand]: 184/193 looper letters, 38 selfloop transitions, 25 changer transitions 8/229 dead transitions. [2021-03-24 10:45:19,551 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 229 transitions, 2522 flow [2021-03-24 10:45:19,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 10:45:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 10:45:19,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1124 transitions. [2021-03-24 10:45:19,554 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8319763138415989 [2021-03-24 10:45:19,554 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1124 transitions. [2021-03-24 10:45:19,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1124 transitions. [2021-03-24 10:45:19,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:45:19,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1124 transitions. [2021-03-24 10:45:19,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 160.57142857142858) internal successors, (1124), 7 states have internal predecessors, (1124), 0 states have call successors, (0), 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-24 10:45:19,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 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-24 10:45:19,559 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 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-24 10:45:19,559 INFO L185 Difference]: Start difference. First operand has 115 places, 189 transitions, 2055 flow. Second operand 7 states and 1124 transitions. [2021-03-24 10:45:19,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 229 transitions, 2522 flow [2021-03-24 10:45:23,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 229 transitions, 2501 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-03-24 10:45:23,074 INFO L241 Difference]: Finished difference. Result has 119 places, 212 transitions, 2339 flow [2021-03-24 10:45:23,074 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=2042, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2339, PETRI_PLACES=119, PETRI_TRANSITIONS=212} [2021-03-24 10:45:23,075 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 58 predicate places. [2021-03-24 10:45:23,075 INFO L480 AbstractCegarLoop]: Abstraction has has 119 places, 212 transitions, 2339 flow [2021-03-24 10:45:23,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 156.83333333333334) internal successors, (941), 6 states have internal predecessors, (941), 0 states have call successors, (0), 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-24 10:45:23,075 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:45:23,075 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:45:23,076 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-24 10:45:23,076 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:45:23,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:45:23,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1147752071, now seen corresponding path program 3 times [2021-03-24 10:45:23,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:45:23,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719697149] [2021-03-24 10:45:23,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:45:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:45:23,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:23,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:45:23,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:23,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:45:23,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:23,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:45:23,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:23,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:45:23,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:23,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 10:45:23,165 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 10:45:23,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 10:45:23,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:23,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:45:23,174 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-24 10:45:23,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719697149] [2021-03-24 10:45:23,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:45:23,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-24 10:45:23,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511273295] [2021-03-24 10:45:23,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-24 10:45:23,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:45:23,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-24 10:45:23,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-03-24 10:45:23,176 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2021-03-24 10:45:23,177 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 212 transitions, 2339 flow. Second operand has 8 states, 8 states have (on average 160.875) internal successors, (1287), 8 states have internal predecessors, (1287), 0 states have call successors, (0), 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-24 10:45:23,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:45:23,178 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2021-03-24 10:45:23,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:45:25,016 INFO L129 PetriNetUnfolder]: 6447/12809 cut-off events. [2021-03-24 10:45:25,016 INFO L130 PetriNetUnfolder]: For 52160/82840 co-relation queries the response was YES. [2021-03-24 10:45:25,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58004 conditions, 12809 events. 6447/12809 cut-off events. For 52160/82840 co-relation queries the response was YES. Maximal size of possible extension queue 1852. Compared 131973 event pairs, 105 based on Foata normal form. 10254/22088 useless extension candidates. Maximal degree in co-relation 57965. Up to 2646 conditions per place. [2021-03-24 10:45:25,163 INFO L132 encePairwiseOnDemand]: 185/193 looper letters, 4 selfloop transitions, 55 changer transitions 12/220 dead transitions. [2021-03-24 10:45:25,163 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 220 transitions, 2534 flow [2021-03-24 10:45:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-24 10:45:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-03-24 10:45:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2623 transitions. [2021-03-24 10:45:25,170 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8494170984455959 [2021-03-24 10:45:25,170 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2623 transitions. [2021-03-24 10:45:25,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2623 transitions. [2021-03-24 10:45:25,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:45:25,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2623 transitions. [2021-03-24 10:45:25,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 163.9375) internal successors, (2623), 16 states have internal predecessors, (2623), 0 states have call successors, (0), 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-24 10:45:25,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 193.0) internal successors, (3281), 17 states have internal predecessors, (3281), 0 states have call successors, (0), 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-24 10:45:25,194 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 193.0) internal successors, (3281), 17 states have internal predecessors, (3281), 0 states have call successors, (0), 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-24 10:45:25,194 INFO L185 Difference]: Start difference. First operand has 119 places, 212 transitions, 2339 flow. Second operand 16 states and 2623 transitions. [2021-03-24 10:45:25,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 220 transitions, 2534 flow [2021-03-24 10:45:28,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 220 transitions, 2490 flow, removed 12 selfloop flow, removed 3 redundant places. [2021-03-24 10:45:28,358 INFO L241 Difference]: Finished difference. Result has 135 places, 208 transitions, 2339 flow [2021-03-24 10:45:28,358 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=2236, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2339, PETRI_PLACES=135, PETRI_TRANSITIONS=208} [2021-03-24 10:45:28,358 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 74 predicate places. [2021-03-24 10:45:28,358 INFO L480 AbstractCegarLoop]: Abstraction has has 135 places, 208 transitions, 2339 flow [2021-03-24 10:45:28,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 160.875) internal successors, (1287), 8 states have internal predecessors, (1287), 0 states have call successors, (0), 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-24 10:45:28,359 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:45:28,359 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:45:28,359 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-24 10:45:28,359 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:45:28,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:45:28,359 INFO L82 PathProgramCache]: Analyzing trace with hash -251302324, now seen corresponding path program 1 times [2021-03-24 10:45:28,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:45:28,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505113673] [2021-03-24 10:45:28,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:45:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:45:28,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:28,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:45:28,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:28,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:45:28,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:28,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:45:28,444 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-24 10:45:28,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-24 10:45:28,458 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:45:28,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:45:28,463 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-24 10:45:28,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505113673] [2021-03-24 10:45:28,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:45:28,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 10:45:28,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139763138] [2021-03-24 10:45:28,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-24 10:45:28,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:45:28,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-24 10:45:28,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-24 10:45:28,467 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 193 [2021-03-24 10:45:28,467 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 208 transitions, 2339 flow. Second operand has 6 states, 6 states have (on average 152.5) internal successors, (915), 6 states have internal predecessors, (915), 0 states have call successors, (0), 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-24 10:45:28,467 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:45:28,467 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 193 [2021-03-24 10:45:28,467 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:45:30,667 INFO L129 PetriNetUnfolder]: 10701/21037 cut-off events. [2021-03-24 10:45:30,667 INFO L130 PetriNetUnfolder]: For 78377/83585 co-relation queries the response was YES. [2021-03-24 10:45:30,924 INFO L84 FinitePrefix]: Finished finitePrefix Result has 95796 conditions, 21037 events. 10701/21037 cut-off events. For 78377/83585 co-relation queries the response was YES. Maximal size of possible extension queue 3009. Compared 229724 event pairs, 67 based on Foata normal form. 220/19688 useless extension candidates. Maximal degree in co-relation 95721. Up to 4403 conditions per place. [2021-03-24 10:45:30,977 INFO L132 encePairwiseOnDemand]: 179/193 looper letters, 68 selfloop transitions, 126 changer transitions 6/301 dead transitions. [2021-03-24 10:45:30,977 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 301 transitions, 4116 flow [2021-03-24 10:45:30,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 10:45:30,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 10:45:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1095 transitions. [2021-03-24 10:45:30,980 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8105107327905255 [2021-03-24 10:45:30,981 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1095 transitions. [2021-03-24 10:45:30,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1095 transitions. [2021-03-24 10:45:30,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:45:30,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1095 transitions. [2021-03-24 10:45:30,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 156.42857142857142) internal successors, (1095), 7 states have internal predecessors, (1095), 0 states have call successors, (0), 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-24 10:45:30,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 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-24 10:45:30,985 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 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-24 10:45:30,985 INFO L185 Difference]: Start difference. First operand has 135 places, 208 transitions, 2339 flow. Second operand 7 states and 1095 transitions. [2021-03-24 10:45:30,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 301 transitions, 4116 flow [2021-03-24 10:45:41,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 301 transitions, 3909 flow, removed 58 selfloop flow, removed 14 redundant places. [2021-03-24 10:45:41,034 INFO L241 Difference]: Finished difference. Result has 129 places, 274 transitions, 3770 flow [2021-03-24 10:45:41,034 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=2168, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3770, PETRI_PLACES=129, PETRI_TRANSITIONS=274} [2021-03-24 10:45:41,034 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 68 predicate places. [2021-03-24 10:45:41,034 INFO L480 AbstractCegarLoop]: Abstraction has has 129 places, 274 transitions, 3770 flow [2021-03-24 10:45:41,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 152.5) internal successors, (915), 6 states have internal predecessors, (915), 0 states have call successors, (0), 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-24 10:45:41,035 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:45:41,035 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:45:41,035 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-24 10:45:41,035 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:45:41,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:45:41,036 INFO L82 PathProgramCache]: Analyzing trace with hash -2056782856, now seen corresponding path program 2 times [2021-03-24 10:45:41,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:45:41,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177063816] [2021-03-24 10:45:41,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:45:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:45:41,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:41,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:45:41,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:45:41,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:45:41,097 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-24 10:45:41,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-24 10:45:41,110 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:45:41,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:45:41,115 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-24 10:45:41,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177063816] [2021-03-24 10:45:41,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:45:41,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 10:45:41,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927881906] [2021-03-24 10:45:41,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 10:45:41,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:45:41,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 10:45:41,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-24 10:45:41,117 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 193 [2021-03-24 10:45:41,118 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 274 transitions, 3770 flow. Second operand has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 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-24 10:45:41,118 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:45:41,118 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 193 [2021-03-24 10:45:41,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:45:44,958 INFO L129 PetriNetUnfolder]: 17338/33895 cut-off events. [2021-03-24 10:45:44,959 INFO L130 PetriNetUnfolder]: For 105163/108618 co-relation queries the response was YES. [2021-03-24 10:45:45,288 INFO L84 FinitePrefix]: Finished finitePrefix Result has 132361 conditions, 33895 events. 17338/33895 cut-off events. For 105163/108618 co-relation queries the response was YES. Maximal size of possible extension queue 5072. Compared 393967 event pairs, 153 based on Foata normal form. 317/31618 useless extension candidates. Maximal degree in co-relation 132319. Up to 7188 conditions per place. [2021-03-24 10:45:45,381 INFO L132 encePairwiseOnDemand]: 180/193 looper letters, 82 selfloop transitions, 149 changer transitions 5/339 dead transitions. [2021-03-24 10:45:45,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 339 transitions, 5476 flow [2021-03-24 10:45:45,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 10:45:45,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 10:45:45,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 796 transitions. [2021-03-24 10:45:45,383 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8248704663212435 [2021-03-24 10:45:45,383 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 796 transitions. [2021-03-24 10:45:45,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 796 transitions. [2021-03-24 10:45:45,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:45:45,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 796 transitions. [2021-03-24 10:45:45,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 159.2) internal successors, (796), 5 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:45:45,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 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-24 10:45:45,387 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 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-24 10:45:45,387 INFO L185 Difference]: Start difference. First operand has 129 places, 274 transitions, 3770 flow. Second operand 5 states and 796 transitions. [2021-03-24 10:45:45,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 339 transitions, 5476 flow [2021-03-24 10:46:12,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 339 transitions, 5474 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-24 10:46:12,484 INFO L241 Difference]: Finished difference. Result has 135 places, 322 transitions, 5513 flow [2021-03-24 10:46:12,484 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=3768, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5513, PETRI_PLACES=135, PETRI_TRANSITIONS=322} [2021-03-24 10:46:12,484 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 74 predicate places. [2021-03-24 10:46:12,484 INFO L480 AbstractCegarLoop]: Abstraction has has 135 places, 322 transitions, 5513 flow [2021-03-24 10:46:12,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 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-24 10:46:12,485 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:46:12,485 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:46:12,485 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-24 10:46:12,485 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:46:12,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:46:12,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1952851696, now seen corresponding path program 3 times [2021-03-24 10:46:12,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:46:12,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71751230] [2021-03-24 10:46:12,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:46:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:46:12,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:46:12,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:46:12,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:46:12,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 10:46:12,574 INFO L142 QuantifierPusher]: treesize reduction 4, result has 89.7 percent of original size [2021-03-24 10:46:12,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-24 10:46:12,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:46:12,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-24 10:46:12,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:46:12,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 10:46:12,616 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-24 10:46:12,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-24 10:46:12,630 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:46:12,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:46:12,636 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-24 10:46:12,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71751230] [2021-03-24 10:46:12,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:46:12,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-24 10:46:12,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339624108] [2021-03-24 10:46:12,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-24 10:46:12,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:46:12,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-24 10:46:12,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-24 10:46:12,641 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 193 [2021-03-24 10:46:12,642 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 322 transitions, 5513 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-24 10:46:12,642 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:46:12,642 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 193 [2021-03-24 10:46:12,642 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:46:18,342 INFO L129 PetriNetUnfolder]: 23584/46482 cut-off events. [2021-03-24 10:46:18,342 INFO L130 PetriNetUnfolder]: For 177695/184221 co-relation queries the response was YES. [2021-03-24 10:46:18,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 187010 conditions, 46482 events. 23584/46482 cut-off events. For 177695/184221 co-relation queries the response was YES. Maximal size of possible extension queue 7869. Compared 566821 event pairs, 252 based on Foata normal form. 782/43249 useless extension candidates. Maximal degree in co-relation 186965. Up to 9520 conditions per place. [2021-03-24 10:46:18,792 INFO L132 encePairwiseOnDemand]: 175/193 looper letters, 96 selfloop transitions, 284 changer transitions 28/476 dead transitions. [2021-03-24 10:46:18,792 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 476 transitions, 9031 flow [2021-03-24 10:46:18,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-24 10:46:18,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-24 10:46:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1347 transitions. [2021-03-24 10:46:18,800 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6979274611398963 [2021-03-24 10:46:18,800 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1347 transitions. [2021-03-24 10:46:18,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1347 transitions. [2021-03-24 10:46:18,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:46:18,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1347 transitions. [2021-03-24 10:46:18,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 134.7) internal successors, (1347), 10 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:46:18,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 193.0) internal successors, (2123), 11 states have internal predecessors, (2123), 0 states have call successors, (0), 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-24 10:46:18,806 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 193.0) internal successors, (2123), 11 states have internal predecessors, (2123), 0 states have call successors, (0), 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-24 10:46:18,806 INFO L185 Difference]: Start difference. First operand has 135 places, 322 transitions, 5513 flow. Second operand 10 states and 1347 transitions. [2021-03-24 10:46:18,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 476 transitions, 9031 flow [2021-03-24 10:47:15,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 476 transitions, 9023 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-24 10:47:15,199 INFO L241 Difference]: Finished difference. Result has 149 places, 409 transitions, 8468 flow [2021-03-24 10:47:15,199 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=5509, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=194, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8468, PETRI_PLACES=149, PETRI_TRANSITIONS=409} [2021-03-24 10:47:15,200 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 88 predicate places. [2021-03-24 10:47:15,200 INFO L480 AbstractCegarLoop]: Abstraction has has 149 places, 409 transitions, 8468 flow [2021-03-24 10:47:15,200 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-24 10:47:15,200 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:47:15,200 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:47:15,201 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-24 10:47:15,201 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:47:15,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:47:15,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1548007276, now seen corresponding path program 4 times [2021-03-24 10:47:15,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:47:15,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440257314] [2021-03-24 10:47:15,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:47:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:47:15,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:47:15,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:47:15,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:47:15,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:47:15,254 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:47:15,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:47:15,257 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-24 10:47:15,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440257314] [2021-03-24 10:47:15,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:47:15,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-24 10:47:15,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234212559] [2021-03-24 10:47:15,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 10:47:15,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:47:15,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 10:47:15,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 10:47:15,259 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 193 [2021-03-24 10:47:15,260 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 409 transitions, 8468 flow. Second operand has 4 states, 4 states have (on average 171.5) internal successors, (686), 4 states have internal predecessors, (686), 0 states have call successors, (0), 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-24 10:47:15,260 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:47:15,260 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 193 [2021-03-24 10:47:15,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:47:16,859 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1078] L789-->L796: Formula: (let ((.cse5 (= (mod v_~a$w_buff0_used~0_467 256) 0)) (.cse12 (= (mod v_~a$w_buff1_used~0_346 256) 0)) (.cse7 (= (mod v_~a$r_buff1_thd2~0_48 256) 0)) (.cse14 (= 0 (mod v_~a$w_buff0_used~0_468 256))) (.cse13 (= 0 (mod v_~a$r_buff0_thd2~0_66 256)))) (let ((.cse0 (or .cse14 .cse13)) (.cse1 (not .cse14)) (.cse9 (not .cse7)) (.cse11 (not .cse12)) (.cse2 (not .cse13)) (.cse4 (not .cse5)) (.cse3 (or .cse5 .cse13)) (.cse10 (or .cse7 .cse12))) (and (or (and .cse0 (= v_~a$w_buff0_used~0_468 v_~a$w_buff0_used~0_467)) (and .cse1 (= v_~a$w_buff0_used~0_467 0) .cse2)) (or (and .cse3 (= v_~a$r_buff0_thd2~0_66 v_~a$r_buff0_thd2~0_65)) (and (= v_~a$r_buff0_thd2~0_65 0) .cse2 .cse4)) (let ((.cse8 (= 0 (mod v_~a$w_buff1_used~0_345 256))) (.cse6 (= (mod v_~a$r_buff0_thd2~0_65 256) 0))) (or (and (or .cse5 .cse6) (= v_~a$r_buff1_thd2~0_48 v_~a$r_buff1_thd2~0_47) (or .cse7 .cse8)) (and (= v_~a$r_buff1_thd2~0_47 0) (or (and .cse9 (not .cse8)) (and .cse4 (not .cse6)))))) (or (and .cse0 (= v_~a~0_172 |v_P1_#t~ite11_47|) (or (and .cse10 (= v_~a~0_173 |v_P1_#t~ite11_47|)) (and .cse9 .cse11 (= |v_P1_#t~ite11_47| v_~a$w_buff1~0_120)))) (and (= v_~a~0_172 v_~a$w_buff0~0_105) .cse1 (= |v_P1_#t~ite11_47| |v_P1Thread1of1ForFork2_#t~ite11_1|) .cse2)) (or (and (or (and .cse9 .cse11) (and .cse2 .cse4)) (= v_~a$w_buff1_used~0_345 0)) (and .cse3 .cse10 (= v_~a$w_buff1_used~0_346 v_~a$w_buff1_used~0_345)))))) InVars {~a~0=v_~a~0_173, ~a$w_buff1~0=v_~a$w_buff1~0_120, ~a$w_buff0~0=v_~a$w_buff0~0_105, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_48, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_468, P1Thread1of1ForFork2_#t~ite11=|v_P1Thread1of1ForFork2_#t~ite11_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_346} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_47, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_467, P1Thread1of1ForFork2_#t~ite12=|v_P1Thread1of1ForFork2_#t~ite12_1|, P1Thread1of1ForFork2_#t~ite11=|v_P1Thread1of1ForFork2_#t~ite11_2|, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_1|, P1Thread1of1ForFork2_#t~ite13=|v_P1Thread1of1ForFork2_#t~ite13_1|, P1Thread1of1ForFork2_#t~ite16=|v_P1Thread1of1ForFork2_#t~ite16_1|, P1Thread1of1ForFork2_#t~ite15=|v_P1Thread1of1ForFork2_#t~ite15_1|, ~a~0=v_~a~0_172, ~a$w_buff1~0=v_~a$w_buff1~0_120, ~a$w_buff0~0=v_~a$w_buff0~0_105, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_345} AuxVars[|v_P1_#t~ite11_47|] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11, ~a$w_buff1_used~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite13, P1Thread1of1ForFork2_#t~ite16, P1Thread1of1ForFork2_#t~ite15][274], [Black: 252#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 370#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), P3Thread1of1ForFork0InUse, Black: 238#(<= ~__unbuffered_cnt~0 2), Black: 371#(and (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 376#(and (= ~a$r_buff0_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff0_thd3~0 0)), P0Thread1of1ForFork1InUse, Black: 378#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), P2Thread1of1ForFork3InUse, Black: 380#(and (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 382#(and (= ~a$r_buff0_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= ~a$r_buff0_thd3~0 0)), 393#(= ~x~0 1), Black: 140#(or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))), 149#true, 277#(and (= ~a$r_buff1_thd2~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 273#(and (= ~a$r_buff1_thd2~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 275#(and (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 269#(and (= ~a$r_buff0_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff0_thd2~0 0)), Black: 151#(= ~z~0 0), Black: 271#(and (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 152#(or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))), 290#true, 165#true, Black: 292#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 293#(and (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1)), Black: 294#(= ~__unbuffered_p3_EBX~0 1), Black: 297#(and (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1)), Black: 168#(or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))), 52#L876-1true, 181#true, 57#L809true, Black: 184#(or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))), 65#L796true, Black: 311#(<= ~__unbuffered_cnt~0 3), Black: 327#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), Black: 329#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), Black: 205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), 83#L773true, Black: 207#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 347#(and (= ~y~0 1) (= ~__unbuffered_p1_EBX~0 1)), Black: 340#(= ~y~0 1), Black: 345#(and (= ~y~0 1) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0)))), 357#(= ~z~0 1), 101#L852true, Black: 226#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 228#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 216#(<= ~__unbuffered_cnt~0 1), Black: 355#true, 236#(= ~__unbuffered_cnt~0 0), Black: 358#(or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))), 369#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd3~0 0)), P1Thread1of1ForFork2InUse]) [2021-03-24 10:47:16,859 INFO L384 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2021-03-24 10:47:16,859 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-24 10:47:16,859 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-24 10:47:16,859 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-24 10:47:17,566 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1078] L789-->L796: Formula: (let ((.cse5 (= (mod v_~a$w_buff0_used~0_467 256) 0)) (.cse12 (= (mod v_~a$w_buff1_used~0_346 256) 0)) (.cse7 (= (mod v_~a$r_buff1_thd2~0_48 256) 0)) (.cse14 (= 0 (mod v_~a$w_buff0_used~0_468 256))) (.cse13 (= 0 (mod v_~a$r_buff0_thd2~0_66 256)))) (let ((.cse0 (or .cse14 .cse13)) (.cse1 (not .cse14)) (.cse9 (not .cse7)) (.cse11 (not .cse12)) (.cse2 (not .cse13)) (.cse4 (not .cse5)) (.cse3 (or .cse5 .cse13)) (.cse10 (or .cse7 .cse12))) (and (or (and .cse0 (= v_~a$w_buff0_used~0_468 v_~a$w_buff0_used~0_467)) (and .cse1 (= v_~a$w_buff0_used~0_467 0) .cse2)) (or (and .cse3 (= v_~a$r_buff0_thd2~0_66 v_~a$r_buff0_thd2~0_65)) (and (= v_~a$r_buff0_thd2~0_65 0) .cse2 .cse4)) (let ((.cse8 (= 0 (mod v_~a$w_buff1_used~0_345 256))) (.cse6 (= (mod v_~a$r_buff0_thd2~0_65 256) 0))) (or (and (or .cse5 .cse6) (= v_~a$r_buff1_thd2~0_48 v_~a$r_buff1_thd2~0_47) (or .cse7 .cse8)) (and (= v_~a$r_buff1_thd2~0_47 0) (or (and .cse9 (not .cse8)) (and .cse4 (not .cse6)))))) (or (and .cse0 (= v_~a~0_172 |v_P1_#t~ite11_47|) (or (and .cse10 (= v_~a~0_173 |v_P1_#t~ite11_47|)) (and .cse9 .cse11 (= |v_P1_#t~ite11_47| v_~a$w_buff1~0_120)))) (and (= v_~a~0_172 v_~a$w_buff0~0_105) .cse1 (= |v_P1_#t~ite11_47| |v_P1Thread1of1ForFork2_#t~ite11_1|) .cse2)) (or (and (or (and .cse9 .cse11) (and .cse2 .cse4)) (= v_~a$w_buff1_used~0_345 0)) (and .cse3 .cse10 (= v_~a$w_buff1_used~0_346 v_~a$w_buff1_used~0_345)))))) InVars {~a~0=v_~a~0_173, ~a$w_buff1~0=v_~a$w_buff1~0_120, ~a$w_buff0~0=v_~a$w_buff0~0_105, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_48, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_468, P1Thread1of1ForFork2_#t~ite11=|v_P1Thread1of1ForFork2_#t~ite11_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_346} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_47, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_467, P1Thread1of1ForFork2_#t~ite12=|v_P1Thread1of1ForFork2_#t~ite12_1|, P1Thread1of1ForFork2_#t~ite11=|v_P1Thread1of1ForFork2_#t~ite11_2|, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_1|, P1Thread1of1ForFork2_#t~ite13=|v_P1Thread1of1ForFork2_#t~ite13_1|, P1Thread1of1ForFork2_#t~ite16=|v_P1Thread1of1ForFork2_#t~ite16_1|, P1Thread1of1ForFork2_#t~ite15=|v_P1Thread1of1ForFork2_#t~ite15_1|, ~a~0=v_~a~0_172, ~a$w_buff1~0=v_~a$w_buff1~0_120, ~a$w_buff0~0=v_~a$w_buff0~0_105, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_345} AuxVars[|v_P1_#t~ite11_47|] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11, ~a$w_buff1_used~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite13, P1Thread1of1ForFork2_#t~ite16, P1Thread1of1ForFork2_#t~ite15][274], [Black: 252#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 370#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), P3Thread1of1ForFork0InUse, Black: 238#(<= ~__unbuffered_cnt~0 2), Black: 371#(and (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 376#(and (= ~a$r_buff0_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff0_thd3~0 0)), P0Thread1of1ForFork1InUse, Black: 378#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), P2Thread1of1ForFork3InUse, Black: 380#(and (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 382#(and (= ~a$r_buff0_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= ~a$r_buff0_thd3~0 0)), 393#(= ~x~0 1), Black: 140#(or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))), 277#(and (= ~a$r_buff1_thd2~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (= ~a$r_buff0_thd2~0 0)), 149#true, Black: 273#(and (= ~a$r_buff1_thd2~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 275#(and (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 151#(= ~z~0 0), Black: 269#(and (= ~a$r_buff0_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff0_thd2~0 0)), Black: 271#(and (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 152#(or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))), 290#true, 165#true, Black: 292#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 293#(and (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1)), Black: 294#(= ~__unbuffered_p3_EBX~0 1), Black: 297#(and (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1)), Black: 168#(or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))), 52#L876-1true, 181#true, Black: 184#(or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))), 65#L796true, Black: 311#(<= ~__unbuffered_cnt~0 3), Black: 327#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), Black: 329#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 83#L773true, Black: 205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 207#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 347#(and (= ~y~0 1) (= ~__unbuffered_p1_EBX~0 1)), Black: 340#(= ~y~0 1), Black: 345#(and (= ~y~0 1) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0)))), 99#L816true, 357#(= ~z~0 1), 101#L852true, Black: 226#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 228#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 216#(<= ~__unbuffered_cnt~0 1), Black: 355#true, 236#(= ~__unbuffered_cnt~0 0), Black: 358#(or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))), 369#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd3~0 0)), P1Thread1of1ForFork2InUse]) [2021-03-24 10:47:17,567 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-24 10:47:17,567 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-24 10:47:17,567 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-24 10:47:17,567 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-24 10:47:17,671 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1078] L789-->L796: Formula: (let ((.cse5 (= (mod v_~a$w_buff0_used~0_467 256) 0)) (.cse12 (= (mod v_~a$w_buff1_used~0_346 256) 0)) (.cse7 (= (mod v_~a$r_buff1_thd2~0_48 256) 0)) (.cse14 (= 0 (mod v_~a$w_buff0_used~0_468 256))) (.cse13 (= 0 (mod v_~a$r_buff0_thd2~0_66 256)))) (let ((.cse0 (or .cse14 .cse13)) (.cse1 (not .cse14)) (.cse9 (not .cse7)) (.cse11 (not .cse12)) (.cse2 (not .cse13)) (.cse4 (not .cse5)) (.cse3 (or .cse5 .cse13)) (.cse10 (or .cse7 .cse12))) (and (or (and .cse0 (= v_~a$w_buff0_used~0_468 v_~a$w_buff0_used~0_467)) (and .cse1 (= v_~a$w_buff0_used~0_467 0) .cse2)) (or (and .cse3 (= v_~a$r_buff0_thd2~0_66 v_~a$r_buff0_thd2~0_65)) (and (= v_~a$r_buff0_thd2~0_65 0) .cse2 .cse4)) (let ((.cse8 (= 0 (mod v_~a$w_buff1_used~0_345 256))) (.cse6 (= (mod v_~a$r_buff0_thd2~0_65 256) 0))) (or (and (or .cse5 .cse6) (= v_~a$r_buff1_thd2~0_48 v_~a$r_buff1_thd2~0_47) (or .cse7 .cse8)) (and (= v_~a$r_buff1_thd2~0_47 0) (or (and .cse9 (not .cse8)) (and .cse4 (not .cse6)))))) (or (and .cse0 (= v_~a~0_172 |v_P1_#t~ite11_47|) (or (and .cse10 (= v_~a~0_173 |v_P1_#t~ite11_47|)) (and .cse9 .cse11 (= |v_P1_#t~ite11_47| v_~a$w_buff1~0_120)))) (and (= v_~a~0_172 v_~a$w_buff0~0_105) .cse1 (= |v_P1_#t~ite11_47| |v_P1Thread1of1ForFork2_#t~ite11_1|) .cse2)) (or (and (or (and .cse9 .cse11) (and .cse2 .cse4)) (= v_~a$w_buff1_used~0_345 0)) (and .cse3 .cse10 (= v_~a$w_buff1_used~0_346 v_~a$w_buff1_used~0_345)))))) InVars {~a~0=v_~a~0_173, ~a$w_buff1~0=v_~a$w_buff1~0_120, ~a$w_buff0~0=v_~a$w_buff0~0_105, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_48, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_468, P1Thread1of1ForFork2_#t~ite11=|v_P1Thread1of1ForFork2_#t~ite11_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_346} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_47, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_467, P1Thread1of1ForFork2_#t~ite12=|v_P1Thread1of1ForFork2_#t~ite12_1|, P1Thread1of1ForFork2_#t~ite11=|v_P1Thread1of1ForFork2_#t~ite11_2|, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_1|, P1Thread1of1ForFork2_#t~ite13=|v_P1Thread1of1ForFork2_#t~ite13_1|, P1Thread1of1ForFork2_#t~ite16=|v_P1Thread1of1ForFork2_#t~ite16_1|, P1Thread1of1ForFork2_#t~ite15=|v_P1Thread1of1ForFork2_#t~ite15_1|, ~a~0=v_~a~0_172, ~a$w_buff1~0=v_~a$w_buff1~0_120, ~a$w_buff0~0=v_~a$w_buff0~0_105, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_345} AuxVars[|v_P1_#t~ite11_47|] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11, ~a$w_buff1_used~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite13, P1Thread1of1ForFork2_#t~ite16, P1Thread1of1ForFork2_#t~ite15][274], [Black: 252#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 370#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), P3Thread1of1ForFork0InUse, Black: 371#(and (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 238#(<= ~__unbuffered_cnt~0 2), Black: 376#(and (= ~a$r_buff0_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff0_thd3~0 0)), P0Thread1of1ForFork1InUse, Black: 378#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 380#(and (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0)), P2Thread1of1ForFork3InUse, Black: 382#(and (= ~a$r_buff0_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= ~a$r_buff0_thd3~0 0)), 391#true, Black: 140#(or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))), 149#true, 277#(and (= ~a$r_buff1_thd2~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 273#(and (= ~a$r_buff1_thd2~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 275#(and (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 269#(and (= ~a$r_buff0_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff0_thd2~0 0)), Black: 151#(= ~z~0 0), Black: 271#(and (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 152#(or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))), 290#true, 165#true, Black: 292#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 293#(and (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1)), Black: 294#(= ~__unbuffered_p3_EBX~0 1), Black: 297#(and (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1)), Black: 168#(or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))), 52#L876-1true, 181#true, 57#L809true, 65#L796true, Black: 184#(or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))), Black: 311#(<= ~__unbuffered_cnt~0 3), Black: 327#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), Black: 329#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 83#L773true, Black: 205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 207#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 347#(and (= ~y~0 1) (= ~__unbuffered_p1_EBX~0 1)), Black: 340#(= ~y~0 1), Black: 345#(and (= ~y~0 1) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0)))), 357#(= ~z~0 1), 101#L852true, Black: 226#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 228#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 216#(<= ~__unbuffered_cnt~0 1), Black: 355#true, 236#(= ~__unbuffered_cnt~0 0), Black: 358#(or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))), 369#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd3~0 0)), P1Thread1of1ForFork2InUse]) [2021-03-24 10:47:17,671 INFO L384 tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event [2021-03-24 10:47:17,671 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-03-24 10:47:17,671 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-03-24 10:47:17,671 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-03-24 10:47:17,964 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1078] L789-->L796: Formula: (let ((.cse5 (= (mod v_~a$w_buff0_used~0_467 256) 0)) (.cse12 (= (mod v_~a$w_buff1_used~0_346 256) 0)) (.cse7 (= (mod v_~a$r_buff1_thd2~0_48 256) 0)) (.cse14 (= 0 (mod v_~a$w_buff0_used~0_468 256))) (.cse13 (= 0 (mod v_~a$r_buff0_thd2~0_66 256)))) (let ((.cse0 (or .cse14 .cse13)) (.cse1 (not .cse14)) (.cse9 (not .cse7)) (.cse11 (not .cse12)) (.cse2 (not .cse13)) (.cse4 (not .cse5)) (.cse3 (or .cse5 .cse13)) (.cse10 (or .cse7 .cse12))) (and (or (and .cse0 (= v_~a$w_buff0_used~0_468 v_~a$w_buff0_used~0_467)) (and .cse1 (= v_~a$w_buff0_used~0_467 0) .cse2)) (or (and .cse3 (= v_~a$r_buff0_thd2~0_66 v_~a$r_buff0_thd2~0_65)) (and (= v_~a$r_buff0_thd2~0_65 0) .cse2 .cse4)) (let ((.cse8 (= 0 (mod v_~a$w_buff1_used~0_345 256))) (.cse6 (= (mod v_~a$r_buff0_thd2~0_65 256) 0))) (or (and (or .cse5 .cse6) (= v_~a$r_buff1_thd2~0_48 v_~a$r_buff1_thd2~0_47) (or .cse7 .cse8)) (and (= v_~a$r_buff1_thd2~0_47 0) (or (and .cse9 (not .cse8)) (and .cse4 (not .cse6)))))) (or (and .cse0 (= v_~a~0_172 |v_P1_#t~ite11_47|) (or (and .cse10 (= v_~a~0_173 |v_P1_#t~ite11_47|)) (and .cse9 .cse11 (= |v_P1_#t~ite11_47| v_~a$w_buff1~0_120)))) (and (= v_~a~0_172 v_~a$w_buff0~0_105) .cse1 (= |v_P1_#t~ite11_47| |v_P1Thread1of1ForFork2_#t~ite11_1|) .cse2)) (or (and (or (and .cse9 .cse11) (and .cse2 .cse4)) (= v_~a$w_buff1_used~0_345 0)) (and .cse3 .cse10 (= v_~a$w_buff1_used~0_346 v_~a$w_buff1_used~0_345)))))) InVars {~a~0=v_~a~0_173, ~a$w_buff1~0=v_~a$w_buff1~0_120, ~a$w_buff0~0=v_~a$w_buff0~0_105, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_48, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_468, P1Thread1of1ForFork2_#t~ite11=|v_P1Thread1of1ForFork2_#t~ite11_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_346} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_47, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_467, P1Thread1of1ForFork2_#t~ite12=|v_P1Thread1of1ForFork2_#t~ite12_1|, P1Thread1of1ForFork2_#t~ite11=|v_P1Thread1of1ForFork2_#t~ite11_2|, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_1|, P1Thread1of1ForFork2_#t~ite13=|v_P1Thread1of1ForFork2_#t~ite13_1|, P1Thread1of1ForFork2_#t~ite16=|v_P1Thread1of1ForFork2_#t~ite16_1|, P1Thread1of1ForFork2_#t~ite15=|v_P1Thread1of1ForFork2_#t~ite15_1|, ~a~0=v_~a~0_172, ~a$w_buff1~0=v_~a$w_buff1~0_120, ~a$w_buff0~0=v_~a$w_buff0~0_105, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_345} AuxVars[|v_P1_#t~ite11_47|] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11, ~a$w_buff1_used~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite13, P1Thread1of1ForFork2_#t~ite16, P1Thread1of1ForFork2_#t~ite15][274], [Black: 252#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 370#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), P3Thread1of1ForFork0InUse, Black: 371#(and (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 238#(<= ~__unbuffered_cnt~0 2), Black: 376#(and (= ~a$r_buff0_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff0_thd3~0 0)), P0Thread1of1ForFork1InUse, Black: 378#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), P2Thread1of1ForFork3InUse, Black: 380#(and (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 382#(and (= ~a$r_buff0_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= ~a$r_buff0_thd3~0 0)), 262#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd2~0 0)), 391#true, Black: 140#(or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))), 149#true, Black: 273#(and (= ~a$r_buff1_thd2~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 275#(and (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 277#(and (= ~a$r_buff1_thd2~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 151#(= ~z~0 0), Black: 269#(and (= ~a$r_buff0_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff0_thd2~0 0)), Black: 271#(and (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 152#(or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))), 290#true, 165#true, Black: 292#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 293#(and (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1)), Black: 294#(= ~__unbuffered_p3_EBX~0 1), Black: 297#(and (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1)), Black: 168#(or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))), 52#L876-1true, 181#true, 65#L796true, Black: 184#(or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))), Black: 311#(<= ~__unbuffered_cnt~0 3), Black: 327#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), Black: 329#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 83#L773true, Black: 205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 207#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 347#(and (= ~y~0 1) (= ~__unbuffered_p1_EBX~0 1)), Black: 340#(= ~y~0 1), Black: 345#(and (= ~y~0 1) (or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0)))), 99#L816true, 357#(= ~z~0 1), 101#L852true, Black: 226#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 228#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 216#(<= ~__unbuffered_cnt~0 1), Black: 355#true, 236#(= ~__unbuffered_cnt~0 0), Black: 358#(or (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~z~0))), 369#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd3~0 0)), P1Thread1of1ForFork2InUse]) [2021-03-24 10:47:17,964 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-24 10:47:17,964 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-24 10:47:17,964 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-24 10:47:17,964 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-24 10:47:21,552 INFO L129 PetriNetUnfolder]: 32035/61700 cut-off events. [2021-03-24 10:47:21,553 INFO L130 PetriNetUnfolder]: For 229285/234248 co-relation queries the response was YES. [2021-03-24 10:47:22,378 INFO L84 FinitePrefix]: Finished finitePrefix Result has 244323 conditions, 61700 events. 32035/61700 cut-off events. For 229285/234248 co-relation queries the response was YES. Maximal size of possible extension queue 10367. Compared 757698 event pairs, 148 based on Foata normal form. 634/57209 useless extension candidates. Maximal degree in co-relation 244271. Up to 12901 conditions per place. [2021-03-24 10:47:22,523 INFO L132 encePairwiseOnDemand]: 189/193 looper letters, 45 selfloop transitions, 63 changer transitions 23/426 dead transitions. [2021-03-24 10:47:22,523 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 426 transitions, 9075 flow [2021-03-24 10:47:22,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-24 10:47:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-24 10:47:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 690 transitions. [2021-03-24 10:47:22,525 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8937823834196891 [2021-03-24 10:47:22,525 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 690 transitions. [2021-03-24 10:47:22,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 690 transitions. [2021-03-24 10:47:22,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:47:22,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 690 transitions. [2021-03-24 10:47:22,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 172.5) internal successors, (690), 4 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:47:22,527 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-24 10:47:22,527 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-24 10:47:22,527 INFO L185 Difference]: Start difference. First operand has 149 places, 409 transitions, 8468 flow. Second operand 4 states and 690 transitions. [2021-03-24 10:47:22,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 426 transitions, 9075 flow [2021-03-24 10:49:50,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 426 transitions, 9062 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-24 10:49:50,692 INFO L241 Difference]: Finished difference. Result has 150 places, 395 transitions, 8237 flow [2021-03-24 10:49:50,692 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=8455, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=8237, PETRI_PLACES=150, PETRI_TRANSITIONS=395} [2021-03-24 10:49:50,692 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 89 predicate places. [2021-03-24 10:49:50,692 INFO L480 AbstractCegarLoop]: Abstraction has has 150 places, 395 transitions, 8237 flow [2021-03-24 10:49:50,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.5) internal successors, (686), 4 states have internal predecessors, (686), 0 states have call successors, (0), 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-24 10:49:50,693 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:49:50,693 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:49:50,693 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-24 10:49:50,693 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:49:50,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:49:50,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2081772370, now seen corresponding path program 5 times [2021-03-24 10:49:50,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:49:50,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023945591] [2021-03-24 10:49:50,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:49:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:49:50,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:50,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:49:50,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:50,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:49:50,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:50,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 10:49:50,791 INFO L142 QuantifierPusher]: treesize reduction 4, result has 88.9 percent of original size [2021-03-24 10:49:50,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-24 10:49:50,820 INFO L142 QuantifierPusher]: treesize reduction 29, result has 59.7 percent of original size [2021-03-24 10:49:50,820 INFO L147 QuantifierPusher]: treesize reduction 8, result has 81.4 percent of original size 35 [2021-03-24 10:49:50,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:50,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-24 10:49:50,859 INFO L142 QuantifierPusher]: treesize reduction 17, result has 70.2 percent of original size [2021-03-24 10:49:50,861 INFO L147 QuantifierPusher]: treesize reduction 9, result has 77.5 percent of original size 31 [2021-03-24 10:49:50,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:50,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:49:50,890 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:49:50,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:49:50,897 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-24 10:49:50,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023945591] [2021-03-24 10:49:50,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:49:50,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-24 10:49:50,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83629947] [2021-03-24 10:49:50,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-24 10:49:50,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:49:50,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-24 10:49:50,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-03-24 10:49:50,902 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 193 [2021-03-24 10:49:50,903 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 395 transitions, 8237 flow. Second operand has 10 states, 10 states have (on average 149.4) internal successors, (1494), 10 states have internal predecessors, (1494), 0 states have call successors, (0), 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-24 10:49:50,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:49:50,903 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 193 [2021-03-24 10:49:50,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:50:00,809 INFO L129 PetriNetUnfolder]: 37528/74618 cut-off events. [2021-03-24 10:50:00,809 INFO L130 PetriNetUnfolder]: For 270200/275803 co-relation queries the response was YES. [2021-03-24 10:50:01,523 INFO L84 FinitePrefix]: Finished finitePrefix Result has 295938 conditions, 74618 events. 37528/74618 cut-off events. For 270200/275803 co-relation queries the response was YES. Maximal size of possible extension queue 13284. Compared 975887 event pairs, 311 based on Foata normal form. 683/68703 useless extension candidates. Maximal degree in co-relation 295885. Up to 15722 conditions per place. [2021-03-24 10:50:01,677 INFO L132 encePairwiseOnDemand]: 184/193 looper letters, 23 selfloop transitions, 10 changer transitions 312/428 dead transitions. [2021-03-24 10:50:01,678 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 428 transitions, 8855 flow [2021-03-24 10:50:01,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-24 10:50:01,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-24 10:50:01,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1364 transitions. [2021-03-24 10:50:01,680 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7852619458837076 [2021-03-24 10:50:01,680 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1364 transitions. [2021-03-24 10:50:01,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1364 transitions. [2021-03-24 10:50:01,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:50:01,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1364 transitions. [2021-03-24 10:50:01,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 151.55555555555554) internal successors, (1364), 9 states have internal predecessors, (1364), 0 states have call successors, (0), 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-24 10:50:01,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 0 states have call successors, (0), 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-24 10:50:01,684 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 0 states have call successors, (0), 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-24 10:50:01,684 INFO L185 Difference]: Start difference. First operand has 150 places, 395 transitions, 8237 flow. Second operand 9 states and 1364 transitions. [2021-03-24 10:50:01,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 428 transitions, 8855 flow [2021-03-24 10:54:35,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 428 transitions, 8790 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-24 10:54:35,498 INFO L241 Difference]: Finished difference. Result has 160 places, 114 transitions, 1014 flow [2021-03-24 10:54:35,498 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=8172, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1014, PETRI_PLACES=160, PETRI_TRANSITIONS=114} [2021-03-24 10:54:35,498 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 99 predicate places. [2021-03-24 10:54:35,499 INFO L480 AbstractCegarLoop]: Abstraction has has 160 places, 114 transitions, 1014 flow [2021-03-24 10:54:35,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 149.4) internal successors, (1494), 10 states have internal predecessors, (1494), 0 states have call successors, (0), 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-24 10:54:35,499 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:54:35,499 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:54:35,499 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-24 10:54:35,499 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:54:35,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:54:35,500 INFO L82 PathProgramCache]: Analyzing trace with hash -537264994, now seen corresponding path program 6 times [2021-03-24 10:54:35,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:54:35,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231518898] [2021-03-24 10:54:35,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:54:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 10:54:35,533 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 10:54:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 10:54:35,571 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 10:54:35,615 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-24 10:54:35,615 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-24 10:54:35,616 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-24 10:54:35,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.03 10:54:35 BasicIcfg [2021-03-24 10:54:35,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-24 10:54:35,750 INFO L168 Benchmark]: Toolchain (without parser) took 573073.94 ms. Allocated memory was 346.0 MB in the beginning and 6.7 GB in the end (delta: 6.4 GB). Free memory was 309.2 MB in the beginning and 2.5 GB in the end (delta: -2.2 GB). Peak memory consumption was 4.2 GB. Max. memory is 16.0 GB. [2021-03-24 10:54:35,750 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 346.0 MB. Free memory was 327.5 MB in the beginning and 327.5 MB in the end (delta: 76.8 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-24 10:54:35,750 INFO L168 Benchmark]: CACSL2BoogieTranslator took 518.61 ms. Allocated memory is still 346.0 MB. Free memory was 309.1 MB in the beginning and 303.7 MB in the end (delta: 5.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.0 GB. [2021-03-24 10:54:35,750 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.63 ms. Allocated memory is still 346.0 MB. Free memory was 303.7 MB in the beginning and 299.6 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-24 10:54:35,750 INFO L168 Benchmark]: Boogie Preprocessor took 61.99 ms. Allocated memory is still 346.0 MB. Free memory was 299.6 MB in the beginning and 297.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-24 10:54:35,751 INFO L168 Benchmark]: RCFGBuilder took 1840.23 ms. Allocated memory is still 346.0 MB. Free memory was 297.5 MB in the beginning and 207.1 MB in the end (delta: 90.4 MB). Peak memory consumption was 137.6 MB. Max. memory is 16.0 GB. [2021-03-24 10:54:35,751 INFO L168 Benchmark]: TraceAbstraction took 570581.85 ms. Allocated memory was 346.0 MB in the beginning and 6.7 GB in the end (delta: 6.4 GB). Free memory was 207.1 MB in the beginning and 2.5 GB in the end (delta: -2.3 GB). Peak memory consumption was 4.1 GB. Max. memory is 16.0 GB. [2021-03-24 10:54:35,752 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.12 ms. Allocated memory is still 346.0 MB. Free memory was 327.5 MB in the beginning and 327.5 MB in the end (delta: 76.8 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 518.61 ms. Allocated memory is still 346.0 MB. Free memory was 309.1 MB in the beginning and 303.7 MB in the end (delta: 5.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 63.63 ms. Allocated memory is still 346.0 MB. Free memory was 303.7 MB in the beginning and 299.6 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 61.99 ms. Allocated memory is still 346.0 MB. Free memory was 299.6 MB in the beginning and 297.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1840.23 ms. Allocated memory is still 346.0 MB. Free memory was 297.5 MB in the beginning and 207.1 MB in the end (delta: 90.4 MB). Peak memory consumption was 137.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 570581.85 ms. Allocated memory was 346.0 MB in the beginning and 6.7 GB in the end (delta: 6.4 GB). Free memory was 207.1 MB in the beginning and 2.5 GB in the end (delta: -2.3 GB). Peak memory consumption was 4.1 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2690.0ms, 126 PlacesBefore, 61 PlacesAfterwards, 115 TransitionsBefore, 49 TransitionsAfterwards, 2894 CoEnabledTransitionPairs, 5 FixpointIterations, 30 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 74 TotalNumberOfCompositions, 5866 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2623, positive: 2495, positive conditional: 0, positive unconditional: 2495, negative: 128, negative conditional: 0, negative unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1411, positive: 1374, positive conditional: 0, positive unconditional: 1374, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1411, positive: 1374, positive conditional: 0, positive unconditional: 1374, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2623, positive: 1121, positive conditional: 0, positive unconditional: 1121, negative: 91, negative conditional: 0, negative unconditional: 91, unknown: 1411, unknown conditional: 0, unknown unconditional: 1411] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 170, Positive conditional cache size: 0, Positive unconditional cache size: 170, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0] [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0] [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0] [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L869] 0 pthread_t t609; [L870] FCALL, FORK 0 pthread_create(&t609, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t610; [L872] FCALL, FORK 0 pthread_create(&t610, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L873] 0 pthread_t t611; [L874] FCALL, FORK 0 pthread_create(&t611, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L805] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L875] 0 pthread_t t612; [L876] FCALL, FORK 0 pthread_create(&t612, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L811] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L836] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L836] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L837] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L837] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L838] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L838] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L839] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L840] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L840] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L841] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L847] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L847] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L847] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L882] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L882] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L882] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 570291.4ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 565267.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2762.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 276 SDtfs, 309 SDslu, 522 SDs, 0 SdLazy, 1050 SolverSat, 234 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1063.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1034.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=8468occurred in iteration=14, InterpolantAutomatonStates: 129, 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: 61.4ms SsaConstructionTime, 486.0ms SatisfiabilityAnalysisTime, 1381.0ms InterpolantComputationTime, 574 NumberOfCodeBlocks, 574 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 516 ConstructedInterpolants, 0 QuantifiedInterpolants, 3644 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...