/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix008_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:30:16,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:30:16,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:30:16,636 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:30:16,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:30:16,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:30:16,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:30:16,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:30:16,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:30:16,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:30:16,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:30:16,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:30:16,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:30:16,661 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:30:16,662 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:30:16,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:30:16,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:30:16,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:30:16,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:30:16,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:30:16,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:30:16,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:30:16,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:30:16,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:30:16,687 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:30:16,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:30:16,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:30:16,689 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:30:16,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:30:16,690 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:30:16,690 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:30:16,691 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:30:16,692 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:30:16,693 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:30:16,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:30:16,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:30:16,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:30:16,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:30:16,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:30:16,695 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:30:16,696 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:30:16,700 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf [2021-03-25 04:30:16,735 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:30:16,735 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:30:16,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:30:16,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:30:16,738 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:30:16,739 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:30:16,739 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:30:16,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:30:16,739 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:30:16,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:30:16,740 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:30:16,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:30:16,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:30:16,740 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:30:16,741 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:30:16,741 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:30:16,741 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:30:16,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:30:16,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:30:16,741 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:30:16,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:30:16,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:30:16,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:30:16,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:30:16,742 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:30:16,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:30:16,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:30:16,743 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:30:16,743 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:30:16,743 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:30:16,743 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 04:30:17,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:30:17,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:30:17,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:30:17,082 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:30:17,083 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:30:17,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_power.opt.i [2021-03-25 04:30:17,151 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a8b5117/93a396404c6a4bc1ada263615a53947f/FLAG496109155 [2021-03-25 04:30:17,609 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:30:17,610 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_power.opt.i [2021-03-25 04:30:17,622 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a8b5117/93a396404c6a4bc1ada263615a53947f/FLAG496109155 [2021-03-25 04:30:17,632 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a8b5117/93a396404c6a4bc1ada263615a53947f [2021-03-25 04:30:17,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:30:17,635 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:30:17,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:30:17,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:30:17,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:30:17,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:30:17" (1/1) ... [2021-03-25 04:30:17,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68139177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:17, skipping insertion in model container [2021-03-25 04:30:17,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:30:17" (1/1) ... [2021-03-25 04:30:17,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:30:17,680 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:30:17,791 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_power.opt.i[950,963] [2021-03-25 04:30:18,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:30:18,035 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:30:18,047 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/mix008_power.opt.i[950,963] [2021-03-25 04:30:18,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:30:18,159 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:30:18,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:18 WrapperNode [2021-03-25 04:30:18,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:30:18,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:30:18,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:30:18,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:30:18,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:18" (1/1) ... [2021-03-25 04:30:18,180 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:18" (1/1) ... [2021-03-25 04:30:18,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:30:18,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:30:18,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:30:18,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:30:18,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:18" (1/1) ... [2021-03-25 04:30:18,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:18" (1/1) ... [2021-03-25 04:30:18,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:18" (1/1) ... [2021-03-25 04:30:18,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:18" (1/1) ... [2021-03-25 04:30:18,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:18" (1/1) ... [2021-03-25 04:30:18,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:18" (1/1) ... [2021-03-25 04:30:18,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:18" (1/1) ... [2021-03-25 04:30:18,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:30:18,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:30:18,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:30:18,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:30:18,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:30:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:30:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:30:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:30:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:30:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:30:18,309 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:30:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:30:18,310 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:30:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:30:18,310 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:30:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 04:30:18,310 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 04:30:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:30:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:30:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:30:18,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:30:18,312 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 04:30:20,393 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:30:20,394 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:30:20,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:30:20 BoogieIcfgContainer [2021-03-25 04:30:20,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:30:20,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:30:20,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:30:20,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:30:20,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:30:17" (1/3) ... [2021-03-25 04:30:20,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6800ac73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:30:20, skipping insertion in model container [2021-03-25 04:30:20,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:18" (2/3) ... [2021-03-25 04:30:20,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6800ac73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:30:20, skipping insertion in model container [2021-03-25 04:30:20,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:30:20" (3/3) ... [2021-03-25 04:30:20,401 INFO L111 eAbstractionObserver]: Analyzing ICFG mix008_power.opt.i [2021-03-25 04:30:20,406 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:30:20,410 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:30:20,411 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:30:20,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,447 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,447 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,448 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,448 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,449 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,449 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,449 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,449 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,450 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,450 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,451 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,451 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,460 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,460 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,460 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,460 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,463 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,463 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,463 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,463 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,463 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,463 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,463 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,463 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,463 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,464 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,464 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,466 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,466 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,466 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,499 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,499 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,500 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,500 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,500 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,500 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,500 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,500 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,500 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,500 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,500 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,501 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,501 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,501 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,501 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,501 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,501 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,501 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,501 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,501 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,501 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,502 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,502 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,502 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,502 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,502 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,502 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,502 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,502 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,503 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,503 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,503 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,503 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,503 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,503 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,503 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,503 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,503 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,505 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,505 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,505 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,505 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,506 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,506 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,506 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,506 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,506 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,506 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,506 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,509 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,509 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,513 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,514 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,518 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,518 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,520 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,521 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,521 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,521 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,521 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,521 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,521 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,521 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,523 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,523 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:20,524 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:30:20,540 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 04:30:20,556 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:30:20,556 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:30:20,556 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:30:20,556 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:30:20,557 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:30:20,557 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:30:20,557 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:30:20,557 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:30:20,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 252 flow [2021-03-25 04:30:20,606 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-03-25 04:30:20,606 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:30:20,609 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-03-25 04:30:20,610 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 116 transitions, 252 flow [2021-03-25 04:30:20,614 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 112 transitions, 236 flow [2021-03-25 04:30:20,615 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:20,623 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 236 flow [2021-03-25 04:30:20,625 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 236 flow [2021-03-25 04:30:20,627 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 236 flow [2021-03-25 04:30:20,646 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-03-25 04:30:20,646 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:30:20,647 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-03-25 04:30:20,650 INFO L142 LiptonReduction]: Number of co-enabled transitions 2502 [2021-03-25 04:30:21,743 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:30:22,146 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 04:30:22,252 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 04:30:23,169 INFO L154 LiptonReduction]: Checked pairs total: 4252 [2021-03-25 04:30:23,169 INFO L156 LiptonReduction]: Total number of compositions: 73 [2021-03-25 04:30:23,172 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2558 [2021-03-25 04:30:23,195 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-03-25 04:30:23,196 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:30:23,196 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:23,198 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] [2021-03-25 04:30:23,198 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:23,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:23,204 INFO L82 PathProgramCache]: Analyzing trace with hash 693969698, now seen corresponding path program 1 times [2021-03-25 04:30:23,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:23,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136246111] [2021-03-25 04:30:23,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:23,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:23,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:23,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:23,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:23,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:23,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136246111] [2021-03-25 04:30:23,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:23,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:30:23,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250130383] [2021-03-25 04:30:23,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:30:23,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:23,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:30:23,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:30:23,505 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 189 [2021-03-25 04:30:23,508 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:23,508 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:23,508 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 189 [2021-03-25 04:30:23,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:23,568 INFO L129 PetriNetUnfolder]: 13/97 cut-off events. [2021-03-25 04:30:23,568 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:30:23,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 97 events. 13/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 276 event pairs, 5 based on Foata normal form. 8/98 useless extension candidates. Maximal degree in co-relation 116. Up to 25 conditions per place. [2021-03-25 04:30:23,573 INFO L132 encePairwiseOnDemand]: 185/189 looper letters, 6 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2021-03-25 04:30:23,574 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 47 transitions, 122 flow [2021-03-25 04:30:23,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:30:23,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:30:23,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2021-03-25 04:30:23,592 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9135802469135802 [2021-03-25 04:30:23,593 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2021-03-25 04:30:23,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2021-03-25 04:30:23,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:23,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2021-03-25 04:30:23,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:23,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:23,610 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:23,612 INFO L185 Difference]: Start difference. First operand has 60 places, 48 transitions, 108 flow. Second operand 3 states and 518 transitions. [2021-03-25 04:30:23,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 47 transitions, 122 flow [2021-03-25 04:30:23,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 47 transitions, 118 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 04:30:23,617 INFO L241 Difference]: Finished difference. Result has 56 places, 45 transitions, 102 flow [2021-03-25 04:30:23,619 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2021-03-25 04:30:23,619 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2021-03-25 04:30:23,619 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:23,619 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 45 transitions, 102 flow [2021-03-25 04:30:23,621 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 45 transitions, 102 flow [2021-03-25 04:30:23,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 45 transitions, 102 flow [2021-03-25 04:30:23,629 INFO L129 PetriNetUnfolder]: 0/45 cut-off events. [2021-03-25 04:30:23,629 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:30:23,629 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 45 events. 0/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:30:23,630 INFO L142 LiptonReduction]: Number of co-enabled transitions 512 [2021-03-25 04:30:23,992 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 04:30:24,122 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 04:30:24,989 INFO L154 LiptonReduction]: Checked pairs total: 1608 [2021-03-25 04:30:24,989 INFO L156 LiptonReduction]: Total number of compositions: 15 [2021-03-25 04:30:24,989 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1370 [2021-03-25 04:30:24,990 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 72 flow [2021-03-25 04:30:24,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:24,990 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:24,990 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] [2021-03-25 04:30:24,991 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:30:24,991 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:24,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:24,991 INFO L82 PathProgramCache]: Analyzing trace with hash 645745813, now seen corresponding path program 1 times [2021-03-25 04:30:24,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:24,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283630906] [2021-03-25 04:30:24,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:25,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:25,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:25,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:25,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:25,105 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 04:30:25,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 04:30:25,117 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:30:25,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:30:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:25,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283630906] [2021-03-25 04:30:25,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:25,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:30:25,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504602201] [2021-03-25 04:30:25,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:30:25,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:25,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:30:25,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:30:25,126 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 204 [2021-03-25 04:30:25,127 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 161.2) internal successors, (806), 5 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:25,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:25,127 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 204 [2021-03-25 04:30:25,128 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:25,324 INFO L129 PetriNetUnfolder]: 501/949 cut-off events. [2021-03-25 04:30:25,324 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:30:25,327 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1728 conditions, 949 events. 501/949 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5444 event pairs, 103 based on Foata normal form. 0/883 useless extension candidates. Maximal degree in co-relation 1715. Up to 231 conditions per place. [2021-03-25 04:30:25,331 INFO L132 encePairwiseOnDemand]: 194/204 looper letters, 14 selfloop transitions, 8 changer transitions 22/62 dead transitions. [2021-03-25 04:30:25,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 62 transitions, 224 flow [2021-03-25 04:30:25,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:30:25,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:30:25,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1166 transitions. [2021-03-25 04:30:25,334 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8165266106442577 [2021-03-25 04:30:25,334 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1166 transitions. [2021-03-25 04:30:25,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1166 transitions. [2021-03-25 04:30:25,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:25,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1166 transitions. [2021-03-25 04:30:25,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 166.57142857142858) internal successors, (1166), 7 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:25,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:25,341 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:25,341 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 72 flow. Second operand 7 states and 1166 transitions. [2021-03-25 04:30:25,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 62 transitions, 224 flow [2021-03-25 04:30:25,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:30:25,343 INFO L241 Difference]: Finished difference. Result has 50 places, 35 transitions, 138 flow [2021-03-25 04:30:25,343 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=138, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2021-03-25 04:30:25,344 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -10 predicate places. [2021-03-25 04:30:25,344 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:25,344 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 35 transitions, 138 flow [2021-03-25 04:30:25,345 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 35 transitions, 138 flow [2021-03-25 04:30:25,345 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 138 flow [2021-03-25 04:30:25,441 INFO L129 PetriNetUnfolder]: 194/430 cut-off events. [2021-03-25 04:30:25,441 INFO L130 PetriNetUnfolder]: For 173/195 co-relation queries the response was YES. [2021-03-25 04:30:25,442 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 430 events. 194/430 cut-off events. For 173/195 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2445 event pairs, 91 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 1073. Up to 217 conditions per place. [2021-03-25 04:30:25,447 INFO L142 LiptonReduction]: Number of co-enabled transitions 396 [2021-03-25 04:30:26,324 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 04:30:26,517 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 04:30:26,837 WARN L205 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 04:30:27,001 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 04:30:27,022 INFO L154 LiptonReduction]: Checked pairs total: 462 [2021-03-25 04:30:27,022 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:30:27,022 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1678 [2021-03-25 04:30:27,023 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 132 flow [2021-03-25 04:30:27,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 161.2) internal successors, (806), 5 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:27,024 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:27,024 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:30:27,024 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:30:27,024 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:27,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:27,024 INFO L82 PathProgramCache]: Analyzing trace with hash -278342043, now seen corresponding path program 1 times [2021-03-25 04:30:27,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:27,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953570011] [2021-03-25 04:30:27,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:27,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:27,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:27,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:27,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953570011] [2021-03-25 04:30:27,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:27,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 04:30:27,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229365829] [2021-03-25 04:30:27,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:30:27,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:27,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:30:27,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:30:27,082 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 207 [2021-03-25 04:30:27,082 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:27,083 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:27,083 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 207 [2021-03-25 04:30:27,083 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:27,177 INFO L129 PetriNetUnfolder]: 174/400 cut-off events. [2021-03-25 04:30:27,178 INFO L130 PetriNetUnfolder]: For 336/405 co-relation queries the response was YES. [2021-03-25 04:30:27,179 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 400 events. 174/400 cut-off events. For 336/405 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2215 event pairs, 63 based on Foata normal form. 6/388 useless extension candidates. Maximal degree in co-relation 1095. Up to 194 conditions per place. [2021-03-25 04:30:27,181 INFO L132 encePairwiseOnDemand]: 203/207 looper letters, 5 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2021-03-25 04:30:27,181 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 168 flow [2021-03-25 04:30:27,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:30:27,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:30:27,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2021-03-25 04:30:27,183 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.895330112721417 [2021-03-25 04:30:27,183 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 556 transitions. [2021-03-25 04:30:27,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions. [2021-03-25 04:30:27,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:27,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions. [2021-03-25 04:30:27,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:27,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:27,187 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:27,187 INFO L185 Difference]: Start difference. First operand has 43 places, 32 transitions, 132 flow. Second operand 3 states and 556 transitions. [2021-03-25 04:30:27,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 168 flow [2021-03-25 04:30:27,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 35 transitions, 150 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-03-25 04:30:27,191 INFO L241 Difference]: Finished difference. Result has 43 places, 35 transitions, 152 flow [2021-03-25 04:30:27,191 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2021-03-25 04:30:27,192 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -17 predicate places. [2021-03-25 04:30:27,192 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:27,192 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 35 transitions, 152 flow [2021-03-25 04:30:27,192 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 35 transitions, 152 flow [2021-03-25 04:30:27,193 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 35 transitions, 152 flow [2021-03-25 04:30:27,238 INFO L129 PetriNetUnfolder]: 173/382 cut-off events. [2021-03-25 04:30:27,238 INFO L130 PetriNetUnfolder]: For 196/223 co-relation queries the response was YES. [2021-03-25 04:30:27,239 INFO L84 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 382 events. 173/382 cut-off events. For 196/223 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2114 event pairs, 65 based on Foata normal form. 2/374 useless extension candidates. Maximal degree in co-relation 949. Up to 190 conditions per place. [2021-03-25 04:30:27,242 INFO L142 LiptonReduction]: Number of co-enabled transitions 458 [2021-03-25 04:30:27,259 INFO L154 LiptonReduction]: Checked pairs total: 310 [2021-03-25 04:30:27,259 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:30:27,260 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 68 [2021-03-25 04:30:27,264 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 152 flow [2021-03-25 04:30:27,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:27,264 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:27,265 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:30:27,265 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:30:27,265 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:27,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:27,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1886385020, now seen corresponding path program 1 times [2021-03-25 04:30:27,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:27,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650111380] [2021-03-25 04:30:27,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:27,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:27,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:27,352 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 04:30:27,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 04:30:27,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:27,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650111380] [2021-03-25 04:30:27,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:27,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:30:27,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975505365] [2021-03-25 04:30:27,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:30:27,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:27,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:30:27,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:30:27,367 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 207 [2021-03-25 04:30:27,367 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 166.5) internal successors, (666), 4 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:27,368 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:27,368 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 207 [2021-03-25 04:30:27,368 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:27,468 INFO L129 PetriNetUnfolder]: 205/472 cut-off events. [2021-03-25 04:30:27,468 INFO L130 PetriNetUnfolder]: For 358/676 co-relation queries the response was YES. [2021-03-25 04:30:27,470 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 472 events. 205/472 cut-off events. For 358/676 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2584 event pairs, 19 based on Foata normal form. 8/466 useless extension candidates. Maximal degree in co-relation 1418. Up to 213 conditions per place. [2021-03-25 04:30:27,473 INFO L132 encePairwiseOnDemand]: 197/207 looper letters, 22 selfloop transitions, 16 changer transitions 0/54 dead transitions. [2021-03-25 04:30:27,473 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 331 flow [2021-03-25 04:30:27,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:30:27,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:30:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 684 transitions. [2021-03-25 04:30:27,475 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8260869565217391 [2021-03-25 04:30:27,475 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 684 transitions. [2021-03-25 04:30:27,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 684 transitions. [2021-03-25 04:30:27,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:27,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 684 transitions. [2021-03-25 04:30:27,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:27,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:27,479 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:27,479 INFO L185 Difference]: Start difference. First operand has 43 places, 35 transitions, 152 flow. Second operand 4 states and 684 transitions. [2021-03-25 04:30:27,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 331 flow [2021-03-25 04:30:27,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 324 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:30:27,484 INFO L241 Difference]: Finished difference. Result has 48 places, 47 transitions, 305 flow [2021-03-25 04:30:27,484 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=305, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2021-03-25 04:30:27,485 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -12 predicate places. [2021-03-25 04:30:27,485 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:27,485 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 47 transitions, 305 flow [2021-03-25 04:30:27,485 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 47 transitions, 305 flow [2021-03-25 04:30:27,486 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 47 transitions, 305 flow [2021-03-25 04:30:27,536 INFO L129 PetriNetUnfolder]: 208/439 cut-off events. [2021-03-25 04:30:27,536 INFO L130 PetriNetUnfolder]: For 747/792 co-relation queries the response was YES. [2021-03-25 04:30:27,538 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 439 events. 208/439 cut-off events. For 747/792 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2432 event pairs, 73 based on Foata normal form. 4/414 useless extension candidates. Maximal degree in co-relation 1480. Up to 197 conditions per place. [2021-03-25 04:30:27,542 INFO L142 LiptonReduction]: Number of co-enabled transitions 552 [2021-03-25 04:30:27,568 INFO L154 LiptonReduction]: Checked pairs total: 632 [2021-03-25 04:30:27,568 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:30:27,569 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 84 [2021-03-25 04:30:27,569 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 305 flow [2021-03-25 04:30:27,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 166.5) internal successors, (666), 4 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:27,570 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:27,570 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:30:27,570 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:30:27,570 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:27,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:27,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1719278094, now seen corresponding path program 1 times [2021-03-25 04:30:27,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:27,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001137497] [2021-03-25 04:30:27,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:27,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:27,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:27,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:27,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:30:27,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:27,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:27,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-25 04:30:27,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001137497] [2021-03-25 04:30:27,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:27,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:30:27,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654161118] [2021-03-25 04:30:27,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:30:27,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:27,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:30:27,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:30:27,696 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 207 [2021-03-25 04:30:27,697 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 305 flow. Second operand has 4 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:27,697 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:27,698 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 207 [2021-03-25 04:30:27,698 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:27,934 INFO L129 PetriNetUnfolder]: 909/1804 cut-off events. [2021-03-25 04:30:27,935 INFO L130 PetriNetUnfolder]: For 1212/1292 co-relation queries the response was YES. [2021-03-25 04:30:27,943 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4533 conditions, 1804 events. 909/1804 cut-off events. For 1212/1292 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 13672 event pairs, 390 based on Foata normal form. 164/1779 useless extension candidates. Maximal degree in co-relation 4515. Up to 1063 conditions per place. [2021-03-25 04:30:27,952 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 10 selfloop transitions, 10 changer transitions 0/60 dead transitions. [2021-03-25 04:30:27,952 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 371 flow [2021-03-25 04:30:27,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:30:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:30:27,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 892 transitions. [2021-03-25 04:30:27,954 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8618357487922705 [2021-03-25 04:30:27,954 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 892 transitions. [2021-03-25 04:30:27,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 892 transitions. [2021-03-25 04:30:27,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:27,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 892 transitions. [2021-03-25 04:30:27,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 178.4) internal successors, (892), 5 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:27,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:27,960 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:27,960 INFO L185 Difference]: Start difference. First operand has 48 places, 47 transitions, 305 flow. Second operand 5 states and 892 transitions. [2021-03-25 04:30:27,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 371 flow [2021-03-25 04:30:27,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 368 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:30:27,964 INFO L241 Difference]: Finished difference. Result has 54 places, 56 transitions, 377 flow [2021-03-25 04:30:27,964 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=377, PETRI_PLACES=54, PETRI_TRANSITIONS=56} [2021-03-25 04:30:27,965 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2021-03-25 04:30:27,965 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:27,965 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 56 transitions, 377 flow [2021-03-25 04:30:27,965 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 56 transitions, 377 flow [2021-03-25 04:30:27,965 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 56 transitions, 377 flow [2021-03-25 04:30:28,136 INFO L129 PetriNetUnfolder]: 889/1745 cut-off events. [2021-03-25 04:30:28,136 INFO L130 PetriNetUnfolder]: For 2183/3007 co-relation queries the response was YES. [2021-03-25 04:30:28,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5580 conditions, 1745 events. 889/1745 cut-off events. For 2183/3007 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 13393 event pairs, 356 based on Foata normal form. 19/1530 useless extension candidates. Maximal degree in co-relation 5560. Up to 1034 conditions per place. [2021-03-25 04:30:28,164 INFO L142 LiptonReduction]: Number of co-enabled transitions 916 [2021-03-25 04:30:28,384 INFO L154 LiptonReduction]: Checked pairs total: 809 [2021-03-25 04:30:28,384 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:30:28,384 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 419 [2021-03-25 04:30:28,385 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 55 transitions, 371 flow [2021-03-25 04:30:28,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:28,385 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:28,385 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:30:28,385 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:30:28,385 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:28,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:28,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1059211517, now seen corresponding path program 1 times [2021-03-25 04:30:28,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:28,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890166543] [2021-03-25 04:30:28,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:28,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:28,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:28,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:28,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:28,455 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 04:30:28,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 04:30:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:28,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890166543] [2021-03-25 04:30:28,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:28,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:30:28,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008853411] [2021-03-25 04:30:28,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:30:28,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:28,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:30:28,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:30:28,475 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 207 [2021-03-25 04:30:28,476 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 55 transitions, 371 flow. Second operand has 4 states, 4 states have (on average 166.5) internal successors, (666), 4 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:28,476 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:28,476 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 207 [2021-03-25 04:30:28,476 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:28,772 INFO L129 PetriNetUnfolder]: 1235/2390 cut-off events. [2021-03-25 04:30:28,773 INFO L130 PetriNetUnfolder]: For 3347/4352 co-relation queries the response was YES. [2021-03-25 04:30:28,786 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7831 conditions, 2390 events. 1235/2390 cut-off events. For 3347/4352 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 18181 event pairs, 566 based on Foata normal form. 91/2224 useless extension candidates. Maximal degree in co-relation 7809. Up to 1569 conditions per place. [2021-03-25 04:30:28,799 INFO L132 encePairwiseOnDemand]: 197/207 looper letters, 23 selfloop transitions, 30 changer transitions 0/73 dead transitions. [2021-03-25 04:30:28,799 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 73 transitions, 613 flow [2021-03-25 04:30:28,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:30:28,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:30:28,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 685 transitions. [2021-03-25 04:30:28,801 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8272946859903382 [2021-03-25 04:30:28,801 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 685 transitions. [2021-03-25 04:30:28,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 685 transitions. [2021-03-25 04:30:28,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:28,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 685 transitions. [2021-03-25 04:30:28,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 171.25) internal successors, (685), 4 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:28,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:28,804 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:28,804 INFO L185 Difference]: Start difference. First operand has 54 places, 55 transitions, 371 flow. Second operand 4 states and 685 transitions. [2021-03-25 04:30:28,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 73 transitions, 613 flow [2021-03-25 04:30:28,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 606 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:30:28,831 INFO L241 Difference]: Finished difference. Result has 56 places, 68 transitions, 624 flow [2021-03-25 04:30:28,831 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=624, PETRI_PLACES=56, PETRI_TRANSITIONS=68} [2021-03-25 04:30:28,831 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2021-03-25 04:30:28,832 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:28,832 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 68 transitions, 624 flow [2021-03-25 04:30:28,832 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 68 transitions, 624 flow [2021-03-25 04:30:28,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 68 transitions, 624 flow [2021-03-25 04:30:29,039 INFO L129 PetriNetUnfolder]: 1109/2098 cut-off events. [2021-03-25 04:30:29,039 INFO L130 PetriNetUnfolder]: For 2987/3650 co-relation queries the response was YES. [2021-03-25 04:30:29,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6782 conditions, 2098 events. 1109/2098 cut-off events. For 2987/3650 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 15818 event pairs, 502 based on Foata normal form. 5/1870 useless extension candidates. Maximal degree in co-relation 6759. Up to 1372 conditions per place. [2021-03-25 04:30:29,072 INFO L142 LiptonReduction]: Number of co-enabled transitions 950 [2021-03-25 04:30:29,137 INFO L154 LiptonReduction]: Checked pairs total: 352 [2021-03-25 04:30:29,138 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:30:29,138 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 306 [2021-03-25 04:30:29,139 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 68 transitions, 624 flow [2021-03-25 04:30:29,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 166.5) internal successors, (666), 4 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:29,139 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:29,140 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:30:29,140 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:30:29,140 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:29,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:29,140 INFO L82 PathProgramCache]: Analyzing trace with hash -134105443, now seen corresponding path program 1 times [2021-03-25 04:30:29,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:29,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689392266] [2021-03-25 04:30:29,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:29,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:29,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:29,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:29,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:29,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:29,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:30:29,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:29,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:29,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:29,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689392266] [2021-03-25 04:30:29,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:29,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:30:29,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11863368] [2021-03-25 04:30:29,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:30:29,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:29,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:30:29,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:30:29,240 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 207 [2021-03-25 04:30:29,240 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 68 transitions, 624 flow. Second operand has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:29,241 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:29,241 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 207 [2021-03-25 04:30:29,241 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:29,566 INFO L129 PetriNetUnfolder]: 897/2000 cut-off events. [2021-03-25 04:30:29,566 INFO L130 PetriNetUnfolder]: For 3181/5026 co-relation queries the response was YES. [2021-03-25 04:30:29,577 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7794 conditions, 2000 events. 897/2000 cut-off events. For 3181/5026 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 16031 event pairs, 177 based on Foata normal form. 492/2392 useless extension candidates. Maximal degree in co-relation 7769. Up to 1398 conditions per place. [2021-03-25 04:30:29,586 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 10 selfloop transitions, 14 changer transitions 4/81 dead transitions. [2021-03-25 04:30:29,586 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 81 transitions, 748 flow [2021-03-25 04:30:29,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:30:29,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:30:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1070 transitions. [2021-03-25 04:30:29,590 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8615136876006442 [2021-03-25 04:30:29,590 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1070 transitions. [2021-03-25 04:30:29,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1070 transitions. [2021-03-25 04:30:29,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:29,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1070 transitions. [2021-03-25 04:30:29,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 178.33333333333334) internal successors, (1070), 6 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:29,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:29,594 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:29,594 INFO L185 Difference]: Start difference. First operand has 56 places, 68 transitions, 624 flow. Second operand 6 states and 1070 transitions. [2021-03-25 04:30:29,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 81 transitions, 748 flow [2021-03-25 04:30:29,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 81 transitions, 736 flow, removed 6 selfloop flow, removed 0 redundant places. [2021-03-25 04:30:29,601 INFO L241 Difference]: Finished difference. Result has 64 places, 73 transitions, 688 flow [2021-03-25 04:30:29,601 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=688, PETRI_PLACES=64, PETRI_TRANSITIONS=73} [2021-03-25 04:30:29,602 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2021-03-25 04:30:29,602 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:29,602 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 73 transitions, 688 flow [2021-03-25 04:30:29,602 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 73 transitions, 688 flow [2021-03-25 04:30:29,603 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 73 transitions, 688 flow [2021-03-25 04:30:29,778 INFO L129 PetriNetUnfolder]: 820/1790 cut-off events. [2021-03-25 04:30:29,778 INFO L130 PetriNetUnfolder]: For 6055/7924 co-relation queries the response was YES. [2021-03-25 04:30:29,789 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8220 conditions, 1790 events. 820/1790 cut-off events. For 6055/7924 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 14538 event pairs, 163 based on Foata normal form. 51/1728 useless extension candidates. Maximal degree in co-relation 8192. Up to 1256 conditions per place. [2021-03-25 04:30:29,811 INFO L142 LiptonReduction]: Number of co-enabled transitions 1308 [2021-03-25 04:30:30,401 INFO L154 LiptonReduction]: Checked pairs total: 623 [2021-03-25 04:30:30,401 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:30:30,402 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 800 [2021-03-25 04:30:30,402 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 72 transitions, 680 flow [2021-03-25 04:30:30,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:30,402 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:30,403 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] [2021-03-25 04:30:30,403 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:30:30,403 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:30,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:30,403 INFO L82 PathProgramCache]: Analyzing trace with hash -2126455076, now seen corresponding path program 1 times [2021-03-25 04:30:30,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:30,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975680953] [2021-03-25 04:30:30,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:30,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:30,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:30,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:30,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:30,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:30,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:30,460 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 04:30:30,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 04:30:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:30,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975680953] [2021-03-25 04:30:30,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:30,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:30:30,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12813212] [2021-03-25 04:30:30,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:30:30,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:30,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:30:30,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:30:30,474 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 207 [2021-03-25 04:30:30,475 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 72 transitions, 680 flow. Second operand has 5 states, 5 states have (on average 166.6) internal successors, (833), 5 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:30,475 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:30,475 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 207 [2021-03-25 04:30:30,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:30,790 INFO L129 PetriNetUnfolder]: 1124/2392 cut-off events. [2021-03-25 04:30:30,791 INFO L130 PetriNetUnfolder]: For 8442/11465 co-relation queries the response was YES. [2021-03-25 04:30:30,804 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11099 conditions, 2392 events. 1124/2392 cut-off events. For 8442/11465 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 19179 event pairs, 263 based on Foata normal form. 136/2373 useless extension candidates. Maximal degree in co-relation 11069. Up to 1611 conditions per place. [2021-03-25 04:30:30,813 INFO L132 encePairwiseOnDemand]: 197/207 looper letters, 26 selfloop transitions, 35 changer transitions 13/98 dead transitions. [2021-03-25 04:30:30,813 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 98 transitions, 1087 flow [2021-03-25 04:30:30,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:30:30,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:30:30,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 855 transitions. [2021-03-25 04:30:30,816 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8260869565217391 [2021-03-25 04:30:30,816 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 855 transitions. [2021-03-25 04:30:30,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 855 transitions. [2021-03-25 04:30:30,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:30,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 855 transitions. [2021-03-25 04:30:30,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:30,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:30,821 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:30,821 INFO L185 Difference]: Start difference. First operand has 64 places, 72 transitions, 680 flow. Second operand 5 states and 855 transitions. [2021-03-25 04:30:30,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 98 transitions, 1087 flow [2021-03-25 04:30:30,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 98 transitions, 1049 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-25 04:30:30,935 INFO L241 Difference]: Finished difference. Result has 66 places, 82 transitions, 917 flow [2021-03-25 04:30:30,935 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=917, PETRI_PLACES=66, PETRI_TRANSITIONS=82} [2021-03-25 04:30:30,936 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 6 predicate places. [2021-03-25 04:30:30,936 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:30,936 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 82 transitions, 917 flow [2021-03-25 04:30:30,936 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 82 transitions, 917 flow [2021-03-25 04:30:30,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 82 transitions, 917 flow [2021-03-25 04:30:31,175 INFO L129 PetriNetUnfolder]: 1044/2186 cut-off events. [2021-03-25 04:30:31,175 INFO L130 PetriNetUnfolder]: For 5322/5923 co-relation queries the response was YES. [2021-03-25 04:30:31,187 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8101 conditions, 2186 events. 1044/2186 cut-off events. For 5322/5923 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 17638 event pairs, 254 based on Foata normal form. 72/2143 useless extension candidates. Maximal degree in co-relation 8071. Up to 1363 conditions per place. [2021-03-25 04:30:31,212 INFO L142 LiptonReduction]: Number of co-enabled transitions 1214 [2021-03-25 04:30:31,344 INFO L154 LiptonReduction]: Checked pairs total: 800 [2021-03-25 04:30:31,344 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:30:31,344 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 408 [2021-03-25 04:30:31,345 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 82 transitions, 917 flow [2021-03-25 04:30:31,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 166.6) internal successors, (833), 5 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:31,345 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:31,345 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] [2021-03-25 04:30:31,345 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:30:31,345 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:31,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:31,346 INFO L82 PathProgramCache]: Analyzing trace with hash 456450948, now seen corresponding path program 2 times [2021-03-25 04:30:31,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:31,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588900315] [2021-03-25 04:30:31,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:31,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:31,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:31,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:31,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:31,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:31,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:31,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:31,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:30:31,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:31,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:31,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:31,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588900315] [2021-03-25 04:30:31,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:31,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:30:31,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422587646] [2021-03-25 04:30:31,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:30:31,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:31,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:30:31,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:30:31,478 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 207 [2021-03-25 04:30:31,479 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 82 transitions, 917 flow. Second operand has 6 states, 6 states have (on average 174.83333333333334) internal successors, (1049), 6 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:31,479 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:31,480 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 207 [2021-03-25 04:30:31,480 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:31,761 INFO L129 PetriNetUnfolder]: 784/1860 cut-off events. [2021-03-25 04:30:31,761 INFO L130 PetriNetUnfolder]: For 4868/7451 co-relation queries the response was YES. [2021-03-25 04:30:31,771 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8241 conditions, 1860 events. 784/1860 cut-off events. For 4868/7451 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 15186 event pairs, 71 based on Foata normal form. 769/2544 useless extension candidates. Maximal degree in co-relation 8209. Up to 1214 conditions per place. [2021-03-25 04:30:31,777 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 6 selfloop transitions, 18 changer transitions 10/95 dead transitions. [2021-03-25 04:30:31,777 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 95 transitions, 1075 flow [2021-03-25 04:30:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:30:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:30:31,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1248 transitions. [2021-03-25 04:30:31,780 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8612836438923396 [2021-03-25 04:30:31,781 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1248 transitions. [2021-03-25 04:30:31,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1248 transitions. [2021-03-25 04:30:31,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:31,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1248 transitions. [2021-03-25 04:30:31,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 178.28571428571428) internal successors, (1248), 7 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:31,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:31,786 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:31,786 INFO L185 Difference]: Start difference. First operand has 66 places, 82 transitions, 917 flow. Second operand 7 states and 1248 transitions. [2021-03-25 04:30:31,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 95 transitions, 1075 flow [2021-03-25 04:30:31,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 95 transitions, 1069 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-03-25 04:30:31,799 INFO L241 Difference]: Finished difference. Result has 75 places, 85 transitions, 962 flow [2021-03-25 04:30:31,799 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=962, PETRI_PLACES=75, PETRI_TRANSITIONS=85} [2021-03-25 04:30:31,799 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 15 predicate places. [2021-03-25 04:30:31,799 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:31,800 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 85 transitions, 962 flow [2021-03-25 04:30:31,800 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 85 transitions, 962 flow [2021-03-25 04:30:31,800 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 85 transitions, 962 flow [2021-03-25 04:30:31,942 INFO L129 PetriNetUnfolder]: 599/1452 cut-off events. [2021-03-25 04:30:31,942 INFO L130 PetriNetUnfolder]: For 5046/5552 co-relation queries the response was YES. [2021-03-25 04:30:31,951 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7039 conditions, 1452 events. 599/1452 cut-off events. For 5046/5552 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 11674 event pairs, 57 based on Foata normal form. 2/1393 useless extension candidates. Maximal degree in co-relation 7004. Up to 904 conditions per place. [2021-03-25 04:30:31,967 INFO L142 LiptonReduction]: Number of co-enabled transitions 1244 [2021-03-25 04:30:32,281 INFO L154 LiptonReduction]: Checked pairs total: 1668 [2021-03-25 04:30:32,281 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:30:32,282 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 483 [2021-03-25 04:30:32,282 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 84 transitions, 952 flow [2021-03-25 04:30:32,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 174.83333333333334) internal successors, (1049), 6 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:32,282 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:32,283 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] [2021-03-25 04:30:32,283 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:30:32,283 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:32,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:32,283 INFO L82 PathProgramCache]: Analyzing trace with hash -255025330, now seen corresponding path program 1 times [2021-03-25 04:30:32,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:32,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829340624] [2021-03-25 04:30:32,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:32,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:32,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:32,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:32,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:32,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:32,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:32,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:32,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:32,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:32,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:30:32,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:32,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:32,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:32,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829340624] [2021-03-25 04:30:32,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:32,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 04:30:32,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838523196] [2021-03-25 04:30:32,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:30:32,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:32,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:30:32,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:30:32,406 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 207 [2021-03-25 04:30:32,407 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 84 transitions, 952 flow. Second operand has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:32,407 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:32,407 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 207 [2021-03-25 04:30:32,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:32,659 INFO L129 PetriNetUnfolder]: 468/1119 cut-off events. [2021-03-25 04:30:32,660 INFO L130 PetriNetUnfolder]: For 4852/6139 co-relation queries the response was YES. [2021-03-25 04:30:32,667 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5825 conditions, 1119 events. 468/1119 cut-off events. For 4852/6139 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 8076 event pairs, 45 based on Foata normal form. 359/1420 useless extension candidates. Maximal degree in co-relation 5788. Up to 604 conditions per place. [2021-03-25 04:30:32,670 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 2 selfloop transitions, 18 changer transitions 33/85 dead transitions. [2021-03-25 04:30:32,670 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 85 transitions, 1000 flow [2021-03-25 04:30:32,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 04:30:32,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 04:30:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1418 transitions. [2021-03-25 04:30:32,674 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.856280193236715 [2021-03-25 04:30:32,674 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1418 transitions. [2021-03-25 04:30:32,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1418 transitions. [2021-03-25 04:30:32,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:32,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1418 transitions. [2021-03-25 04:30:32,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 177.25) internal successors, (1418), 8 states have internal predecessors, (1418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:32,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 207.0) internal successors, (1863), 9 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:32,680 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 207.0) internal successors, (1863), 9 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:32,680 INFO L185 Difference]: Start difference. First operand has 75 places, 84 transitions, 952 flow. Second operand 8 states and 1418 transitions. [2021-03-25 04:30:32,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 85 transitions, 1000 flow [2021-03-25 04:30:32,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 85 transitions, 911 flow, removed 17 selfloop flow, removed 7 redundant places. [2021-03-25 04:30:32,709 INFO L241 Difference]: Finished difference. Result has 76 places, 52 transitions, 475 flow [2021-03-25 04:30:32,709 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=475, PETRI_PLACES=76, PETRI_TRANSITIONS=52} [2021-03-25 04:30:32,709 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 16 predicate places. [2021-03-25 04:30:32,709 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:32,710 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 52 transitions, 475 flow [2021-03-25 04:30:32,710 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 52 transitions, 475 flow [2021-03-25 04:30:32,710 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 52 transitions, 475 flow [2021-03-25 04:30:32,733 INFO L129 PetriNetUnfolder]: 93/240 cut-off events. [2021-03-25 04:30:32,733 INFO L130 PetriNetUnfolder]: For 654/706 co-relation queries the response was YES. [2021-03-25 04:30:32,734 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1082 conditions, 240 events. 93/240 cut-off events. For 654/706 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1236 event pairs, 15 based on Foata normal form. 1/229 useless extension candidates. Maximal degree in co-relation 1055. Up to 77 conditions per place. [2021-03-25 04:30:32,736 INFO L142 LiptonReduction]: Number of co-enabled transitions 414 [2021-03-25 04:30:33,045 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 04:30:33,171 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 04:30:33,380 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-25 04:30:33,519 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 04:30:33,647 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 04:30:33,651 INFO L154 LiptonReduction]: Checked pairs total: 615 [2021-03-25 04:30:33,651 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 04:30:33,652 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 943 [2021-03-25 04:30:33,652 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 49 transitions, 463 flow [2021-03-25 04:30:33,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:33,652 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:33,653 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] [2021-03-25 04:30:33,653 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:30:33,653 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:33,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:33,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1866847400, now seen corresponding path program 1 times [2021-03-25 04:30:33,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:33,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591253988] [2021-03-25 04:30:33,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:33,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:33,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:33,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:33,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:33,703 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 04:30:33,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 04:30:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:33,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591253988] [2021-03-25 04:30:33,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:33,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:30:33,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803952450] [2021-03-25 04:30:33,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:30:33,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:33,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:30:33,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:30:33,717 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 210 [2021-03-25 04:30:33,717 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 49 transitions, 463 flow. Second operand has 4 states, 4 states have (on average 164.75) internal successors, (659), 4 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:33,717 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:33,717 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 210 [2021-03-25 04:30:33,717 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:33,800 INFO L129 PetriNetUnfolder]: 142/354 cut-off events. [2021-03-25 04:30:33,800 INFO L130 PetriNetUnfolder]: For 1497/1666 co-relation queries the response was YES. [2021-03-25 04:30:33,802 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1621 conditions, 354 events. 142/354 cut-off events. For 1497/1666 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1924 event pairs, 6 based on Foata normal form. 40/379 useless extension candidates. Maximal degree in co-relation 1585. Up to 106 conditions per place. [2021-03-25 04:30:33,803 INFO L132 encePairwiseOnDemand]: 198/210 looper letters, 14 selfloop transitions, 21 changer transitions 2/62 dead transitions. [2021-03-25 04:30:33,803 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 62 transitions, 659 flow [2021-03-25 04:30:33,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:30:33,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:30:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 837 transitions. [2021-03-25 04:30:33,805 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7971428571428572 [2021-03-25 04:30:33,805 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 837 transitions. [2021-03-25 04:30:33,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 837 transitions. [2021-03-25 04:30:33,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:33,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 837 transitions. [2021-03-25 04:30:33,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.4) internal successors, (837), 5 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:33,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:33,809 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:33,809 INFO L185 Difference]: Start difference. First operand has 70 places, 49 transitions, 463 flow. Second operand 5 states and 837 transitions. [2021-03-25 04:30:33,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 62 transitions, 659 flow [2021-03-25 04:30:33,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 62 transitions, 542 flow, removed 28 selfloop flow, removed 13 redundant places. [2021-03-25 04:30:33,816 INFO L241 Difference]: Finished difference. Result has 63 places, 59 transitions, 541 flow [2021-03-25 04:30:33,816 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=541, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2021-03-25 04:30:33,816 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 3 predicate places. [2021-03-25 04:30:33,817 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:33,817 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 59 transitions, 541 flow [2021-03-25 04:30:33,817 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 59 transitions, 541 flow [2021-03-25 04:30:33,817 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 59 transitions, 541 flow [2021-03-25 04:30:33,848 INFO L129 PetriNetUnfolder]: 138/355 cut-off events. [2021-03-25 04:30:33,848 INFO L130 PetriNetUnfolder]: For 867/947 co-relation queries the response was YES. [2021-03-25 04:30:33,850 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 355 events. 138/355 cut-off events. For 867/947 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2134 event pairs, 7 based on Foata normal form. 21/357 useless extension candidates. Maximal degree in co-relation 1340. Up to 98 conditions per place. [2021-03-25 04:30:33,853 INFO L142 LiptonReduction]: Number of co-enabled transitions 486 [2021-03-25 04:30:33,867 INFO L154 LiptonReduction]: Checked pairs total: 207 [2021-03-25 04:30:33,867 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:30:33,867 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 50 [2021-03-25 04:30:33,867 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 541 flow [2021-03-25 04:30:33,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 164.75) internal successors, (659), 4 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:33,868 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:33,868 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] [2021-03-25 04:30:33,868 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 04:30:33,868 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:33,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:33,869 INFO L82 PathProgramCache]: Analyzing trace with hash -281603909, now seen corresponding path program 1 times [2021-03-25 04:30:33,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:33,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805947981] [2021-03-25 04:30:33,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:33,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:33,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:33,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:33,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:33,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:33,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:33,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:33,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805947981] [2021-03-25 04:30:33,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:33,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:30:33,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252163469] [2021-03-25 04:30:33,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:30:33,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:33,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:30:33,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:30:33,940 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 210 [2021-03-25 04:30:33,941 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 541 flow. Second operand has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:33,941 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:33,941 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 210 [2021-03-25 04:30:33,941 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:33,995 INFO L129 PetriNetUnfolder]: 168/427 cut-off events. [2021-03-25 04:30:33,995 INFO L130 PetriNetUnfolder]: For 1356/1467 co-relation queries the response was YES. [2021-03-25 04:30:33,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1674 conditions, 427 events. 168/427 cut-off events. For 1356/1467 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2594 event pairs, 7 based on Foata normal form. 29/434 useless extension candidates. Maximal degree in co-relation 1645. Up to 124 conditions per place. [2021-03-25 04:30:34,001 INFO L132 encePairwiseOnDemand]: 207/210 looper letters, 3 selfloop transitions, 1 changer transitions 20/59 dead transitions. [2021-03-25 04:30:34,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 59 transitions, 557 flow [2021-03-25 04:30:34,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:30:34,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:30:34,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 738 transitions. [2021-03-25 04:30:34,003 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8785714285714286 [2021-03-25 04:30:34,003 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 738 transitions. [2021-03-25 04:30:34,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 738 transitions. [2021-03-25 04:30:34,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:34,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 738 transitions. [2021-03-25 04:30:34,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:34,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:34,006 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:34,006 INFO L185 Difference]: Start difference. First operand has 63 places, 59 transitions, 541 flow. Second operand 4 states and 738 transitions. [2021-03-25 04:30:34,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 59 transitions, 557 flow [2021-03-25 04:30:34,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 59 transitions, 553 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-03-25 04:30:34,015 INFO L241 Difference]: Finished difference. Result has 67 places, 39 transitions, 304 flow [2021-03-25 04:30:34,015 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=67, PETRI_TRANSITIONS=39} [2021-03-25 04:30:34,015 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2021-03-25 04:30:34,016 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:34,016 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 39 transitions, 304 flow [2021-03-25 04:30:34,016 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 39 transitions, 304 flow [2021-03-25 04:30:34,016 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 39 transitions, 304 flow [2021-03-25 04:30:34,029 INFO L129 PetriNetUnfolder]: 45/140 cut-off events. [2021-03-25 04:30:34,029 INFO L130 PetriNetUnfolder]: For 424/453 co-relation queries the response was YES. [2021-03-25 04:30:34,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 140 events. 45/140 cut-off events. For 424/453 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 637 event pairs, 9 based on Foata normal form. 12/144 useless extension candidates. Maximal degree in co-relation 547. Up to 36 conditions per place. [2021-03-25 04:30:34,031 INFO L142 LiptonReduction]: Number of co-enabled transitions 150 [2021-03-25 04:30:34,506 WARN L205 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 164 [2021-03-25 04:30:34,679 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2021-03-25 04:30:35,591 WARN L205 SmtUtils]: Spent 909.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 231 [2021-03-25 04:30:35,877 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-25 04:30:35,900 INFO L154 LiptonReduction]: Checked pairs total: 151 [2021-03-25 04:30:35,900 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:30:35,900 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1884 [2021-03-25 04:30:35,901 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 37 transitions, 308 flow [2021-03-25 04:30:35,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:35,901 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:35,901 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] [2021-03-25 04:30:35,901 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 04:30:35,901 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:35,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:35,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1972600273, now seen corresponding path program 2 times [2021-03-25 04:30:35,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:35,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642055206] [2021-03-25 04:30:35,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:30:35,952 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:30:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:30:35,989 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:30:36,035 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:30:36,035 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:30:36,035 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 04:30:36,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:30:36 BasicIcfg [2021-03-25 04:30:36,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:30:36,185 INFO L168 Benchmark]: Toolchain (without parser) took 18549.77 ms. Allocated memory was 255.9 MB in the beginning and 845.2 MB in the end (delta: 589.3 MB). Free memory was 231.2 MB in the beginning and 459.4 MB in the end (delta: -228.2 MB). Peak memory consumption was 359.6 MB. Max. memory is 16.0 GB. [2021-03-25 04:30:36,185 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:30:36,186 INFO L168 Benchmark]: CACSL2BoogieTranslator took 523.50 ms. Allocated memory was 255.9 MB in the beginning and 388.0 MB in the end (delta: 132.1 MB). Free memory was 231.2 MB in the beginning and 346.5 MB in the end (delta: -115.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-25 04:30:36,186 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.45 ms. Allocated memory is still 388.0 MB. Free memory was 346.5 MB in the beginning and 343.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:30:36,186 INFO L168 Benchmark]: Boogie Preprocessor took 31.39 ms. Allocated memory is still 388.0 MB. Free memory was 343.7 MB in the beginning and 340.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:30:36,186 INFO L168 Benchmark]: RCFGBuilder took 2154.95 ms. Allocated memory is still 388.0 MB. Free memory was 340.9 MB in the beginning and 241.3 MB in the end (delta: 99.6 MB). Peak memory consumption was 100.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:30:36,187 INFO L168 Benchmark]: TraceAbstraction took 15787.63 ms. Allocated memory was 388.0 MB in the beginning and 845.2 MB in the end (delta: 457.2 MB). Free memory was 241.3 MB in the beginning and 459.4 MB in the end (delta: -218.1 MB). Peak memory consumption was 239.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:30:36,188 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.53 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 523.50 ms. Allocated memory was 255.9 MB in the beginning and 388.0 MB in the end (delta: 132.1 MB). Free memory was 231.2 MB in the beginning and 346.5 MB in the end (delta: -115.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 47.45 ms. Allocated memory is still 388.0 MB. Free memory was 346.5 MB in the beginning and 343.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 31.39 ms. Allocated memory is still 388.0 MB. Free memory was 343.7 MB in the beginning and 340.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2154.95 ms. Allocated memory is still 388.0 MB. Free memory was 340.9 MB in the beginning and 241.3 MB in the end (delta: 99.6 MB). Peak memory consumption was 100.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 15787.63 ms. Allocated memory was 388.0 MB in the beginning and 845.2 MB in the end (delta: 457.2 MB). Free memory was 241.3 MB in the beginning and 459.4 MB in the end (delta: -218.1 MB). Peak memory consumption was 239.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2544.4ms, 123 PlacesBefore, 60 PlacesAfterwards, 112 TransitionsBefore, 48 TransitionsAfterwards, 2502 CoEnabledTransitionPairs, 5 FixpointIterations, 28 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 73 TotalNumberOfCompositions, 4252 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2084, positive: 1989, positive conditional: 0, positive unconditional: 1989, negative: 95, negative conditional: 0, negative unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1236, positive: 1207, positive conditional: 0, positive unconditional: 1207, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1236, positive: 1207, positive conditional: 0, positive unconditional: 1207, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2084, positive: 782, positive conditional: 0, positive unconditional: 782, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 1236, unknown conditional: 0, unknown unconditional: 1236] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1368.3ms, 56 PlacesBefore, 41 PlacesAfterwards, 45 TransitionsBefore, 30 TransitionsAfterwards, 512 CoEnabledTransitionPairs, 3 FixpointIterations, 10 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 1608 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 484, positive: 401, positive conditional: 0, positive unconditional: 401, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 90, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 484, positive: 325, positive conditional: 0, positive unconditional: 325, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 90, unknown conditional: 0, unknown unconditional: 90] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 123, Positive conditional cache size: 0, Positive unconditional cache size: 123, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1677.3ms, 50 PlacesBefore, 43 PlacesAfterwards, 35 TransitionsBefore, 32 TransitionsAfterwards, 396 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 462 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 116, positive: 92, positive conditional: 0, positive unconditional: 92, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 116, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 127, Positive conditional cache size: 0, Positive unconditional cache size: 127, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 67.0ms, 43 PlacesBefore, 43 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 310 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 71, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 71, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 83.3ms, 48 PlacesBefore, 48 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 552 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 632 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 105, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 105, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 133, Positive conditional cache size: 0, Positive unconditional cache size: 133, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 419.0ms, 54 PlacesBefore, 54 PlacesAfterwards, 56 TransitionsBefore, 55 TransitionsAfterwards, 916 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 809 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 143, positive: 121, positive conditional: 0, positive unconditional: 121, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 143, positive: 117, positive conditional: 0, positive unconditional: 117, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 305.7ms, 56 PlacesBefore, 56 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 950 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 352 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 49, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 49, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 799.4ms, 64 PlacesBefore, 64 PlacesAfterwards, 73 TransitionsBefore, 72 TransitionsAfterwards, 1308 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 623 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 144, positive: 130, positive conditional: 0, positive unconditional: 130, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 144, positive: 119, positive conditional: 0, positive unconditional: 119, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 407.9ms, 66 PlacesBefore, 66 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 1214 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 800 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 86, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 86, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 481.6ms, 75 PlacesBefore, 75 PlacesAfterwards, 85 TransitionsBefore, 84 TransitionsAfterwards, 1244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1668 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 217, positive: 179, positive conditional: 0, positive unconditional: 179, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 217, positive: 168, positive conditional: 0, positive unconditional: 168, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 941.7ms, 76 PlacesBefore, 70 PlacesAfterwards, 52 TransitionsBefore, 49 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 615 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 145, positive: 113, positive conditional: 0, positive unconditional: 113, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 145, positive: 101, positive conditional: 0, positive unconditional: 101, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 112, Positive conditional cache size: 0, Positive unconditional cache size: 112, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 49.9ms, 63 PlacesBefore, 63 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 207 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 21, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 21, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 112, Positive conditional cache size: 0, Positive unconditional cache size: 112, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1884.1ms, 67 PlacesBefore, 64 PlacesAfterwards, 39 TransitionsBefore, 37 TransitionsAfterwards, 150 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 151 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 58, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 58, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - 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; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L867] 0 pthread_t t213; [L868] FCALL, FORK 0 pthread_create(&t213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L869] 0 pthread_t t214; [L870] FCALL, FORK 0 pthread_create(&t214, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 pthread_t t215; [L872] FCALL, FORK 0 pthread_create(&t215, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t216; [L874] FCALL, FORK 0 pthread_create(&t216, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 z$w_buff1 = z$w_buff0 [L814] 4 z$w_buff0 = 1 [L815] 4 z$w_buff1_used = z$w_buff0_used [L816] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L818] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L819] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L820] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L821] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L822] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L823] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 z$flush_delayed = weak$$choice2 [L829] 4 z$mem_tmp = z [L830] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L830] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L830] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L830] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L831] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L831] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L832] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L832] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L833] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L833] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L834] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L835] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L836] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EAX = z [L838] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L838] 4 z = z$flush_delayed ? z$mem_tmp : z [L839] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 [L785] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 z$flush_delayed = weak$$choice2 [L791] 3 z$mem_tmp = z [L792] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L793] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L793] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L794] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L794] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L795] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L795] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L796] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L797] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L798] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L798] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EBX = z [L800] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L800] 3 z = z$flush_delayed ? z$mem_tmp : z [L801] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L845] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L845] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L846] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L846] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L847] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L847] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L848] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L848] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L849] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L849] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L854] 4 return 0; [L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L880] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L880] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L880] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L880] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L881] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L881] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L882] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L882] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L883] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L883] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L884] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L884] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __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_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 15.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 15482.7ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2823.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2623.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 110 SDtfs, 75 SDslu, 86 SDs, 0 SdLazy, 251 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 275.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 212.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=962occurred in iteration=9, InterpolantAutomatonStates: 61, 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: 66.9ms SsaConstructionTime, 468.1ms SatisfiabilityAnalysisTime, 710.7ms InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 232 ConstructedInterpolants, 0 QuantifiedInterpolants, 1315 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...