/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix026_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:25:20,521 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:25:20,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:25:20,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:25:20,547 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:25:20,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:25:20,549 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:25:20,551 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:25:20,553 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:25:20,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:25:20,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:25:20,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:25:20,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:25:20,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:25:20,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:25:20,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:25:20,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:25:20,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:25:20,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:25:20,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:25:20,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:25:20,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:25:20,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:25:20,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:25:20,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:25:20,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:25:20,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:25:20,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:25:20,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:25:20,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:25:20,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:25:20,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:25:20,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:25:20,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:25:20,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:25:20,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:25:20,596 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:25:20,596 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:25:20,596 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:25:20,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:25:20,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:25:20,605 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-RepeatedSemanticLbe.epf [2021-03-25 14:25:20,642 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:25:20,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:25:20,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:25:20,647 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:25:20,647 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:25:20,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:25:20,647 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:25:20,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:25:20,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:25:20,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:25:20,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:25:20,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:25:20,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:25:20,649 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:25:20,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:25:20,649 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:25:20,649 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:25:20,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:25:20,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:25:20,650 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:25:20,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:25:20,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:25:20,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:25:20,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:25:20,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:25:20,650 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:25:20,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:25:20,651 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:25:20,651 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:25:20,651 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 14:25:20,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:25:21,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:25:21,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:25:21,025 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:25:21,025 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:25:21,026 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_power.oepc.i [2021-03-25 14:25:21,093 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f2bc8289/f803211ad77f48b4a2073ad8fb6e129e/FLAGe522e8580 [2021-03-25 14:25:21,719 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:25:21,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_power.oepc.i [2021-03-25 14:25:21,736 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f2bc8289/f803211ad77f48b4a2073ad8fb6e129e/FLAGe522e8580 [2021-03-25 14:25:21,987 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f2bc8289/f803211ad77f48b4a2073ad8fb6e129e [2021-03-25 14:25:21,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:25:21,991 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:25:21,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:25:21,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:25:21,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:25:22,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:25:21" (1/1) ... [2021-03-25 14:25:22,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19728f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:25:22, skipping insertion in model container [2021-03-25 14:25:22,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:25:21" (1/1) ... [2021-03-25 14:25:22,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:25:22,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:25:22,227 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/mix026_power.oepc.i[951,964] [2021-03-25 14:25:22,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:25:22,381 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:25:22,392 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/mix026_power.oepc.i[951,964] [2021-03-25 14:25:22,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:25:22,547 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:25:22,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:25:22 WrapperNode [2021-03-25 14:25:22,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:25:22,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:25:22,550 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:25:22,550 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:25:22,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:25:22" (1/1) ... [2021-03-25 14:25:22,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:25:22" (1/1) ... [2021-03-25 14:25:22,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:25:22,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:25:22,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:25:22,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:25:22,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:25:22" (1/1) ... [2021-03-25 14:25:22,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:25:22" (1/1) ... [2021-03-25 14:25:22,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:25:22" (1/1) ... [2021-03-25 14:25:22,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:25:22" (1/1) ... [2021-03-25 14:25:22,674 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:25:22" (1/1) ... [2021-03-25 14:25:22,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:25:22" (1/1) ... [2021-03-25 14:25:22,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:25:22" (1/1) ... [2021-03-25 14:25:22,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:25:22,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:25:22,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:25:22,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:25:22,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:25:22" (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 14:25:22,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:25:22,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:25:22,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:25:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:25:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:25:22,771 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:25:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:25:22,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:25:22,772 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:25:22,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:25:22,773 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 14:25:22,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 14:25:22,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:25:22,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:25:22,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:25:22,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:25:22,775 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 14:25:24,829 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:25:24,829 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:25:24,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:25:24 BoogieIcfgContainer [2021-03-25 14:25:24,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:25:24,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:25:24,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:25:24,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:25:24,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:25:21" (1/3) ... [2021-03-25 14:25:24,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@973443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:25:24, skipping insertion in model container [2021-03-25 14:25:24,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:25:22" (2/3) ... [2021-03-25 14:25:24,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@973443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:25:24, skipping insertion in model container [2021-03-25 14:25:24,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:25:24" (3/3) ... [2021-03-25 14:25:24,839 INFO L111 eAbstractionObserver]: Analyzing ICFG mix026_power.oepc.i [2021-03-25 14:25:24,845 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:25:24,848 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:25:24,849 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:25:24,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,894 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,894 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,895 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,895 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,895 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,895 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,896 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,896 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,901 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,901 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,901 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,901 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,904 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,904 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,904 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,905 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,905 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,909 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,909 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,909 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,909 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,909 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,909 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,909 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,909 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,909 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,910 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,910 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,911 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,913 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,919 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,920 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,920 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,920 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,920 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,920 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,920 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,920 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,920 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,920 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,920 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,921 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,921 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,921 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,921 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,921 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,921 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,921 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,921 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,921 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,921 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,922 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,922 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,922 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,922 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,922 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,922 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,922 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,922 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,922 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,925 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,925 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,925 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,925 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,925 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,927 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,927 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,927 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,927 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,927 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,927 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,927 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,927 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,927 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,928 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,928 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,928 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,928 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,928 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,928 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,928 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,928 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,928 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,928 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,928 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,930 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,930 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,930 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,930 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,930 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,935 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,935 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,935 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,937 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,937 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,939 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,939 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,949 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,951 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,951 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,951 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,951 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,952 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,956 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,956 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:25:24,960 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:25:24,976 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 14:25:25,004 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:25:25,004 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:25:25,005 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:25:25,005 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:25:25,005 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:25:25,005 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:25:25,005 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:25:25,005 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:25:25,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 118 transitions, 256 flow [2021-03-25 14:25:25,062 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2021-03-25 14:25:25,063 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:25:25,067 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 87 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2021-03-25 14:25:25,067 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 118 transitions, 256 flow [2021-03-25 14:25:25,071 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 114 transitions, 240 flow [2021-03-25 14:25:25,081 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:25,091 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 114 transitions, 240 flow [2021-03-25 14:25:25,093 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 114 transitions, 240 flow [2021-03-25 14:25:25,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 114 transitions, 240 flow [2021-03-25 14:25:25,114 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2021-03-25 14:25:25,115 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:25:25,115 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 88 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2021-03-25 14:25:25,119 INFO L142 LiptonReduction]: Number of co-enabled transitions 2774 [2021-03-25 14:25:26,712 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:25:27,171 WARN L205 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:25:27,285 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:25:28,748 INFO L154 LiptonReduction]: Checked pairs total: 4931 [2021-03-25 14:25:28,749 INFO L156 LiptonReduction]: Total number of compositions: 72 [2021-03-25 14:25:28,751 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3680 [2021-03-25 14:25:28,759 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-25 14:25:28,759 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:25:28,759 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:25:28,760 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:25:28,761 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:25:28,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:25:28,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1169704059, now seen corresponding path program 1 times [2021-03-25 14:25:28,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:25:28,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904340293] [2021-03-25 14:25:28,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:25:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:25:28,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:28,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:25:28,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:28,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:28,995 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 14:25:28,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904340293] [2021-03-25 14:25:28,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:25:28,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:25:28,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572370581] [2021-03-25 14:25:29,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:25:29,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:25:29,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:25:29,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:25:29,019 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 190 [2021-03-25 14:25:29,025 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 14:25:29,025 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:25:29,025 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 190 [2021-03-25 14:25:29,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:25:29,178 INFO L129 PetriNetUnfolder]: 133/370 cut-off events. [2021-03-25 14:25:29,178 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:25:29,182 INFO L84 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 370 events. 133/370 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2058 event pairs, 110 based on Foata normal form. 32/373 useless extension candidates. Maximal degree in co-relation 567. Up to 153 conditions per place. [2021-03-25 14:25:29,186 INFO L132 encePairwiseOnDemand]: 186/190 looper letters, 11 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2021-03-25 14:25:29,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 50 transitions, 138 flow [2021-03-25 14:25:29,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:25:29,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:25:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2021-03-25 14:25:29,205 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9175438596491228 [2021-03-25 14:25:29,206 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 523 transitions. [2021-03-25 14:25:29,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 523 transitions. [2021-03-25 14:25:29,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:25:29,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 523 transitions. [2021-03-25 14:25:29,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 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 14:25:29,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 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 14:25:29,228 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 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 14:25:29,230 INFO L185 Difference]: Start difference. First operand has 60 places, 48 transitions, 108 flow. Second operand 3 states and 523 transitions. [2021-03-25 14:25:29,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 50 transitions, 138 flow [2021-03-25 14:25:29,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 50 transitions, 134 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:25:29,238 INFO L241 Difference]: Finished difference. Result has 56 places, 45 transitions, 102 flow [2021-03-25 14:25:29,240 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, 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 14:25:29,241 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2021-03-25 14:25:29,241 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:29,241 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 45 transitions, 102 flow [2021-03-25 14:25:29,242 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 45 transitions, 102 flow [2021-03-25 14:25:29,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 45 transitions, 102 flow [2021-03-25 14:25:29,249 INFO L129 PetriNetUnfolder]: 0/45 cut-off events. [2021-03-25 14:25:29,250 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:25:29,250 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 4. Compared 54 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:25:29,251 INFO L142 LiptonReduction]: Number of co-enabled transitions 618 [2021-03-25 14:25:30,399 INFO L154 LiptonReduction]: Checked pairs total: 2547 [2021-03-25 14:25:30,399 INFO L156 LiptonReduction]: Total number of compositions: 13 [2021-03-25 14:25:30,400 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1159 [2021-03-25 14:25:30,401 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 78 flow [2021-03-25 14:25:30,401 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 14:25:30,401 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:25:30,401 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 14:25:30,402 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:25:30,402 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:25:30,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:25:30,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1873331778, now seen corresponding path program 1 times [2021-03-25 14:25:30,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:25:30,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911721950] [2021-03-25 14:25:30,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:25:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:25:30,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:30,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:25:30,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:30,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:30,549 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:25:30,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:25:30,562 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:25:30,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:25:30,567 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 14:25:30,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911721950] [2021-03-25 14:25:30,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:25:30,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:25:30,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138398466] [2021-03-25 14:25:30,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:25:30,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:25:30,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:25:30,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:25:30,571 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 203 [2021-03-25 14:25:30,572 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 0 states have call successors, (0), 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 14:25:30,572 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:25:30,572 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 203 [2021-03-25 14:25:30,572 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:25:30,686 INFO L129 PetriNetUnfolder]: 177/428 cut-off events. [2021-03-25 14:25:30,686 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:25:30,688 INFO L84 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 428 events. 177/428 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2431 event pairs, 25 based on Foata normal form. 0/397 useless extension candidates. Maximal degree in co-relation 719. Up to 97 conditions per place. [2021-03-25 14:25:30,689 INFO L132 encePairwiseOnDemand]: 195/203 looper letters, 9 selfloop transitions, 6 changer transitions 17/54 dead transitions. [2021-03-25 14:25:30,689 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 182 flow [2021-03-25 14:25:30,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:25:30,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:25:30,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1181 transitions. [2021-03-25 14:25:30,693 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8311048557353976 [2021-03-25 14:25:30,693 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1181 transitions. [2021-03-25 14:25:30,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1181 transitions. [2021-03-25 14:25:30,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:25:30,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1181 transitions. [2021-03-25 14:25:30,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 168.71428571428572) internal successors, (1181), 7 states have internal predecessors, (1181), 0 states have call successors, (0), 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 14:25:30,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 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 14:25:30,701 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 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 14:25:30,701 INFO L185 Difference]: Start difference. First operand has 44 places, 33 transitions, 78 flow. Second operand 7 states and 1181 transitions. [2021-03-25 14:25:30,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 182 flow [2021-03-25 14:25:30,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:25:30,703 INFO L241 Difference]: Finished difference. Result has 53 places, 35 transitions, 122 flow [2021-03-25 14:25:30,703 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=122, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2021-03-25 14:25:30,704 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2021-03-25 14:25:30,704 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:30,704 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 35 transitions, 122 flow [2021-03-25 14:25:30,705 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 35 transitions, 122 flow [2021-03-25 14:25:30,705 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 35 transitions, 122 flow [2021-03-25 14:25:30,733 INFO L129 PetriNetUnfolder]: 62/206 cut-off events. [2021-03-25 14:25:30,733 INFO L130 PetriNetUnfolder]: For 70/96 co-relation queries the response was YES. [2021-03-25 14:25:30,734 INFO L84 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 206 events. 62/206 cut-off events. For 70/96 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1053 event pairs, 34 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 430. Up to 93 conditions per place. [2021-03-25 14:25:30,736 INFO L142 LiptonReduction]: Number of co-enabled transitions 506 [2021-03-25 14:25:31,426 WARN L205 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 14:25:31,612 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 14:25:31,952 WARN L205 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 14:25:32,106 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 14:25:32,113 INFO L154 LiptonReduction]: Checked pairs total: 1215 [2021-03-25 14:25:32,113 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:25:32,114 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1410 [2021-03-25 14:25:32,114 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 118 flow [2021-03-25 14:25:32,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 0 states have call successors, (0), 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 14:25:32,115 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:25:32,115 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:25:32,115 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:25:32,116 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:25:32,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:25:32,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1109141042, now seen corresponding path program 1 times [2021-03-25 14:25:32,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:25:32,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730742225] [2021-03-25 14:25:32,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:25:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:25:32,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:32,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:32,178 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:25:32,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:25:32,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:32,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:25:32,186 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 14:25:32,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730742225] [2021-03-25 14:25:32,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:25:32,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:25:32,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180536140] [2021-03-25 14:25:32,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:25:32,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:25:32,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:25:32,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:25:32,189 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 205 [2021-03-25 14:25:32,190 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 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 14:25:32,190 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:25:32,190 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 205 [2021-03-25 14:25:32,190 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:25:32,383 INFO L129 PetriNetUnfolder]: 643/1189 cut-off events. [2021-03-25 14:25:32,383 INFO L130 PetriNetUnfolder]: For 135/161 co-relation queries the response was YES. [2021-03-25 14:25:32,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2514 conditions, 1189 events. 643/1189 cut-off events. For 135/161 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 8201 event pairs, 314 based on Foata normal form. 72/1019 useless extension candidates. Maximal degree in co-relation 2500. Up to 793 conditions per place. [2021-03-25 14:25:32,397 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 12 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2021-03-25 14:25:32,397 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 190 flow [2021-03-25 14:25:32,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:25:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:25:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 884 transitions. [2021-03-25 14:25:32,400 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8624390243902439 [2021-03-25 14:25:32,400 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 884 transitions. [2021-03-25 14:25:32,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 884 transitions. [2021-03-25 14:25:32,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:25:32,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 884 transitions. [2021-03-25 14:25:32,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:32,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 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 14:25:32,406 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 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 14:25:32,406 INFO L185 Difference]: Start difference. First operand has 46 places, 33 transitions, 118 flow. Second operand 5 states and 884 transitions. [2021-03-25 14:25:32,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 190 flow [2021-03-25 14:25:32,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 180 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-25 14:25:32,411 INFO L241 Difference]: Finished difference. Result has 50 places, 42 transitions, 183 flow [2021-03-25 14:25:32,412 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2021-03-25 14:25:32,412 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -10 predicate places. [2021-03-25 14:25:32,412 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:32,412 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 42 transitions, 183 flow [2021-03-25 14:25:32,413 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 183 flow [2021-03-25 14:25:32,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 183 flow [2021-03-25 14:25:32,568 INFO L129 PetriNetUnfolder]: 485/954 cut-off events. [2021-03-25 14:25:32,568 INFO L130 PetriNetUnfolder]: For 490/754 co-relation queries the response was YES. [2021-03-25 14:25:32,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2603 conditions, 954 events. 485/954 cut-off events. For 490/754 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 6531 event pairs, 226 based on Foata normal form. 3/821 useless extension candidates. Maximal degree in co-relation 2589. Up to 634 conditions per place. [2021-03-25 14:25:32,585 INFO L142 LiptonReduction]: Number of co-enabled transitions 740 [2021-03-25 14:25:32,875 INFO L154 LiptonReduction]: Checked pairs total: 850 [2021-03-25 14:25:32,875 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:25:32,875 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 463 [2021-03-25 14:25:32,878 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 177 flow [2021-03-25 14:25:32,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 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 14:25:32,879 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:25:32,879 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:25:32,879 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:25:32,879 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:25:32,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:25:32,879 INFO L82 PathProgramCache]: Analyzing trace with hash 756030734, now seen corresponding path program 1 times [2021-03-25 14:25:32,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:25:32,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186142994] [2021-03-25 14:25:32,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:25:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:25:33,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:33,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:25:33,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:33,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:33,007 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:25:33,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:25:33,022 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 14:25:33,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186142994] [2021-03-25 14:25:33,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:25:33,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:25:33,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699875299] [2021-03-25 14:25:33,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:25:33,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:25:33,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:25:33,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:25:33,026 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 205 [2021-03-25 14:25:33,027 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:33,027 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:25:33,027 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 205 [2021-03-25 14:25:33,027 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:25:33,191 INFO L129 PetriNetUnfolder]: 587/1157 cut-off events. [2021-03-25 14:25:33,191 INFO L130 PetriNetUnfolder]: For 957/1353 co-relation queries the response was YES. [2021-03-25 14:25:33,198 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3331 conditions, 1157 events. 587/1157 cut-off events. For 957/1353 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 8152 event pairs, 294 based on Foata normal form. 48/1076 useless extension candidates. Maximal degree in co-relation 3315. Up to 711 conditions per place. [2021-03-25 14:25:33,205 INFO L132 encePairwiseOnDemand]: 199/205 looper letters, 13 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2021-03-25 14:25:33,206 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 228 flow [2021-03-25 14:25:33,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:25:33,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:25:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 694 transitions. [2021-03-25 14:25:33,208 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8463414634146341 [2021-03-25 14:25:33,208 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 694 transitions. [2021-03-25 14:25:33,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 694 transitions. [2021-03-25 14:25:33,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:25:33,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 694 transitions. [2021-03-25 14:25:33,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 173.5) internal successors, (694), 4 states have internal predecessors, (694), 0 states have call successors, (0), 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 14:25:33,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 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 14:25:33,212 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 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 14:25:33,213 INFO L185 Difference]: Start difference. First operand has 50 places, 41 transitions, 177 flow. Second operand 4 states and 694 transitions. [2021-03-25 14:25:33,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 228 flow [2021-03-25 14:25:33,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 221 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:25:33,222 INFO L241 Difference]: Finished difference. Result has 51 places, 42 transitions, 195 flow [2021-03-25 14:25:33,222 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2021-03-25 14:25:33,223 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2021-03-25 14:25:33,223 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:33,223 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 195 flow [2021-03-25 14:25:33,223 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 42 transitions, 195 flow [2021-03-25 14:25:33,223 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 195 flow [2021-03-25 14:25:33,318 INFO L129 PetriNetUnfolder]: 562/1105 cut-off events. [2021-03-25 14:25:33,318 INFO L130 PetriNetUnfolder]: For 646/815 co-relation queries the response was YES. [2021-03-25 14:25:33,323 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2960 conditions, 1105 events. 562/1105 cut-off events. For 646/815 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 7667 event pairs, 302 based on Foata normal form. 0/971 useless extension candidates. Maximal degree in co-relation 2944. Up to 738 conditions per place. [2021-03-25 14:25:33,336 INFO L142 LiptonReduction]: Number of co-enabled transitions 676 [2021-03-25 14:25:33,545 INFO L154 LiptonReduction]: Checked pairs total: 732 [2021-03-25 14:25:33,546 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:25:33,546 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 323 [2021-03-25 14:25:33,546 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 201 flow [2021-03-25 14:25:33,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:33,547 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:25:33,547 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:25:33,548 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:25:33,548 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:25:33,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:25:33,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1929780815, now seen corresponding path program 1 times [2021-03-25 14:25:33,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:25:33,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445427982] [2021-03-25 14:25:33,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:25:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:25:33,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:33,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:33,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:33,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:33,650 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:25:33,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:25:33,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:33,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:25:33,659 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 14:25:33,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445427982] [2021-03-25 14:25:33,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:25:33,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:25:33,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120267261] [2021-03-25 14:25:33,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:25:33,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:25:33,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:25:33,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:25:33,662 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 207 [2021-03-25 14:25:33,664 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 201 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 14:25:33,664 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:25:33,664 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 207 [2021-03-25 14:25:33,664 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:25:33,881 INFO L129 PetriNetUnfolder]: 624/1227 cut-off events. [2021-03-25 14:25:33,881 INFO L130 PetriNetUnfolder]: For 1000/1959 co-relation queries the response was YES. [2021-03-25 14:25:33,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4189 conditions, 1227 events. 624/1227 cut-off events. For 1000/1959 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 8537 event pairs, 83 based on Foata normal form. 181/1289 useless extension candidates. Maximal degree in co-relation 4171. Up to 848 conditions per place. [2021-03-25 14:25:33,895 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 13 selfloop transitions, 14 changer transitions 0/57 dead transitions. [2021-03-25 14:25:33,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 57 transitions, 335 flow [2021-03-25 14:25:33,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:25:33,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:25:33,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1073 transitions. [2021-03-25 14:25:33,898 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8639291465378421 [2021-03-25 14:25:33,898 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1073 transitions. [2021-03-25 14:25:33,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1073 transitions. [2021-03-25 14:25:33,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:25:33,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1073 transitions. [2021-03-25 14:25:33,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 178.83333333333334) internal successors, (1073), 6 states have internal predecessors, (1073), 0 states have call successors, (0), 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 14:25:33,904 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 14:25:33,904 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 14:25:33,904 INFO L185 Difference]: Start difference. First operand has 51 places, 42 transitions, 201 flow. Second operand 6 states and 1073 transitions. [2021-03-25 14:25:33,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 57 transitions, 335 flow [2021-03-25 14:25:33,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 57 transitions, 329 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-03-25 14:25:33,908 INFO L241 Difference]: Finished difference. Result has 59 places, 51 transitions, 315 flow [2021-03-25 14:25:33,909 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=315, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2021-03-25 14:25:33,909 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2021-03-25 14:25:33,909 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:33,909 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 51 transitions, 315 flow [2021-03-25 14:25:33,910 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 51 transitions, 315 flow [2021-03-25 14:25:33,910 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 51 transitions, 315 flow [2021-03-25 14:25:34,000 INFO L129 PetriNetUnfolder]: 421/922 cut-off events. [2021-03-25 14:25:34,000 INFO L130 PetriNetUnfolder]: For 1839/2327 co-relation queries the response was YES. [2021-03-25 14:25:34,006 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3818 conditions, 922 events. 421/922 cut-off events. For 1839/2327 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 6521 event pairs, 82 based on Foata normal form. 22/881 useless extension candidates. Maximal degree in co-relation 3797. Up to 648 conditions per place. [2021-03-25 14:25:34,018 INFO L142 LiptonReduction]: Number of co-enabled transitions 932 [2021-03-25 14:25:34,385 INFO L154 LiptonReduction]: Checked pairs total: 1023 [2021-03-25 14:25:34,385 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:25:34,385 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 476 [2021-03-25 14:25:34,386 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 307 flow [2021-03-25 14:25:34,387 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 14:25:34,387 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:25:34,387 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:25:34,387 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:25:34,387 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:25:34,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:25:34,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1708921396, now seen corresponding path program 1 times [2021-03-25 14:25:34,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:25:34,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255411117] [2021-03-25 14:25:34,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:25:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:25:34,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:34,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:25:34,454 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-25 14:25:34,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 14:25:34,469 INFO L142 QuantifierPusher]: treesize reduction 24, result has 63.6 percent of original size [2021-03-25 14:25:34,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 14:25:34,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:34,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:25:34,490 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 14:25:34,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255411117] [2021-03-25 14:25:34,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:25:34,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:25:34,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479193819] [2021-03-25 14:25:34,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:25:34,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:25:34,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:25:34,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:25:34,492 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 207 [2021-03-25 14:25:34,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 307 flow. Second operand has 5 states, 5 states have (on average 166.4) internal successors, (832), 5 states have internal predecessors, (832), 0 states have call successors, (0), 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 14:25:34,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:25:34,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 207 [2021-03-25 14:25:34,494 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:25:34,794 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L826-->L842: Formula: (let ((.cse19 (= (mod v_~a$r_buff1_thd4~0_185 256) 0)) (.cse31 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse27 (= (mod v_~a$r_buff0_thd4~0_236 256) 0))) (let ((.cse0 (= (mod v_~weak$$choice2~0_86 256) 0)) (.cse3 (and .cse31 .cse27)) (.cse12 (not .cse19)) (.cse6 (not .cse27)) (.cse2 (= (mod v_~a$w_buff0_used~0_484 256) 0)) (.cse16 (= (mod v_~a$w_buff0_used~0_483 256) 0)) (.cse20 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (let ((.cse18 (not .cse20)) (.cse25 (or .cse16 .cse27)) (.cse14 (not .cse16)) (.cse4 (and .cse19 .cse27)) (.cse7 (or .cse2 .cse27)) (.cse5 (not .cse2)) (.cse8 (or (not .cse31) .cse6)) (.cse9 (or .cse12 .cse6)) (.cse21 (or (and .cse27 .cse19) .cse2 .cse3)) (.cse10 (not .cse0))) (and (let ((.cse1 (= |v_P3_#t~ite33_57| |v_P3Thread1of1ForFork3_#t~ite33_1|))) (or (and .cse0 (= |v_P3_#t~ite34_45| v_~a$w_buff0_used~0_483) (or (and .cse1 (= |v_P3_#t~ite34_45| v_~a$w_buff0_used~0_484) (or .cse2 .cse3 .cse4)) (and .cse5 (or (and .cse6 (= |v_P3_#t~ite33_57| 0) .cse5) (and (= |v_P3_#t~ite33_57| v_~a$w_buff0_used~0_484) .cse7)) .cse8 .cse9 (= |v_P3_#t~ite33_57| |v_P3_#t~ite34_45|)))) (and (= |v_P3_#t~ite34_45| |v_P3Thread1of1ForFork3_#t~ite34_1|) .cse1 .cse10 (= v_~a$w_buff0_used~0_484 v_~a$w_buff0_used~0_483)))) (let ((.cse11 (= |v_P3_#t~ite42_57| |v_P3Thread1of1ForFork3_#t~ite42_1|))) (or (and .cse11 (= v_~a$r_buff1_thd4~0_185 v_~a$r_buff1_thd4~0_184) .cse10 (= |v_P3_#t~ite43_45| |v_P3Thread1of1ForFork3_#t~ite43_1|)) (and .cse0 (= |v_P3_#t~ite43_45| v_~a$r_buff1_thd4~0_184) (let ((.cse17 (= (mod v_~a$r_buff0_thd4~0_235 256) 0))) (or (let ((.cse13 (not .cse17))) (and (or .cse12 .cse13) .cse14 (let ((.cse15 (= |v_P3_#t~ite42_57| 0))) (or (and .cse14 .cse13 .cse15) (and (or .cse16 .cse17) .cse15))) (= |v_P3_#t~ite42_57| |v_P3_#t~ite43_45|) (or .cse13 .cse18))) (and .cse11 (= |v_P3_#t~ite43_45| v_~a$r_buff1_thd4~0_185) (or (and .cse17 .cse19) .cse16 (and .cse20 .cse17)))))))) (= v_~a~0_180 v_~a$mem_tmp~0_22) (or (and (= |v_P3_#t~ite25_45| v_~__unbuffered_p3_EBX~0_14) .cse5 (or (and (= |v_P3_#t~ite25_45| v_~a$w_buff0~0_104) .cse6 .cse5) (and (= |v_P3_#t~ite25_45| v_~a$w_buff1~0_113) .cse7)) .cse8 .cse9) (and (= |v_P3_#t~ite25_45| |v_P3Thread1of1ForFork3_#t~ite25_1|) (= v_~a~0_180 v_~__unbuffered_p3_EBX~0_14) .cse21)) (= |v_P3Thread1of1ForFork3_#t~nondet23_1| v_~weak$$choice0~0_13) (= |v_P3Thread1of1ForFork3_#t~nondet24_1| v_~weak$$choice2~0_86) (let ((.cse22 (= |v_P3_#t~ite27_59| |v_P3Thread1of1ForFork3_#t~ite27_1|))) (or (and .cse22 .cse10 (= |v_P3_#t~ite28_53| |v_P3Thread1of1ForFork3_#t~ite28_1|) (= v_~a$w_buff0~0_104 v_~a$w_buff0~0_103)) (and (or (and .cse22 (= |v_P3_#t~ite28_53| v_~a$w_buff0~0_104) .cse21) (and .cse5 (let ((.cse23 (= |v_P3_#t~ite27_59| v_~a$w_buff0~0_104))) (or (and .cse6 .cse5 .cse23) (and .cse23 .cse7))) .cse8 (= |v_P3_#t~ite27_59| |v_P3_#t~ite28_53|) .cse9)) .cse0 (= |v_P3_#t~ite28_53| v_~a$w_buff0~0_103)))) (let ((.cse26 (= |v_P3_#t~ite36_51| |v_P3Thread1of1ForFork3_#t~ite36_1|))) (or (and .cse0 (= |v_P3_#t~ite37_45| v_~a$w_buff1_used~0_371) (or (and .cse14 (let ((.cse24 (= |v_P3_#t~ite36_51| 0))) (or (and .cse24 .cse14 .cse6) (and .cse24 .cse25))) .cse8 .cse9 (= |v_P3_#t~ite36_51| |v_P3_#t~ite37_45|)) (and .cse26 (= |v_P3_#t~ite37_45| v_~a$w_buff1_used~0_372) (or .cse16 .cse3 .cse4)))) (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse10 .cse26 (= |v_P3_#t~ite37_45| |v_P3Thread1of1ForFork3_#t~ite37_1|)))) (= v_~a$flush_delayed~0_38 0) (let ((.cse28 (= |v_P3_#t~ite39_63| |v_P3Thread1of1ForFork3_#t~ite39_1|))) (or (and .cse0 (= |v_P3_#t~ite40_51| v_~a$r_buff0_thd4~0_235) (or (and (or .cse6 .cse18) (or (and .cse14 (= |v_P3_#t~ite39_63| 0) .cse6) (and .cse25 (= |v_P3_#t~ite39_63| v_~a$r_buff0_thd4~0_236))) .cse14 (= |v_P3_#t~ite39_63| |v_P3_#t~ite40_51|) .cse9) (and (or .cse16 (and .cse20 .cse27) .cse4) (= |v_P3_#t~ite40_51| v_~a$r_buff0_thd4~0_236) .cse28))) (and (= v_~a$r_buff0_thd4~0_236 v_~a$r_buff0_thd4~0_235) .cse10 (= |v_P3_#t~ite40_51| |v_P3Thread1of1ForFork3_#t~ite40_1|) .cse28))) (let ((.cse30 (= |v_P3Thread1of1ForFork3_#t~ite30_1| |v_P3_#t~ite30_45|))) (or (and .cse0 (= |v_P3_#t~ite31_39| v_~a$w_buff1~0_112) (or (and (let ((.cse29 (= |v_P3_#t~ite30_45| v_~a$w_buff1~0_113))) (or (and .cse29 .cse7) (and .cse29 .cse6 .cse5))) .cse5 (= |v_P3_#t~ite30_45| |v_P3_#t~ite31_39|) .cse8 .cse9) (and (= |v_P3_#t~ite31_39| v_~a$w_buff1~0_113) .cse30 .cse21))) (and .cse10 .cse30 (= v_~a$w_buff1~0_113 v_~a$w_buff1~0_112) (= |v_P3Thread1of1ForFork3_#t~ite31_1| |v_P3_#t~ite31_39|)))) (or (and .cse10 (= v_~a~0_178 v_~a$mem_tmp~0_22)) (and .cse0 (= v_~a~0_178 v_~__unbuffered_p3_EBX~0_14))))))) InVars {P3Thread1of1ForFork3_#t~nondet23=|v_P3Thread1of1ForFork3_#t~nondet23_1|, P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_1|, P3Thread1of1ForFork3_#t~nondet24=|v_P3Thread1of1ForFork3_#t~nondet24_1|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_1|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_185, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_484, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_236, ~a~0=v_~a~0_180, P3Thread1of1ForFork3_#t~ite39=|v_P3Thread1of1ForFork3_#t~ite39_1|, P3Thread1of1ForFork3_#t~ite28=|v_P3Thread1of1ForFork3_#t~ite28_1|, ~a$w_buff1~0=v_~a$w_buff1~0_113, ~a$w_buff0~0=v_~a$w_buff0~0_104, P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_1|, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_1|, P3Thread1of1ForFork3_#t~ite36=|v_P3Thread1of1ForFork3_#t~ite36_1|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_1|, P3Thread1of1ForFork3_#t~ite34=|v_P3Thread1of1ForFork3_#t~ite34_1|, P3Thread1of1ForFork3_#t~ite33=|v_P3Thread1of1ForFork3_#t~ite33_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P3Thread1of1ForFork3_#t~ite31=|v_P3Thread1of1ForFork3_#t~ite31_1|, P3Thread1of1ForFork3_#t~ite30=|v_P3Thread1of1ForFork3_#t~ite30_1|, P3Thread1of1ForFork3_#t~ite40=|v_P3Thread1of1ForFork3_#t~ite40_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_184, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_235, ~a~0=v_~a~0_178, ~a$mem_tmp~0=v_~a$mem_tmp~0_22, ~a$w_buff1~0=v_~a$w_buff1~0_112, P3Thread1of1ForFork3_#t~ite39=|v_P3Thread1of1ForFork3_#t~ite39_2|, P3Thread1of1ForFork3_#t~ite38=|v_P3Thread1of1ForFork3_#t~ite38_1|, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_2|, P3Thread1of1ForFork3_#t~ite36=|v_P3Thread1of1ForFork3_#t~ite36_2|, P3Thread1of1ForFork3_#t~ite35=|v_P3Thread1of1ForFork3_#t~ite35_1|, P3Thread1of1ForFork3_#t~ite34=|v_P3Thread1of1ForFork3_#t~ite34_2|, P3Thread1of1ForFork3_#t~ite33=|v_P3Thread1of1ForFork3_#t~ite33_2|, P3Thread1of1ForFork3_#t~ite32=|v_P3Thread1of1ForFork3_#t~ite32_1|, P3Thread1of1ForFork3_#t~ite31=|v_P3Thread1of1ForFork3_#t~ite31_2|, P3Thread1of1ForFork3_#t~ite30=|v_P3Thread1of1ForFork3_#t~ite30_2|, P3Thread1of1ForFork3_#t~nondet23=|v_P3Thread1of1ForFork3_#t~nondet23_2|, P3Thread1of1ForFork3_#t~nondet24=|v_P3Thread1of1ForFork3_#t~nondet24_2|, P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_2|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_2|, P3Thread1of1ForFork3_#t~ite44=|v_P3Thread1of1ForFork3_#t~ite44_1|, P3Thread1of1ForFork3_#t~ite45=|v_P3Thread1of1ForFork3_#t~ite45_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_483, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_13, P3Thread1of1ForFork3_#t~ite29=|v_P3Thread1of1ForFork3_#t~ite29_1|, P3Thread1of1ForFork3_#t~ite28=|v_P3Thread1of1ForFork3_#t~ite28_2|, ~a$flush_delayed~0=v_~a$flush_delayed~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_103, P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_2|, P3Thread1of1ForFork3_#t~ite26=|v_P3Thread1of1ForFork3_#t~ite26_1|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_2|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, ~weak$$choice2~0=v_~weak$$choice2~0_86, P3Thread1of1ForFork3_#t~ite41=|v_P3Thread1of1ForFork3_#t~ite41_1|, P3Thread1of1ForFork3_#t~ite40=|v_P3Thread1of1ForFork3_#t~ite40_2|} AuxVars[|v_P3_#t~ite28_53|, |v_P3_#t~ite40_51|, |v_P3_#t~ite33_57|, |v_P3_#t~ite25_45|, |v_P3_#t~ite27_59|, |v_P3_#t~ite30_45|, |v_P3_#t~ite31_39|, |v_P3_#t~ite39_63|, |v_P3_#t~ite42_57|, |v_P3_#t~ite34_45|, |v_P3_#t~ite43_45|, |v_P3_#t~ite37_45|, |v_P3_#t~ite36_51|] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~a$w_buff1~0, P3Thread1of1ForFork3_#t~ite39, P3Thread1of1ForFork3_#t~ite38, P3Thread1of1ForFork3_#t~ite37, P3Thread1of1ForFork3_#t~ite36, P3Thread1of1ForFork3_#t~ite35, P3Thread1of1ForFork3_#t~ite34, P3Thread1of1ForFork3_#t~ite33, P3Thread1of1ForFork3_#t~ite32, P3Thread1of1ForFork3_#t~ite31, P3Thread1of1ForFork3_#t~ite30, P3Thread1of1ForFork3_#t~nondet23, P3Thread1of1ForFork3_#t~nondet24, P3Thread1of1ForFork3_#t~ite42, P3Thread1of1ForFork3_#t~ite43, P3Thread1of1ForFork3_#t~ite44, P3Thread1of1ForFork3_#t~ite45, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~ite29, P3Thread1of1ForFork3_#t~ite28, ~a$flush_delayed~0, ~a$w_buff0~0, P3Thread1of1ForFork3_#t~ite27, P3Thread1of1ForFork3_#t~ite26, P3Thread1of1ForFork3_#t~ite25, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork3_#t~ite41, P3Thread1of1ForFork3_#t~ite40][36], [P2Thread1of1ForFork2InUse, Black: 157#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), P1Thread1of1ForFork1InUse, 164#(= ~z~0 1), P3Thread1of1ForFork3InUse, Black: 165#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~z~0))), 137#true, 107#L813true, 171#(= ~__unbuffered_cnt~0 0), Black: 172#(<= ~__unbuffered_cnt~0 1), 49#L842true, Black: 173#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 175#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), Black: 139#(= ~__unbuffered_p3_EAX~0 0), 180#true, Black: 140#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~z~0))), 24#L766true, 56#L793true, 154#(= ~__unbuffered_cnt~0 0), 59#L873-1true, P0Thread1of1ForFork0InUse]) [2021-03-25 14:25:34,795 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 14:25:34,795 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 14:25:34,795 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 14:25:34,795 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:25:35,019 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L826-->L842: Formula: (let ((.cse19 (= (mod v_~a$r_buff1_thd4~0_185 256) 0)) (.cse31 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse27 (= (mod v_~a$r_buff0_thd4~0_236 256) 0))) (let ((.cse0 (= (mod v_~weak$$choice2~0_86 256) 0)) (.cse3 (and .cse31 .cse27)) (.cse12 (not .cse19)) (.cse6 (not .cse27)) (.cse2 (= (mod v_~a$w_buff0_used~0_484 256) 0)) (.cse16 (= (mod v_~a$w_buff0_used~0_483 256) 0)) (.cse20 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (let ((.cse18 (not .cse20)) (.cse25 (or .cse16 .cse27)) (.cse14 (not .cse16)) (.cse4 (and .cse19 .cse27)) (.cse7 (or .cse2 .cse27)) (.cse5 (not .cse2)) (.cse8 (or (not .cse31) .cse6)) (.cse9 (or .cse12 .cse6)) (.cse21 (or (and .cse27 .cse19) .cse2 .cse3)) (.cse10 (not .cse0))) (and (let ((.cse1 (= |v_P3_#t~ite33_57| |v_P3Thread1of1ForFork3_#t~ite33_1|))) (or (and .cse0 (= |v_P3_#t~ite34_45| v_~a$w_buff0_used~0_483) (or (and .cse1 (= |v_P3_#t~ite34_45| v_~a$w_buff0_used~0_484) (or .cse2 .cse3 .cse4)) (and .cse5 (or (and .cse6 (= |v_P3_#t~ite33_57| 0) .cse5) (and (= |v_P3_#t~ite33_57| v_~a$w_buff0_used~0_484) .cse7)) .cse8 .cse9 (= |v_P3_#t~ite33_57| |v_P3_#t~ite34_45|)))) (and (= |v_P3_#t~ite34_45| |v_P3Thread1of1ForFork3_#t~ite34_1|) .cse1 .cse10 (= v_~a$w_buff0_used~0_484 v_~a$w_buff0_used~0_483)))) (let ((.cse11 (= |v_P3_#t~ite42_57| |v_P3Thread1of1ForFork3_#t~ite42_1|))) (or (and .cse11 (= v_~a$r_buff1_thd4~0_185 v_~a$r_buff1_thd4~0_184) .cse10 (= |v_P3_#t~ite43_45| |v_P3Thread1of1ForFork3_#t~ite43_1|)) (and .cse0 (= |v_P3_#t~ite43_45| v_~a$r_buff1_thd4~0_184) (let ((.cse17 (= (mod v_~a$r_buff0_thd4~0_235 256) 0))) (or (let ((.cse13 (not .cse17))) (and (or .cse12 .cse13) .cse14 (let ((.cse15 (= |v_P3_#t~ite42_57| 0))) (or (and .cse14 .cse13 .cse15) (and (or .cse16 .cse17) .cse15))) (= |v_P3_#t~ite42_57| |v_P3_#t~ite43_45|) (or .cse13 .cse18))) (and .cse11 (= |v_P3_#t~ite43_45| v_~a$r_buff1_thd4~0_185) (or (and .cse17 .cse19) .cse16 (and .cse20 .cse17)))))))) (= v_~a~0_180 v_~a$mem_tmp~0_22) (or (and (= |v_P3_#t~ite25_45| v_~__unbuffered_p3_EBX~0_14) .cse5 (or (and (= |v_P3_#t~ite25_45| v_~a$w_buff0~0_104) .cse6 .cse5) (and (= |v_P3_#t~ite25_45| v_~a$w_buff1~0_113) .cse7)) .cse8 .cse9) (and (= |v_P3_#t~ite25_45| |v_P3Thread1of1ForFork3_#t~ite25_1|) (= v_~a~0_180 v_~__unbuffered_p3_EBX~0_14) .cse21)) (= |v_P3Thread1of1ForFork3_#t~nondet23_1| v_~weak$$choice0~0_13) (= |v_P3Thread1of1ForFork3_#t~nondet24_1| v_~weak$$choice2~0_86) (let ((.cse22 (= |v_P3_#t~ite27_59| |v_P3Thread1of1ForFork3_#t~ite27_1|))) (or (and .cse22 .cse10 (= |v_P3_#t~ite28_53| |v_P3Thread1of1ForFork3_#t~ite28_1|) (= v_~a$w_buff0~0_104 v_~a$w_buff0~0_103)) (and (or (and .cse22 (= |v_P3_#t~ite28_53| v_~a$w_buff0~0_104) .cse21) (and .cse5 (let ((.cse23 (= |v_P3_#t~ite27_59| v_~a$w_buff0~0_104))) (or (and .cse6 .cse5 .cse23) (and .cse23 .cse7))) .cse8 (= |v_P3_#t~ite27_59| |v_P3_#t~ite28_53|) .cse9)) .cse0 (= |v_P3_#t~ite28_53| v_~a$w_buff0~0_103)))) (let ((.cse26 (= |v_P3_#t~ite36_51| |v_P3Thread1of1ForFork3_#t~ite36_1|))) (or (and .cse0 (= |v_P3_#t~ite37_45| v_~a$w_buff1_used~0_371) (or (and .cse14 (let ((.cse24 (= |v_P3_#t~ite36_51| 0))) (or (and .cse24 .cse14 .cse6) (and .cse24 .cse25))) .cse8 .cse9 (= |v_P3_#t~ite36_51| |v_P3_#t~ite37_45|)) (and .cse26 (= |v_P3_#t~ite37_45| v_~a$w_buff1_used~0_372) (or .cse16 .cse3 .cse4)))) (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse10 .cse26 (= |v_P3_#t~ite37_45| |v_P3Thread1of1ForFork3_#t~ite37_1|)))) (= v_~a$flush_delayed~0_38 0) (let ((.cse28 (= |v_P3_#t~ite39_63| |v_P3Thread1of1ForFork3_#t~ite39_1|))) (or (and .cse0 (= |v_P3_#t~ite40_51| v_~a$r_buff0_thd4~0_235) (or (and (or .cse6 .cse18) (or (and .cse14 (= |v_P3_#t~ite39_63| 0) .cse6) (and .cse25 (= |v_P3_#t~ite39_63| v_~a$r_buff0_thd4~0_236))) .cse14 (= |v_P3_#t~ite39_63| |v_P3_#t~ite40_51|) .cse9) (and (or .cse16 (and .cse20 .cse27) .cse4) (= |v_P3_#t~ite40_51| v_~a$r_buff0_thd4~0_236) .cse28))) (and (= v_~a$r_buff0_thd4~0_236 v_~a$r_buff0_thd4~0_235) .cse10 (= |v_P3_#t~ite40_51| |v_P3Thread1of1ForFork3_#t~ite40_1|) .cse28))) (let ((.cse30 (= |v_P3Thread1of1ForFork3_#t~ite30_1| |v_P3_#t~ite30_45|))) (or (and .cse0 (= |v_P3_#t~ite31_39| v_~a$w_buff1~0_112) (or (and (let ((.cse29 (= |v_P3_#t~ite30_45| v_~a$w_buff1~0_113))) (or (and .cse29 .cse7) (and .cse29 .cse6 .cse5))) .cse5 (= |v_P3_#t~ite30_45| |v_P3_#t~ite31_39|) .cse8 .cse9) (and (= |v_P3_#t~ite31_39| v_~a$w_buff1~0_113) .cse30 .cse21))) (and .cse10 .cse30 (= v_~a$w_buff1~0_113 v_~a$w_buff1~0_112) (= |v_P3Thread1of1ForFork3_#t~ite31_1| |v_P3_#t~ite31_39|)))) (or (and .cse10 (= v_~a~0_178 v_~a$mem_tmp~0_22)) (and .cse0 (= v_~a~0_178 v_~__unbuffered_p3_EBX~0_14))))))) InVars {P3Thread1of1ForFork3_#t~nondet23=|v_P3Thread1of1ForFork3_#t~nondet23_1|, P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_1|, P3Thread1of1ForFork3_#t~nondet24=|v_P3Thread1of1ForFork3_#t~nondet24_1|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_1|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_185, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_484, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_236, ~a~0=v_~a~0_180, P3Thread1of1ForFork3_#t~ite39=|v_P3Thread1of1ForFork3_#t~ite39_1|, P3Thread1of1ForFork3_#t~ite28=|v_P3Thread1of1ForFork3_#t~ite28_1|, ~a$w_buff1~0=v_~a$w_buff1~0_113, ~a$w_buff0~0=v_~a$w_buff0~0_104, P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_1|, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_1|, P3Thread1of1ForFork3_#t~ite36=|v_P3Thread1of1ForFork3_#t~ite36_1|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_1|, P3Thread1of1ForFork3_#t~ite34=|v_P3Thread1of1ForFork3_#t~ite34_1|, P3Thread1of1ForFork3_#t~ite33=|v_P3Thread1of1ForFork3_#t~ite33_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P3Thread1of1ForFork3_#t~ite31=|v_P3Thread1of1ForFork3_#t~ite31_1|, P3Thread1of1ForFork3_#t~ite30=|v_P3Thread1of1ForFork3_#t~ite30_1|, P3Thread1of1ForFork3_#t~ite40=|v_P3Thread1of1ForFork3_#t~ite40_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_184, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_235, ~a~0=v_~a~0_178, ~a$mem_tmp~0=v_~a$mem_tmp~0_22, ~a$w_buff1~0=v_~a$w_buff1~0_112, P3Thread1of1ForFork3_#t~ite39=|v_P3Thread1of1ForFork3_#t~ite39_2|, P3Thread1of1ForFork3_#t~ite38=|v_P3Thread1of1ForFork3_#t~ite38_1|, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_2|, P3Thread1of1ForFork3_#t~ite36=|v_P3Thread1of1ForFork3_#t~ite36_2|, P3Thread1of1ForFork3_#t~ite35=|v_P3Thread1of1ForFork3_#t~ite35_1|, P3Thread1of1ForFork3_#t~ite34=|v_P3Thread1of1ForFork3_#t~ite34_2|, P3Thread1of1ForFork3_#t~ite33=|v_P3Thread1of1ForFork3_#t~ite33_2|, P3Thread1of1ForFork3_#t~ite32=|v_P3Thread1of1ForFork3_#t~ite32_1|, P3Thread1of1ForFork3_#t~ite31=|v_P3Thread1of1ForFork3_#t~ite31_2|, P3Thread1of1ForFork3_#t~ite30=|v_P3Thread1of1ForFork3_#t~ite30_2|, P3Thread1of1ForFork3_#t~nondet23=|v_P3Thread1of1ForFork3_#t~nondet23_2|, P3Thread1of1ForFork3_#t~nondet24=|v_P3Thread1of1ForFork3_#t~nondet24_2|, P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_2|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_2|, P3Thread1of1ForFork3_#t~ite44=|v_P3Thread1of1ForFork3_#t~ite44_1|, P3Thread1of1ForFork3_#t~ite45=|v_P3Thread1of1ForFork3_#t~ite45_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_483, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_13, P3Thread1of1ForFork3_#t~ite29=|v_P3Thread1of1ForFork3_#t~ite29_1|, P3Thread1of1ForFork3_#t~ite28=|v_P3Thread1of1ForFork3_#t~ite28_2|, ~a$flush_delayed~0=v_~a$flush_delayed~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_103, P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_2|, P3Thread1of1ForFork3_#t~ite26=|v_P3Thread1of1ForFork3_#t~ite26_1|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_2|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, ~weak$$choice2~0=v_~weak$$choice2~0_86, P3Thread1of1ForFork3_#t~ite41=|v_P3Thread1of1ForFork3_#t~ite41_1|, P3Thread1of1ForFork3_#t~ite40=|v_P3Thread1of1ForFork3_#t~ite40_2|} AuxVars[|v_P3_#t~ite28_53|, |v_P3_#t~ite40_51|, |v_P3_#t~ite33_57|, |v_P3_#t~ite25_45|, |v_P3_#t~ite27_59|, |v_P3_#t~ite30_45|, |v_P3_#t~ite31_39|, |v_P3_#t~ite39_63|, |v_P3_#t~ite42_57|, |v_P3_#t~ite34_45|, |v_P3_#t~ite43_45|, |v_P3_#t~ite37_45|, |v_P3_#t~ite36_51|] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~a$w_buff1~0, P3Thread1of1ForFork3_#t~ite39, P3Thread1of1ForFork3_#t~ite38, P3Thread1of1ForFork3_#t~ite37, P3Thread1of1ForFork3_#t~ite36, P3Thread1of1ForFork3_#t~ite35, P3Thread1of1ForFork3_#t~ite34, P3Thread1of1ForFork3_#t~ite33, P3Thread1of1ForFork3_#t~ite32, P3Thread1of1ForFork3_#t~ite31, P3Thread1of1ForFork3_#t~ite30, P3Thread1of1ForFork3_#t~nondet23, P3Thread1of1ForFork3_#t~nondet24, P3Thread1of1ForFork3_#t~ite42, P3Thread1of1ForFork3_#t~ite43, P3Thread1of1ForFork3_#t~ite44, P3Thread1of1ForFork3_#t~ite45, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~ite29, P3Thread1of1ForFork3_#t~ite28, ~a$flush_delayed~0, ~a$w_buff0~0, P3Thread1of1ForFork3_#t~ite27, P3Thread1of1ForFork3_#t~ite26, P3Thread1of1ForFork3_#t~ite25, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork3_#t~ite41, P3Thread1of1ForFork3_#t~ite40][36], [P2Thread1of1ForFork2InUse, Black: 157#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), P1Thread1of1ForFork1InUse, P3Thread1of1ForFork3InUse, 164#(= ~z~0 1), Black: 165#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~z~0))), 169#true, 137#true, 49#L842true, Black: 172#(<= ~__unbuffered_cnt~0 1), Black: 173#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 175#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), Black: 139#(= ~__unbuffered_p3_EAX~0 0), 180#true, Black: 140#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~z~0))), 54#P2EXITtrue, 57#L884true, 122#L786true, P0Thread1of1ForFork0InUse, 63#P0EXITtrue, Black: 154#(= ~__unbuffered_cnt~0 0)]) [2021-03-25 14:25:35,019 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-25 14:25:35,019 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 14:25:35,019 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 14:25:35,019 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 14:25:35,028 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L826-->L842: Formula: (let ((.cse19 (= (mod v_~a$r_buff1_thd4~0_185 256) 0)) (.cse31 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse27 (= (mod v_~a$r_buff0_thd4~0_236 256) 0))) (let ((.cse0 (= (mod v_~weak$$choice2~0_86 256) 0)) (.cse3 (and .cse31 .cse27)) (.cse12 (not .cse19)) (.cse6 (not .cse27)) (.cse2 (= (mod v_~a$w_buff0_used~0_484 256) 0)) (.cse16 (= (mod v_~a$w_buff0_used~0_483 256) 0)) (.cse20 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (let ((.cse18 (not .cse20)) (.cse25 (or .cse16 .cse27)) (.cse14 (not .cse16)) (.cse4 (and .cse19 .cse27)) (.cse7 (or .cse2 .cse27)) (.cse5 (not .cse2)) (.cse8 (or (not .cse31) .cse6)) (.cse9 (or .cse12 .cse6)) (.cse21 (or (and .cse27 .cse19) .cse2 .cse3)) (.cse10 (not .cse0))) (and (let ((.cse1 (= |v_P3_#t~ite33_57| |v_P3Thread1of1ForFork3_#t~ite33_1|))) (or (and .cse0 (= |v_P3_#t~ite34_45| v_~a$w_buff0_used~0_483) (or (and .cse1 (= |v_P3_#t~ite34_45| v_~a$w_buff0_used~0_484) (or .cse2 .cse3 .cse4)) (and .cse5 (or (and .cse6 (= |v_P3_#t~ite33_57| 0) .cse5) (and (= |v_P3_#t~ite33_57| v_~a$w_buff0_used~0_484) .cse7)) .cse8 .cse9 (= |v_P3_#t~ite33_57| |v_P3_#t~ite34_45|)))) (and (= |v_P3_#t~ite34_45| |v_P3Thread1of1ForFork3_#t~ite34_1|) .cse1 .cse10 (= v_~a$w_buff0_used~0_484 v_~a$w_buff0_used~0_483)))) (let ((.cse11 (= |v_P3_#t~ite42_57| |v_P3Thread1of1ForFork3_#t~ite42_1|))) (or (and .cse11 (= v_~a$r_buff1_thd4~0_185 v_~a$r_buff1_thd4~0_184) .cse10 (= |v_P3_#t~ite43_45| |v_P3Thread1of1ForFork3_#t~ite43_1|)) (and .cse0 (= |v_P3_#t~ite43_45| v_~a$r_buff1_thd4~0_184) (let ((.cse17 (= (mod v_~a$r_buff0_thd4~0_235 256) 0))) (or (let ((.cse13 (not .cse17))) (and (or .cse12 .cse13) .cse14 (let ((.cse15 (= |v_P3_#t~ite42_57| 0))) (or (and .cse14 .cse13 .cse15) (and (or .cse16 .cse17) .cse15))) (= |v_P3_#t~ite42_57| |v_P3_#t~ite43_45|) (or .cse13 .cse18))) (and .cse11 (= |v_P3_#t~ite43_45| v_~a$r_buff1_thd4~0_185) (or (and .cse17 .cse19) .cse16 (and .cse20 .cse17)))))))) (= v_~a~0_180 v_~a$mem_tmp~0_22) (or (and (= |v_P3_#t~ite25_45| v_~__unbuffered_p3_EBX~0_14) .cse5 (or (and (= |v_P3_#t~ite25_45| v_~a$w_buff0~0_104) .cse6 .cse5) (and (= |v_P3_#t~ite25_45| v_~a$w_buff1~0_113) .cse7)) .cse8 .cse9) (and (= |v_P3_#t~ite25_45| |v_P3Thread1of1ForFork3_#t~ite25_1|) (= v_~a~0_180 v_~__unbuffered_p3_EBX~0_14) .cse21)) (= |v_P3Thread1of1ForFork3_#t~nondet23_1| v_~weak$$choice0~0_13) (= |v_P3Thread1of1ForFork3_#t~nondet24_1| v_~weak$$choice2~0_86) (let ((.cse22 (= |v_P3_#t~ite27_59| |v_P3Thread1of1ForFork3_#t~ite27_1|))) (or (and .cse22 .cse10 (= |v_P3_#t~ite28_53| |v_P3Thread1of1ForFork3_#t~ite28_1|) (= v_~a$w_buff0~0_104 v_~a$w_buff0~0_103)) (and (or (and .cse22 (= |v_P3_#t~ite28_53| v_~a$w_buff0~0_104) .cse21) (and .cse5 (let ((.cse23 (= |v_P3_#t~ite27_59| v_~a$w_buff0~0_104))) (or (and .cse6 .cse5 .cse23) (and .cse23 .cse7))) .cse8 (= |v_P3_#t~ite27_59| |v_P3_#t~ite28_53|) .cse9)) .cse0 (= |v_P3_#t~ite28_53| v_~a$w_buff0~0_103)))) (let ((.cse26 (= |v_P3_#t~ite36_51| |v_P3Thread1of1ForFork3_#t~ite36_1|))) (or (and .cse0 (= |v_P3_#t~ite37_45| v_~a$w_buff1_used~0_371) (or (and .cse14 (let ((.cse24 (= |v_P3_#t~ite36_51| 0))) (or (and .cse24 .cse14 .cse6) (and .cse24 .cse25))) .cse8 .cse9 (= |v_P3_#t~ite36_51| |v_P3_#t~ite37_45|)) (and .cse26 (= |v_P3_#t~ite37_45| v_~a$w_buff1_used~0_372) (or .cse16 .cse3 .cse4)))) (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse10 .cse26 (= |v_P3_#t~ite37_45| |v_P3Thread1of1ForFork3_#t~ite37_1|)))) (= v_~a$flush_delayed~0_38 0) (let ((.cse28 (= |v_P3_#t~ite39_63| |v_P3Thread1of1ForFork3_#t~ite39_1|))) (or (and .cse0 (= |v_P3_#t~ite40_51| v_~a$r_buff0_thd4~0_235) (or (and (or .cse6 .cse18) (or (and .cse14 (= |v_P3_#t~ite39_63| 0) .cse6) (and .cse25 (= |v_P3_#t~ite39_63| v_~a$r_buff0_thd4~0_236))) .cse14 (= |v_P3_#t~ite39_63| |v_P3_#t~ite40_51|) .cse9) (and (or .cse16 (and .cse20 .cse27) .cse4) (= |v_P3_#t~ite40_51| v_~a$r_buff0_thd4~0_236) .cse28))) (and (= v_~a$r_buff0_thd4~0_236 v_~a$r_buff0_thd4~0_235) .cse10 (= |v_P3_#t~ite40_51| |v_P3Thread1of1ForFork3_#t~ite40_1|) .cse28))) (let ((.cse30 (= |v_P3Thread1of1ForFork3_#t~ite30_1| |v_P3_#t~ite30_45|))) (or (and .cse0 (= |v_P3_#t~ite31_39| v_~a$w_buff1~0_112) (or (and (let ((.cse29 (= |v_P3_#t~ite30_45| v_~a$w_buff1~0_113))) (or (and .cse29 .cse7) (and .cse29 .cse6 .cse5))) .cse5 (= |v_P3_#t~ite30_45| |v_P3_#t~ite31_39|) .cse8 .cse9) (and (= |v_P3_#t~ite31_39| v_~a$w_buff1~0_113) .cse30 .cse21))) (and .cse10 .cse30 (= v_~a$w_buff1~0_113 v_~a$w_buff1~0_112) (= |v_P3Thread1of1ForFork3_#t~ite31_1| |v_P3_#t~ite31_39|)))) (or (and .cse10 (= v_~a~0_178 v_~a$mem_tmp~0_22)) (and .cse0 (= v_~a~0_178 v_~__unbuffered_p3_EBX~0_14))))))) InVars {P3Thread1of1ForFork3_#t~nondet23=|v_P3Thread1of1ForFork3_#t~nondet23_1|, P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_1|, P3Thread1of1ForFork3_#t~nondet24=|v_P3Thread1of1ForFork3_#t~nondet24_1|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_1|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_185, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_484, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_236, ~a~0=v_~a~0_180, P3Thread1of1ForFork3_#t~ite39=|v_P3Thread1of1ForFork3_#t~ite39_1|, P3Thread1of1ForFork3_#t~ite28=|v_P3Thread1of1ForFork3_#t~ite28_1|, ~a$w_buff1~0=v_~a$w_buff1~0_113, ~a$w_buff0~0=v_~a$w_buff0~0_104, P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_1|, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_1|, P3Thread1of1ForFork3_#t~ite36=|v_P3Thread1of1ForFork3_#t~ite36_1|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_1|, P3Thread1of1ForFork3_#t~ite34=|v_P3Thread1of1ForFork3_#t~ite34_1|, P3Thread1of1ForFork3_#t~ite33=|v_P3Thread1of1ForFork3_#t~ite33_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P3Thread1of1ForFork3_#t~ite31=|v_P3Thread1of1ForFork3_#t~ite31_1|, P3Thread1of1ForFork3_#t~ite30=|v_P3Thread1of1ForFork3_#t~ite30_1|, P3Thread1of1ForFork3_#t~ite40=|v_P3Thread1of1ForFork3_#t~ite40_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_184, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_235, ~a~0=v_~a~0_178, ~a$mem_tmp~0=v_~a$mem_tmp~0_22, ~a$w_buff1~0=v_~a$w_buff1~0_112, P3Thread1of1ForFork3_#t~ite39=|v_P3Thread1of1ForFork3_#t~ite39_2|, P3Thread1of1ForFork3_#t~ite38=|v_P3Thread1of1ForFork3_#t~ite38_1|, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_2|, P3Thread1of1ForFork3_#t~ite36=|v_P3Thread1of1ForFork3_#t~ite36_2|, P3Thread1of1ForFork3_#t~ite35=|v_P3Thread1of1ForFork3_#t~ite35_1|, P3Thread1of1ForFork3_#t~ite34=|v_P3Thread1of1ForFork3_#t~ite34_2|, P3Thread1of1ForFork3_#t~ite33=|v_P3Thread1of1ForFork3_#t~ite33_2|, P3Thread1of1ForFork3_#t~ite32=|v_P3Thread1of1ForFork3_#t~ite32_1|, P3Thread1of1ForFork3_#t~ite31=|v_P3Thread1of1ForFork3_#t~ite31_2|, P3Thread1of1ForFork3_#t~ite30=|v_P3Thread1of1ForFork3_#t~ite30_2|, P3Thread1of1ForFork3_#t~nondet23=|v_P3Thread1of1ForFork3_#t~nondet23_2|, P3Thread1of1ForFork3_#t~nondet24=|v_P3Thread1of1ForFork3_#t~nondet24_2|, P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_2|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_2|, P3Thread1of1ForFork3_#t~ite44=|v_P3Thread1of1ForFork3_#t~ite44_1|, P3Thread1of1ForFork3_#t~ite45=|v_P3Thread1of1ForFork3_#t~ite45_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_483, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_13, P3Thread1of1ForFork3_#t~ite29=|v_P3Thread1of1ForFork3_#t~ite29_1|, P3Thread1of1ForFork3_#t~ite28=|v_P3Thread1of1ForFork3_#t~ite28_2|, ~a$flush_delayed~0=v_~a$flush_delayed~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_103, P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_2|, P3Thread1of1ForFork3_#t~ite26=|v_P3Thread1of1ForFork3_#t~ite26_1|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_2|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, ~weak$$choice2~0=v_~weak$$choice2~0_86, P3Thread1of1ForFork3_#t~ite41=|v_P3Thread1of1ForFork3_#t~ite41_1|, P3Thread1of1ForFork3_#t~ite40=|v_P3Thread1of1ForFork3_#t~ite40_2|} AuxVars[|v_P3_#t~ite28_53|, |v_P3_#t~ite40_51|, |v_P3_#t~ite33_57|, |v_P3_#t~ite25_45|, |v_P3_#t~ite27_59|, |v_P3_#t~ite30_45|, |v_P3_#t~ite31_39|, |v_P3_#t~ite39_63|, |v_P3_#t~ite42_57|, |v_P3_#t~ite34_45|, |v_P3_#t~ite43_45|, |v_P3_#t~ite37_45|, |v_P3_#t~ite36_51|] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~a$w_buff1~0, P3Thread1of1ForFork3_#t~ite39, P3Thread1of1ForFork3_#t~ite38, P3Thread1of1ForFork3_#t~ite37, P3Thread1of1ForFork3_#t~ite36, P3Thread1of1ForFork3_#t~ite35, P3Thread1of1ForFork3_#t~ite34, P3Thread1of1ForFork3_#t~ite33, P3Thread1of1ForFork3_#t~ite32, P3Thread1of1ForFork3_#t~ite31, P3Thread1of1ForFork3_#t~ite30, P3Thread1of1ForFork3_#t~nondet23, P3Thread1of1ForFork3_#t~nondet24, P3Thread1of1ForFork3_#t~ite42, P3Thread1of1ForFork3_#t~ite43, P3Thread1of1ForFork3_#t~ite44, P3Thread1of1ForFork3_#t~ite45, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~ite29, P3Thread1of1ForFork3_#t~ite28, ~a$flush_delayed~0, ~a$w_buff0~0, P3Thread1of1ForFork3_#t~ite27, P3Thread1of1ForFork3_#t~ite26, P3Thread1of1ForFork3_#t~ite25, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork3_#t~ite41, P3Thread1of1ForFork3_#t~ite40][36], [P2Thread1of1ForFork2InUse, Black: 157#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), P1Thread1of1ForFork1InUse, 164#(= ~z~0 1), P3Thread1of1ForFork3InUse, Black: 165#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~z~0))), 137#true, 169#true, 11#P1EXITtrue, 49#L842true, Black: 172#(<= ~__unbuffered_cnt~0 1), Black: 173#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 175#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), 180#true, Black: 139#(= ~__unbuffered_p3_EAX~0 0), Black: 140#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~z~0))), 54#P2EXITtrue, 24#L766true, 57#L884true, P0Thread1of1ForFork0InUse, Black: 154#(= ~__unbuffered_cnt~0 0)]) [2021-03-25 14:25:35,028 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-25 14:25:35,028 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 14:25:35,028 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 14:25:35,028 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 14:25:35,185 INFO L129 PetriNetUnfolder]: 1896/3643 cut-off events. [2021-03-25 14:25:35,185 INFO L130 PetriNetUnfolder]: For 7318/8399 co-relation queries the response was YES. [2021-03-25 14:25:35,212 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13501 conditions, 3643 events. 1896/3643 cut-off events. For 7318/8399 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 28489 event pairs, 462 based on Foata normal form. 133/3483 useless extension candidates. Maximal degree in co-relation 13478. Up to 1677 conditions per place. [2021-03-25 14:25:35,228 INFO L132 encePairwiseOnDemand]: 199/207 looper letters, 11 selfloop transitions, 17 changer transitions 5/69 dead transitions. [2021-03-25 14:25:35,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 69 transitions, 427 flow [2021-03-25 14:25:35,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:25:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:25:35,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1022 transitions. [2021-03-25 14:25:35,231 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.822866344605475 [2021-03-25 14:25:35,231 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1022 transitions. [2021-03-25 14:25:35,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1022 transitions. [2021-03-25 14:25:35,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:25:35,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1022 transitions. [2021-03-25 14:25:35,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 170.33333333333334) internal successors, (1022), 6 states have internal predecessors, (1022), 0 states have call successors, (0), 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 14:25:35,236 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 14:25:35,236 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 14:25:35,237 INFO L185 Difference]: Start difference. First operand has 59 places, 50 transitions, 307 flow. Second operand 6 states and 1022 transitions. [2021-03-25 14:25:35,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 69 transitions, 427 flow [2021-03-25 14:25:35,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 373 flow, removed 22 selfloop flow, removed 4 redundant places. [2021-03-25 14:25:35,363 INFO L241 Difference]: Finished difference. Result has 61 places, 62 transitions, 345 flow [2021-03-25 14:25:35,364 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=345, PETRI_PLACES=61, PETRI_TRANSITIONS=62} [2021-03-25 14:25:35,364 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2021-03-25 14:25:35,364 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:35,364 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 62 transitions, 345 flow [2021-03-25 14:25:35,364 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 62 transitions, 345 flow [2021-03-25 14:25:35,365 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 62 transitions, 345 flow [2021-03-25 14:25:35,822 INFO L129 PetriNetUnfolder]: 1551/3228 cut-off events. [2021-03-25 14:25:35,822 INFO L130 PetriNetUnfolder]: For 3818/4424 co-relation queries the response was YES. [2021-03-25 14:25:35,845 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9826 conditions, 3228 events. 1551/3228 cut-off events. For 3818/4424 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 26940 event pairs, 377 based on Foata normal form. 104/3111 useless extension candidates. Maximal degree in co-relation 9805. Up to 1416 conditions per place. [2021-03-25 14:25:35,888 INFO L142 LiptonReduction]: Number of co-enabled transitions 1192 [2021-03-25 14:25:37,932 INFO L154 LiptonReduction]: Checked pairs total: 277 [2021-03-25 14:25:37,933 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:25:37,933 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2569 [2021-03-25 14:25:37,933 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 62 transitions, 348 flow [2021-03-25 14:25:37,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 166.4) internal successors, (832), 5 states have internal predecessors, (832), 0 states have call successors, (0), 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 14:25:37,934 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:25:37,934 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:25:37,934 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:25:37,934 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:25:37,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:25:37,935 INFO L82 PathProgramCache]: Analyzing trace with hash -742739514, now seen corresponding path program 2 times [2021-03-25 14:25:37,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:25:37,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461917610] [2021-03-25 14:25:37,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:25:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:25:38,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:38,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:38,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:38,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:38,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:38,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:38,083 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:25:38,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:25:38,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:38,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:25:38,093 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 14:25:38,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461917610] [2021-03-25 14:25:38,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:25:38,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:25:38,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391271874] [2021-03-25 14:25:38,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:25:38,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:25:38,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:25:38,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:25:38,096 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 208 [2021-03-25 14:25:38,097 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 62 transitions, 348 flow. Second operand has 6 states, 6 states have (on average 175.83333333333334) internal successors, (1055), 6 states have internal predecessors, (1055), 0 states have call successors, (0), 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 14:25:38,097 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:25:38,097 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 208 [2021-03-25 14:25:38,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:25:38,662 INFO L129 PetriNetUnfolder]: 1876/3643 cut-off events. [2021-03-25 14:25:38,663 INFO L130 PetriNetUnfolder]: For 5100/11182 co-relation queries the response was YES. [2021-03-25 14:25:38,688 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12464 conditions, 3643 events. 1876/3643 cut-off events. For 5100/11182 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 29497 event pairs, 120 based on Foata normal form. 1033/4110 useless extension candidates. Maximal degree in co-relation 12441. Up to 1825 conditions per place. [2021-03-25 14:25:38,709 INFO L132 encePairwiseOnDemand]: 201/208 looper letters, 12 selfloop transitions, 18 changer transitions 4/78 dead transitions. [2021-03-25 14:25:38,709 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 78 transitions, 524 flow [2021-03-25 14:25:38,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:25:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:25:38,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1259 transitions. [2021-03-25 14:25:38,713 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8646978021978022 [2021-03-25 14:25:38,713 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1259 transitions. [2021-03-25 14:25:38,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1259 transitions. [2021-03-25 14:25:38,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:25:38,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1259 transitions. [2021-03-25 14:25:38,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 179.85714285714286) internal successors, (1259), 7 states have internal predecessors, (1259), 0 states have call successors, (0), 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 14:25:38,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 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 14:25:38,721 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 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 14:25:38,721 INFO L185 Difference]: Start difference. First operand has 61 places, 62 transitions, 348 flow. Second operand 7 states and 1259 transitions. [2021-03-25 14:25:38,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 78 transitions, 524 flow [2021-03-25 14:25:38,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 517 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 14:25:38,748 INFO L241 Difference]: Finished difference. Result has 69 places, 71 transitions, 487 flow [2021-03-25 14:25:38,749 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=487, PETRI_PLACES=69, PETRI_TRANSITIONS=71} [2021-03-25 14:25:38,749 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 9 predicate places. [2021-03-25 14:25:38,749 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:38,749 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 71 transitions, 487 flow [2021-03-25 14:25:38,749 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 71 transitions, 487 flow [2021-03-25 14:25:38,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 71 transitions, 487 flow [2021-03-25 14:25:39,024 INFO L129 PetriNetUnfolder]: 1119/2464 cut-off events. [2021-03-25 14:25:39,025 INFO L130 PetriNetUnfolder]: For 5386/6426 co-relation queries the response was YES. [2021-03-25 14:25:39,043 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9635 conditions, 2464 events. 1119/2464 cut-off events. For 5386/6426 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 20258 event pairs, 122 based on Foata normal form. 32/2303 useless extension candidates. Maximal degree in co-relation 9610. Up to 1312 conditions per place. [2021-03-25 14:25:39,078 INFO L142 LiptonReduction]: Number of co-enabled transitions 1340 [2021-03-25 14:25:39,115 INFO L154 LiptonReduction]: Checked pairs total: 134 [2021-03-25 14:25:39,115 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:25:39,116 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 367 [2021-03-25 14:25:39,117 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 71 transitions, 487 flow [2021-03-25 14:25:39,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 175.83333333333334) internal successors, (1055), 6 states have internal predecessors, (1055), 0 states have call successors, (0), 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 14:25:39,117 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:25:39,118 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 14:25:39,118 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:25:39,118 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:25:39,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:25:39,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1794909071, now seen corresponding path program 1 times [2021-03-25 14:25:39,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:25:39,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101901731] [2021-03-25 14:25:39,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:25:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:25:39,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:39,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:25:39,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:39,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:39,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:39,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:39,226 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 14:25:39,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101901731] [2021-03-25 14:25:39,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:25:39,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:25:39,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619870886] [2021-03-25 14:25:39,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:25:39,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:25:39,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:25:39,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:25:39,232 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 208 [2021-03-25 14:25:39,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 71 transitions, 487 flow. Second operand has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 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 14:25:39,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:25:39,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 208 [2021-03-25 14:25:39,233 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:25:39,683 INFO L129 PetriNetUnfolder]: 1502/3457 cut-off events. [2021-03-25 14:25:39,683 INFO L130 PetriNetUnfolder]: For 7727/8815 co-relation queries the response was YES. [2021-03-25 14:25:39,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13501 conditions, 3457 events. 1502/3457 cut-off events. For 7727/8815 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 31227 event pairs, 149 based on Foata normal form. 44/3242 useless extension candidates. Maximal degree in co-relation 13474. Up to 1811 conditions per place. [2021-03-25 14:25:39,729 INFO L132 encePairwiseOnDemand]: 204/208 looper letters, 6 selfloop transitions, 3 changer transitions 3/75 dead transitions. [2021-03-25 14:25:39,729 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 75 transitions, 535 flow [2021-03-25 14:25:39,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:25:39,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:25:39,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 729 transitions. [2021-03-25 14:25:39,731 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8762019230769231 [2021-03-25 14:25:39,731 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 729 transitions. [2021-03-25 14:25:39,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 729 transitions. [2021-03-25 14:25:39,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:25:39,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 729 transitions. [2021-03-25 14:25:39,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 182.25) internal successors, (729), 4 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:39,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 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 14:25:39,735 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 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 14:25:39,735 INFO L185 Difference]: Start difference. First operand has 69 places, 71 transitions, 487 flow. Second operand 4 states and 729 transitions. [2021-03-25 14:25:39,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 75 transitions, 535 flow [2021-03-25 14:25:39,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 75 transitions, 465 flow, removed 26 selfloop flow, removed 3 redundant places. [2021-03-25 14:25:39,943 INFO L241 Difference]: Finished difference. Result has 71 places, 71 transitions, 436 flow [2021-03-25 14:25:39,943 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=436, PETRI_PLACES=71, PETRI_TRANSITIONS=71} [2021-03-25 14:25:39,943 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 11 predicate places. [2021-03-25 14:25:39,944 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:39,944 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 71 transitions, 436 flow [2021-03-25 14:25:39,944 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 71 transitions, 436 flow [2021-03-25 14:25:39,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 71 transitions, 436 flow [2021-03-25 14:25:40,302 INFO L129 PetriNetUnfolder]: 1564/3520 cut-off events. [2021-03-25 14:25:40,303 INFO L130 PetriNetUnfolder]: For 4401/4659 co-relation queries the response was YES. [2021-03-25 14:25:40,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10964 conditions, 3520 events. 1564/3520 cut-off events. For 4401/4659 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 32306 event pairs, 186 based on Foata normal form. 26/3307 useless extension candidates. Maximal degree in co-relation 10938. Up to 911 conditions per place. [2021-03-25 14:25:40,372 INFO L142 LiptonReduction]: Number of co-enabled transitions 1352 [2021-03-25 14:25:40,567 INFO L154 LiptonReduction]: Checked pairs total: 215 [2021-03-25 14:25:40,567 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:25:40,568 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 623 [2021-03-25 14:25:40,568 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 71 transitions, 439 flow [2021-03-25 14:25:40,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 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 14:25:40,568 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:25:40,569 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 14:25:40,569 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:25:40,569 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:25:40,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:25:40,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1348686269, now seen corresponding path program 2 times [2021-03-25 14:25:40,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:25:40,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897391405] [2021-03-25 14:25:40,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:25:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:25:40,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:40,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:25:40,663 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.9 percent of original size [2021-03-25 14:25:40,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 14:25:40,683 INFO L142 QuantifierPusher]: treesize reduction 10, result has 70.6 percent of original size [2021-03-25 14:25:40,684 INFO L147 QuantifierPusher]: treesize reduction 5, result has 79.2 percent of original size 19 [2021-03-25 14:25:40,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:40,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 14:25:40,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:40,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:25:40,726 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 14:25:40,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897391405] [2021-03-25 14:25:40,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:25:40,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:25:40,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920479801] [2021-03-25 14:25:40,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:25:40,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:25:40,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:25:40,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:25:40,729 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 209 [2021-03-25 14:25:40,730 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 439 flow. Second operand has 7 states, 7 states have (on average 157.14285714285714) internal successors, (1100), 7 states have internal predecessors, (1100), 0 states have call successors, (0), 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 14:25:40,730 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:25:40,730 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 209 [2021-03-25 14:25:40,730 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:25:41,560 INFO L129 PetriNetUnfolder]: 2229/4977 cut-off events. [2021-03-25 14:25:41,560 INFO L130 PetriNetUnfolder]: For 8390/9963 co-relation queries the response was YES. [2021-03-25 14:25:41,601 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17081 conditions, 4977 events. 2229/4977 cut-off events. For 8390/9963 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 47454 event pairs, 156 based on Foata normal form. 272/4926 useless extension candidates. Maximal degree in co-relation 17053. Up to 1372 conditions per place. [2021-03-25 14:25:41,610 INFO L132 encePairwiseOnDemand]: 201/209 looper letters, 22 selfloop transitions, 17 changer transitions 6/91 dead transitions. [2021-03-25 14:25:41,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 91 transitions, 651 flow [2021-03-25 14:25:41,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:25:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:25:41,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1122 transitions. [2021-03-25 14:25:41,613 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7669172932330827 [2021-03-25 14:25:41,613 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1122 transitions. [2021-03-25 14:25:41,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1122 transitions. [2021-03-25 14:25:41,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:25:41,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1122 transitions. [2021-03-25 14:25:41,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 160.28571428571428) internal successors, (1122), 7 states have internal predecessors, (1122), 0 states have call successors, (0), 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 14:25:41,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:41,620 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:41,620 INFO L185 Difference]: Start difference. First operand has 71 places, 71 transitions, 439 flow. Second operand 7 states and 1122 transitions. [2021-03-25 14:25:41,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 91 transitions, 651 flow [2021-03-25 14:25:41,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 91 transitions, 647 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-25 14:25:41,888 INFO L241 Difference]: Finished difference. Result has 79 places, 77 transitions, 530 flow [2021-03-25 14:25:41,888 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=530, PETRI_PLACES=79, PETRI_TRANSITIONS=77} [2021-03-25 14:25:41,889 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 19 predicate places. [2021-03-25 14:25:41,889 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:41,889 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 77 transitions, 530 flow [2021-03-25 14:25:41,889 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 77 transitions, 530 flow [2021-03-25 14:25:41,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 77 transitions, 530 flow [2021-03-25 14:25:42,296 INFO L129 PetriNetUnfolder]: 2363/5112 cut-off events. [2021-03-25 14:25:42,296 INFO L130 PetriNetUnfolder]: For 8213/8795 co-relation queries the response was YES. [2021-03-25 14:25:42,334 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17293 conditions, 5112 events. 2363/5112 cut-off events. For 8213/8795 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 48815 event pairs, 238 based on Foata normal form. 69/4848 useless extension candidates. Maximal degree in co-relation 17263. Up to 1503 conditions per place. [2021-03-25 14:25:42,385 INFO L142 LiptonReduction]: Number of co-enabled transitions 1488 [2021-03-25 14:25:42,586 INFO L154 LiptonReduction]: Checked pairs total: 88 [2021-03-25 14:25:42,586 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:25:42,587 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 698 [2021-03-25 14:25:42,587 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 77 transitions, 530 flow [2021-03-25 14:25:42,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 157.14285714285714) internal successors, (1100), 7 states have internal predecessors, (1100), 0 states have call successors, (0), 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 14:25:42,588 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:25:42,588 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 14:25:42,588 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:25:42,588 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:25:42,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:25:42,588 INFO L82 PathProgramCache]: Analyzing trace with hash 245905040, now seen corresponding path program 1 times [2021-03-25 14:25:42,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:25:42,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080004216] [2021-03-25 14:25:42,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:25:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:25:42,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:42,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:25:42,700 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.9 percent of original size [2021-03-25 14:25:42,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 14:25:42,721 INFO L142 QuantifierPusher]: treesize reduction 10, result has 73.0 percent of original size [2021-03-25 14:25:42,722 INFO L147 QuantifierPusher]: treesize reduction 5, result has 81.5 percent of original size 22 [2021-03-25 14:25:42,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:42,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 14:25:42,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:42,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:25:42,769 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 14:25:42,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080004216] [2021-03-25 14:25:42,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:25:42,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:25:42,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115614327] [2021-03-25 14:25:42,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:25:42,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:25:42,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:25:42,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:25:42,772 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 209 [2021-03-25 14:25:42,773 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 77 transitions, 530 flow. Second operand has 7 states, 7 states have (on average 157.14285714285714) internal successors, (1100), 7 states have internal predecessors, (1100), 0 states have call successors, (0), 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 14:25:42,773 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:25:42,773 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 209 [2021-03-25 14:25:42,773 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:25:43,529 INFO L129 PetriNetUnfolder]: 2728/6106 cut-off events. [2021-03-25 14:25:43,530 INFO L130 PetriNetUnfolder]: For 12884/14989 co-relation queries the response was YES. [2021-03-25 14:25:43,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22189 conditions, 6106 events. 2728/6106 cut-off events. For 12884/14989 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 60687 event pairs, 183 based on Foata normal form. 348/6050 useless extension candidates. Maximal degree in co-relation 22157. Up to 1787 conditions per place. [2021-03-25 14:25:43,571 INFO L132 encePairwiseOnDemand]: 201/209 looper letters, 29 selfloop transitions, 21 changer transitions 2/98 dead transitions. [2021-03-25 14:25:43,571 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 98 transitions, 796 flow [2021-03-25 14:25:43,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:25:43,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:25:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1121 transitions. [2021-03-25 14:25:43,574 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7662337662337663 [2021-03-25 14:25:43,574 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1121 transitions. [2021-03-25 14:25:43,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1121 transitions. [2021-03-25 14:25:43,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:25:43,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1121 transitions. [2021-03-25 14:25:43,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 160.14285714285714) internal successors, (1121), 7 states have internal predecessors, (1121), 0 states have call successors, (0), 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 14:25:43,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:43,580 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:43,581 INFO L185 Difference]: Start difference. First operand has 79 places, 77 transitions, 530 flow. Second operand 7 states and 1121 transitions. [2021-03-25 14:25:43,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 98 transitions, 796 flow [2021-03-25 14:25:43,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 98 transitions, 782 flow, removed 6 selfloop flow, removed 2 redundant places. [2021-03-25 14:25:43,927 INFO L241 Difference]: Finished difference. Result has 86 places, 88 transitions, 695 flow [2021-03-25 14:25:43,927 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=695, PETRI_PLACES=86, PETRI_TRANSITIONS=88} [2021-03-25 14:25:43,928 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 26 predicate places. [2021-03-25 14:25:43,928 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:43,928 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 88 transitions, 695 flow [2021-03-25 14:25:43,928 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 88 transitions, 695 flow [2021-03-25 14:25:43,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 88 transitions, 695 flow [2021-03-25 14:25:44,124 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1075] L786-->L793: Formula: (let ((.cse13 (= (mod v_~a$w_buff0_used~0_404 256) 0)) (.cse12 (= (mod v_~a$r_buff0_thd2~0_68 256) 0)) (.cse6 (= (mod v_~a$w_buff0_used~0_403 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_294 256) 0)) (.cse3 (= (mod v_~a$r_buff1_thd2~0_46 256) 0))) (let ((.cse7 (not .cse3)) (.cse10 (not .cse14)) (.cse1 (not .cse6)) (.cse11 (or .cse14 .cse3)) (.cse0 (or .cse6 .cse12)) (.cse9 (or .cse13 .cse12)) (.cse8 (not .cse13)) (.cse2 (not .cse12))) (and (or (and .cse0 (= v_~a$r_buff0_thd2~0_68 v_~a$r_buff0_thd2~0_67)) (and .cse1 (= v_~a$r_buff0_thd2~0_67 0) .cse2)) (let ((.cse5 (= (mod v_~a$r_buff0_thd2~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_293 256) 0))) (or (and (= v_~a$r_buff1_thd2~0_46 v_~a$r_buff1_thd2~0_45) (or .cse3 .cse4) (or .cse5 .cse6)) (and (= v_~a$r_buff1_thd2~0_45 0) (or (and .cse1 (not .cse5)) (and .cse7 (not .cse4)))))) (or (and (= v_~a~0_130 v_~a$w_buff0~0_75) .cse8 (= |v_P1Thread1of1ForFork1_#t~ite11_1| |v_P1_#t~ite11_33|) .cse2) (and (= v_~a~0_130 |v_P1_#t~ite11_33|) .cse9 (or (and .cse7 .cse10 (= |v_P1_#t~ite11_33| v_~a$w_buff1~0_74)) (and .cse11 (= v_~a~0_131 |v_P1_#t~ite11_33|))))) (or (and (or (and .cse7 .cse10) (and .cse1 .cse2)) (= v_~a$w_buff1_used~0_293 0)) (and .cse11 .cse0 (= v_~a$w_buff1_used~0_294 v_~a$w_buff1_used~0_293))) (or (and (= v_~a$w_buff0_used~0_404 v_~a$w_buff0_used~0_403) .cse9) (and .cse8 (= v_~a$w_buff0_used~0_403 0) .cse2))))) InVars {~a~0=v_~a~0_131, ~a$w_buff1~0=v_~a$w_buff1~0_74, ~a$w_buff0~0=v_~a$w_buff0~0_75, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_46, P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_1|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_68, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_404, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_294} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_45, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_2|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_403, P1Thread1of1ForFork1_#t~ite13=|v_P1Thread1of1ForFork1_#t~ite13_1|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_1|, P1Thread1of1ForFork1_#t~ite15=|v_P1Thread1of1ForFork1_#t~ite15_1|, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_1|, P1Thread1of1ForFork1_#t~ite16=|v_P1Thread1of1ForFork1_#t~ite16_1|, ~a~0=v_~a~0_130, ~a$w_buff1~0=v_~a$w_buff1~0_74, ~a$w_buff0~0=v_~a$w_buff0~0_75, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_293} AuxVars[|v_P1_#t~ite11_33|] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite11, ~a$w_buff0_used~0, P1Thread1of1ForFork1_#t~ite13, P1Thread1of1ForFork1_#t~ite12, ~a$w_buff1_used~0, P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#t~ite16][46], [P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork3InUse, Black: 195#(<= ~__unbuffered_cnt~0 2), Black: 196#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 137#true, Black: 198#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 205#(= ~x~0 1), Black: 208#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 139#(= ~__unbuffered_p3_EAX~0 0), Black: 140#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~z~0))), 214#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd2~0 0)), 88#L773true, Black: 157#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 164#(= ~z~0 1), Black: 220#(and (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 222#(and (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff0_thd4~0 0) (not (= ~a$w_buff0_used~0 1)) (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), 103#L849true, Black: 165#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~z~0))), 233#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd3~0 0)), 107#L813true, 171#(= ~__unbuffered_cnt~0 0), Black: 172#(<= ~__unbuffered_cnt~0 1), 180#true, Black: 241#(and (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0) (not (= ~a$w_buff0_used~0 1)) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0)), 56#L793true, Black: 245#(and (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 239#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 59#L873-1true, Black: 182#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), P0Thread1of1ForFork0InUse]) [2021-03-25 14:25:44,124 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 14:25:44,124 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 14:25:44,124 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:25:44,124 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 14:25:44,420 INFO L129 PetriNetUnfolder]: 2835/6201 cut-off events. [2021-03-25 14:25:44,421 INFO L130 PetriNetUnfolder]: For 13174/13858 co-relation queries the response was YES. [2021-03-25 14:25:44,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22244 conditions, 6201 events. 2835/6201 cut-off events. For 13174/13858 co-relation queries the response was YES. Maximal size of possible extension queue 832. Compared 61921 event pairs, 217 based on Foata normal form. 92/5919 useless extension candidates. Maximal degree in co-relation 22211. Up to 1859 conditions per place. [2021-03-25 14:25:44,524 INFO L142 LiptonReduction]: Number of co-enabled transitions 1690 [2021-03-25 14:25:44,769 INFO L154 LiptonReduction]: Checked pairs total: 96 [2021-03-25 14:25:44,770 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:25:44,770 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 842 [2021-03-25 14:25:44,770 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 88 transitions, 695 flow [2021-03-25 14:25:44,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 157.14285714285714) internal successors, (1100), 7 states have internal predecessors, (1100), 0 states have call successors, (0), 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 14:25:44,771 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:25:44,771 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 14:25:44,771 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:25:44,771 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:25:44,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:25:44,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1695014799, now seen corresponding path program 3 times [2021-03-25 14:25:44,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:25:44,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426112247] [2021-03-25 14:25:44,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:25:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:25:44,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:44,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:44,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:44,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:44,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:44,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:44,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:44,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:44,938 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:25:44,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:25:44,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:44,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:25:44,949 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 14:25:44,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426112247] [2021-03-25 14:25:44,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:25:44,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:25:44,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812400239] [2021-03-25 14:25:44,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:25:44,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:25:44,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:25:44,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:25:44,952 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 209 [2021-03-25 14:25:44,953 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 88 transitions, 695 flow. Second operand has 7 states, 7 states have (on average 176.85714285714286) internal successors, (1238), 7 states have internal predecessors, (1238), 0 states have call successors, (0), 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 14:25:44,954 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:25:44,954 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 209 [2021-03-25 14:25:44,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:25:45,990 INFO L129 PetriNetUnfolder]: 5152/9780 cut-off events. [2021-03-25 14:25:45,991 INFO L130 PetriNetUnfolder]: For 20645/33836 co-relation queries the response was YES. [2021-03-25 14:25:46,038 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37810 conditions, 9780 events. 5152/9780 cut-off events. For 20645/33836 co-relation queries the response was YES. Maximal size of possible extension queue 1556. Compared 91639 event pairs, 149 based on Foata normal form. 2192/10559 useless extension candidates. Maximal degree in co-relation 37775. Up to 3142 conditions per place. [2021-03-25 14:25:46,059 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 7 selfloop transitions, 23 changer transitions 10/93 dead transitions. [2021-03-25 14:25:46,059 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 93 transitions, 772 flow [2021-03-25 14:25:46,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 14:25:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 14:25:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1620 transitions. [2021-03-25 14:25:46,063 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.861244019138756 [2021-03-25 14:25:46,063 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1620 transitions. [2021-03-25 14:25:46,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1620 transitions. [2021-03-25 14:25:46,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:25:46,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1620 transitions. [2021-03-25 14:25:46,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 180.0) internal successors, (1620), 9 states have internal predecessors, (1620), 0 states have call successors, (0), 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 14:25:46,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 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 14:25:46,071 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 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 14:25:46,071 INFO L185 Difference]: Start difference. First operand has 86 places, 88 transitions, 695 flow. Second operand 9 states and 1620 transitions. [2021-03-25 14:25:46,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 93 transitions, 772 flow [2021-03-25 14:25:46,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 93 transitions, 747 flow, removed 10 selfloop flow, removed 2 redundant places. [2021-03-25 14:25:46,849 INFO L241 Difference]: Finished difference. Result has 95 places, 80 transitions, 630 flow [2021-03-25 14:25:46,850 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=630, PETRI_PLACES=95, PETRI_TRANSITIONS=80} [2021-03-25 14:25:46,850 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 35 predicate places. [2021-03-25 14:25:46,850 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:46,850 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 80 transitions, 630 flow [2021-03-25 14:25:46,850 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 80 transitions, 630 flow [2021-03-25 14:25:46,851 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 94 places, 80 transitions, 630 flow [2021-03-25 14:25:47,020 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1075] L786-->L793: Formula: (let ((.cse13 (= (mod v_~a$w_buff0_used~0_404 256) 0)) (.cse12 (= (mod v_~a$r_buff0_thd2~0_68 256) 0)) (.cse6 (= (mod v_~a$w_buff0_used~0_403 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_294 256) 0)) (.cse3 (= (mod v_~a$r_buff1_thd2~0_46 256) 0))) (let ((.cse7 (not .cse3)) (.cse10 (not .cse14)) (.cse1 (not .cse6)) (.cse11 (or .cse14 .cse3)) (.cse0 (or .cse6 .cse12)) (.cse9 (or .cse13 .cse12)) (.cse8 (not .cse13)) (.cse2 (not .cse12))) (and (or (and .cse0 (= v_~a$r_buff0_thd2~0_68 v_~a$r_buff0_thd2~0_67)) (and .cse1 (= v_~a$r_buff0_thd2~0_67 0) .cse2)) (let ((.cse5 (= (mod v_~a$r_buff0_thd2~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_293 256) 0))) (or (and (= v_~a$r_buff1_thd2~0_46 v_~a$r_buff1_thd2~0_45) (or .cse3 .cse4) (or .cse5 .cse6)) (and (= v_~a$r_buff1_thd2~0_45 0) (or (and .cse1 (not .cse5)) (and .cse7 (not .cse4)))))) (or (and (= v_~a~0_130 v_~a$w_buff0~0_75) .cse8 (= |v_P1Thread1of1ForFork1_#t~ite11_1| |v_P1_#t~ite11_33|) .cse2) (and (= v_~a~0_130 |v_P1_#t~ite11_33|) .cse9 (or (and .cse7 .cse10 (= |v_P1_#t~ite11_33| v_~a$w_buff1~0_74)) (and .cse11 (= v_~a~0_131 |v_P1_#t~ite11_33|))))) (or (and (or (and .cse7 .cse10) (and .cse1 .cse2)) (= v_~a$w_buff1_used~0_293 0)) (and .cse11 .cse0 (= v_~a$w_buff1_used~0_294 v_~a$w_buff1_used~0_293))) (or (and (= v_~a$w_buff0_used~0_404 v_~a$w_buff0_used~0_403) .cse9) (and .cse8 (= v_~a$w_buff0_used~0_403 0) .cse2))))) InVars {~a~0=v_~a~0_131, ~a$w_buff1~0=v_~a$w_buff1~0_74, ~a$w_buff0~0=v_~a$w_buff0~0_75, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_46, P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_1|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_68, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_404, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_294} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_45, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_2|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_403, P1Thread1of1ForFork1_#t~ite13=|v_P1Thread1of1ForFork1_#t~ite13_1|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_1|, P1Thread1of1ForFork1_#t~ite15=|v_P1Thread1of1ForFork1_#t~ite15_1|, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_1|, P1Thread1of1ForFork1_#t~ite16=|v_P1Thread1of1ForFork1_#t~ite16_1|, ~a~0=v_~a~0_130, ~a$w_buff1~0=v_~a$w_buff1~0_74, ~a$w_buff0~0=v_~a$w_buff0~0_75, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_293} AuxVars[|v_P1_#t~ite11_33|] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite11, ~a$w_buff0_used~0, P1Thread1of1ForFork1_#t~ite13, P1Thread1of1ForFork1_#t~ite12, ~a$w_buff1_used~0, P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#t~ite16][39], [P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork3InUse, Black: 256#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 260#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 3)), Black: 255#(<= ~__unbuffered_cnt~0 3), Black: 195#(<= ~__unbuffered_cnt~0 2), 137#true, Black: 196#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 198#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 205#(= ~x~0 1), Black: 208#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 140#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~z~0))), 214#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd2~0 0)), 88#L773true, Black: 157#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 164#(= ~z~0 1), Black: 220#(and (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 222#(and (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff0_thd4~0 0) (not (= ~a$w_buff0_used~0 1)) (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), 103#L849true, Black: 165#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~z~0))), 233#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd3~0 0)), 107#L813true, 171#(= ~__unbuffered_cnt~0 0), Black: 172#(<= ~__unbuffered_cnt~0 1), 180#true, Black: 241#(and (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0) (not (= ~a$w_buff0_used~0 1)) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0)), 56#L793true, Black: 245#(and (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 239#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 59#L873-1true, Black: 182#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), 252#(= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork0InUse]) [2021-03-25 14:25:47,020 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 14:25:47,021 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:25:47,021 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 14:25:47,021 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:25:47,318 INFO L129 PetriNetUnfolder]: 2348/5397 cut-off events. [2021-03-25 14:25:47,318 INFO L130 PetriNetUnfolder]: For 13332/14517 co-relation queries the response was YES. [2021-03-25 14:25:47,356 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22522 conditions, 5397 events. 2348/5397 cut-off events. For 13332/14517 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 54076 event pairs, 205 based on Foata normal form. 49/5056 useless extension candidates. Maximal degree in co-relation 22486. Up to 1593 conditions per place. [2021-03-25 14:25:47,422 INFO L142 LiptonReduction]: Number of co-enabled transitions 1572 [2021-03-25 14:25:47,723 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:25:47,857 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:25:48,047 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-25 14:25:48,289 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:25:48,417 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:25:49,701 WARN L205 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 271 DAG size of output: 213 [2021-03-25 14:25:50,086 WARN L205 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2021-03-25 14:25:52,298 WARN L205 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 377 DAG size of output: 317 [2021-03-25 14:25:53,232 WARN L205 SmtUtils]: Spent 929.00 ms on a formula simplification that was a NOOP. DAG size: 306 [2021-03-25 14:25:53,257 INFO L154 LiptonReduction]: Checked pairs total: 190 [2021-03-25 14:25:53,257 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:25:53,257 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6407 [2021-03-25 14:25:53,258 INFO L480 AbstractCegarLoop]: Abstraction has has 93 places, 79 transitions, 644 flow [2021-03-25 14:25:53,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 176.85714285714286) internal successors, (1238), 7 states have internal predecessors, (1238), 0 states have call successors, (0), 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 14:25:53,258 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:25:53,258 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 14:25:53,258 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:25:53,259 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:25:53,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:25:53,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1542100842, now seen corresponding path program 1 times [2021-03-25 14:25:53,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:25:53,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200509086] [2021-03-25 14:25:53,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:25:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:25:53,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:53,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:25:53,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:53,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:53,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:53,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:53,322 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:25:53,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:25:53,333 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 14:25:53,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200509086] [2021-03-25 14:25:53,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:25:53,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:25:53,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348578080] [2021-03-25 14:25:53,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:25:53,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:25:53,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:25:53,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:25:53,337 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 212 [2021-03-25 14:25:53,337 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 79 transitions, 644 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 14:25:53,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:25:53,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 212 [2021-03-25 14:25:53,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:25:53,653 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1075] L786-->L793: Formula: (let ((.cse13 (= (mod v_~a$w_buff0_used~0_404 256) 0)) (.cse12 (= (mod v_~a$r_buff0_thd2~0_68 256) 0)) (.cse6 (= (mod v_~a$w_buff0_used~0_403 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_294 256) 0)) (.cse3 (= (mod v_~a$r_buff1_thd2~0_46 256) 0))) (let ((.cse7 (not .cse3)) (.cse10 (not .cse14)) (.cse1 (not .cse6)) (.cse11 (or .cse14 .cse3)) (.cse0 (or .cse6 .cse12)) (.cse9 (or .cse13 .cse12)) (.cse8 (not .cse13)) (.cse2 (not .cse12))) (and (or (and .cse0 (= v_~a$r_buff0_thd2~0_68 v_~a$r_buff0_thd2~0_67)) (and .cse1 (= v_~a$r_buff0_thd2~0_67 0) .cse2)) (let ((.cse5 (= (mod v_~a$r_buff0_thd2~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_293 256) 0))) (or (and (= v_~a$r_buff1_thd2~0_46 v_~a$r_buff1_thd2~0_45) (or .cse3 .cse4) (or .cse5 .cse6)) (and (= v_~a$r_buff1_thd2~0_45 0) (or (and .cse1 (not .cse5)) (and .cse7 (not .cse4)))))) (or (and (= v_~a~0_130 v_~a$w_buff0~0_75) .cse8 (= |v_P1Thread1of1ForFork1_#t~ite11_1| |v_P1_#t~ite11_33|) .cse2) (and (= v_~a~0_130 |v_P1_#t~ite11_33|) .cse9 (or (and .cse7 .cse10 (= |v_P1_#t~ite11_33| v_~a$w_buff1~0_74)) (and .cse11 (= v_~a~0_131 |v_P1_#t~ite11_33|))))) (or (and (or (and .cse7 .cse10) (and .cse1 .cse2)) (= v_~a$w_buff1_used~0_293 0)) (and .cse11 .cse0 (= v_~a$w_buff1_used~0_294 v_~a$w_buff1_used~0_293))) (or (and (= v_~a$w_buff0_used~0_404 v_~a$w_buff0_used~0_403) .cse9) (and .cse8 (= v_~a$w_buff0_used~0_403 0) .cse2))))) InVars {~a~0=v_~a~0_131, ~a$w_buff1~0=v_~a$w_buff1~0_74, ~a$w_buff0~0=v_~a$w_buff0~0_75, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_46, P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_1|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_68, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_404, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_294} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_45, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_2|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_403, P1Thread1of1ForFork1_#t~ite13=|v_P1Thread1of1ForFork1_#t~ite13_1|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_1|, P1Thread1of1ForFork1_#t~ite15=|v_P1Thread1of1ForFork1_#t~ite15_1|, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_1|, P1Thread1of1ForFork1_#t~ite16=|v_P1Thread1of1ForFork1_#t~ite16_1|, ~a~0=v_~a~0_130, ~a$w_buff1~0=v_~a$w_buff1~0_74, ~a$w_buff0~0=v_~a$w_buff0~0_75, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_293} AuxVars[|v_P1_#t~ite11_33|] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite11, ~a$w_buff0_used~0, P1Thread1of1ForFork1_#t~ite13, P1Thread1of1ForFork1_#t~ite12, ~a$w_buff1_used~0, P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#t~ite16][77], [P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork3InUse, Black: 256#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 260#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 3)), Black: 255#(<= ~__unbuffered_cnt~0 3), Black: 195#(<= ~__unbuffered_cnt~0 2), 137#true, Black: 196#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 198#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 205#(= ~x~0 1), 273#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), Black: 208#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 140#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~z~0))), 214#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd2~0 0)), 88#L773true, Black: 157#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 164#(= ~z~0 1), Black: 220#(and (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 222#(and (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff0_thd4~0 0) (not (= ~a$w_buff0_used~0 1)) (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), 103#L849true, Black: 165#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~z~0))), 233#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd3~0 0)), 171#(= ~__unbuffered_cnt~0 0), 107#L813true, Black: 172#(<= ~__unbuffered_cnt~0 1), 180#true, Black: 241#(and (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0) (not (= ~a$w_buff0_used~0 1)) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0)), Black: 245#(and (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd3~0 0)), 56#L793true, Black: 239#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 59#L873-1true, Black: 182#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), 252#(= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork0InUse]) [2021-03-25 14:25:53,653 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 14:25:53,653 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:25:53,653 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:25:53,653 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:25:54,250 INFO L129 PetriNetUnfolder]: 3720/8718 cut-off events. [2021-03-25 14:25:54,250 INFO L130 PetriNetUnfolder]: For 22345/24217 co-relation queries the response was YES. [2021-03-25 14:25:54,311 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36857 conditions, 8718 events. 3720/8718 cut-off events. For 22345/24217 co-relation queries the response was YES. Maximal size of possible extension queue 1196. Compared 94292 event pairs, 174 based on Foata normal form. 117/8263 useless extension candidates. Maximal degree in co-relation 36819. Up to 2538 conditions per place. [2021-03-25 14:25:54,323 INFO L132 encePairwiseOnDemand]: 200/212 looper letters, 8 selfloop transitions, 5 changer transitions 49/110 dead transitions. [2021-03-25 14:25:54,323 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 110 transitions, 996 flow [2021-03-25 14:25:54,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:25:54,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:25:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1027 transitions. [2021-03-25 14:25:54,326 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8073899371069182 [2021-03-25 14:25:54,326 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1027 transitions. [2021-03-25 14:25:54,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1027 transitions. [2021-03-25 14:25:54,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:25:54,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1027 transitions. [2021-03-25 14:25:54,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 171.16666666666666) internal successors, (1027), 6 states have internal predecessors, (1027), 0 states have call successors, (0), 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 14:25:54,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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 14:25:54,339 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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 14:25:54,339 INFO L185 Difference]: Start difference. First operand has 93 places, 79 transitions, 644 flow. Second operand 6 states and 1027 transitions. [2021-03-25 14:25:54,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 110 transitions, 996 flow [2021-03-25 14:25:55,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 110 transitions, 915 flow, removed 19 selfloop flow, removed 10 redundant places. [2021-03-25 14:25:55,444 INFO L241 Difference]: Finished difference. Result has 91 places, 60 transitions, 418 flow [2021-03-25 14:25:55,444 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=418, PETRI_PLACES=91, PETRI_TRANSITIONS=60} [2021-03-25 14:25:55,445 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 31 predicate places. [2021-03-25 14:25:55,445 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:55,445 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 60 transitions, 418 flow [2021-03-25 14:25:55,445 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 60 transitions, 418 flow [2021-03-25 14:25:55,445 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 60 transitions, 418 flow [2021-03-25 14:25:55,482 INFO L129 PetriNetUnfolder]: 191/475 cut-off events. [2021-03-25 14:25:55,482 INFO L130 PetriNetUnfolder]: For 645/702 co-relation queries the response was YES. [2021-03-25 14:25:55,484 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 475 events. 191/475 cut-off events. For 645/702 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 2922 event pairs, 11 based on Foata normal form. 4/457 useless extension candidates. Maximal degree in co-relation 1563. Up to 124 conditions per place. [2021-03-25 14:25:55,487 INFO L142 LiptonReduction]: Number of co-enabled transitions 734 [2021-03-25 14:25:55,656 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 69 [2021-03-25 14:25:55,954 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 88 [2021-03-25 14:25:56,339 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 14:25:56,490 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 14:25:56,496 INFO L154 LiptonReduction]: Checked pairs total: 72 [2021-03-25 14:25:56,497 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 14:25:56,497 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1052 [2021-03-25 14:25:56,497 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 57 transitions, 421 flow [2021-03-25 14:25:56,498 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 14:25:56,498 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:25:56,498 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:25:56,498 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:25:56,498 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:25:56,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:25:56,499 INFO L82 PathProgramCache]: Analyzing trace with hash 170567890, now seen corresponding path program 1 times [2021-03-25 14:25:56,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:25:56,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083347198] [2021-03-25 14:25:56,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:25:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:25:56,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:56,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:25:56,632 INFO L142 QuantifierPusher]: treesize reduction 4, result has 90.5 percent of original size [2021-03-25 14:25:56,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 14:25:56,660 INFO L142 QuantifierPusher]: treesize reduction 14, result has 62.2 percent of original size [2021-03-25 14:25:56,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 14:25:56,680 INFO L142 QuantifierPusher]: treesize reduction 17, result has 74.6 percent of original size [2021-03-25 14:25:56,682 INFO L147 QuantifierPusher]: treesize reduction 9, result has 82.0 percent of original size 41 [2021-03-25 14:25:56,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:56,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 14:25:56,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:56,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:25:56,743 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 14:25:56,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083347198] [2021-03-25 14:25:56,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:25:56,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:25:56,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265566120] [2021-03-25 14:25:56,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:25:56,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:25:56,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:25:56,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:25:56,747 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 215 [2021-03-25 14:25:56,748 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 57 transitions, 421 flow. Second operand has 8 states, 8 states have (on average 156.0) internal successors, (1248), 8 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 14:25:56,748 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:25:56,748 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 215 [2021-03-25 14:25:56,748 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:25:56,936 INFO L129 PetriNetUnfolder]: 157/365 cut-off events. [2021-03-25 14:25:56,936 INFO L130 PetriNetUnfolder]: For 1617/1810 co-relation queries the response was YES. [2021-03-25 14:25:56,937 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 365 events. 157/365 cut-off events. For 1617/1810 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 1960 event pairs, 5 based on Foata normal form. 15/352 useless extension candidates. Maximal degree in co-relation 1279. Up to 110 conditions per place. [2021-03-25 14:25:56,938 INFO L132 encePairwiseOnDemand]: 209/215 looper letters, 10 selfloop transitions, 7 changer transitions 10/55 dead transitions. [2021-03-25 14:25:56,938 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 55 transitions, 452 flow [2021-03-25 14:25:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:25:56,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:25:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 947 transitions. [2021-03-25 14:25:56,941 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.734108527131783 [2021-03-25 14:25:56,942 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 947 transitions. [2021-03-25 14:25:56,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 947 transitions. [2021-03-25 14:25:56,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:25:56,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 947 transitions. [2021-03-25 14:25:56,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 0 states have call successors, (0), 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 14:25:56,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 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 14:25:56,947 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 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 14:25:56,947 INFO L185 Difference]: Start difference. First operand has 83 places, 57 transitions, 421 flow. Second operand 6 states and 947 transitions. [2021-03-25 14:25:56,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 55 transitions, 452 flow [2021-03-25 14:25:56,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 55 transitions, 427 flow, removed 7 selfloop flow, removed 8 redundant places. [2021-03-25 14:25:56,953 INFO L241 Difference]: Finished difference. Result has 77 places, 44 transitions, 312 flow [2021-03-25 14:25:56,953 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=77, PETRI_TRANSITIONS=44} [2021-03-25 14:25:56,953 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 17 predicate places. [2021-03-25 14:25:56,953 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:56,954 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 44 transitions, 312 flow [2021-03-25 14:25:56,954 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 44 transitions, 312 flow [2021-03-25 14:25:56,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 44 transitions, 312 flow [2021-03-25 14:25:56,974 INFO L129 PetriNetUnfolder]: 80/193 cut-off events. [2021-03-25 14:25:56,975 INFO L130 PetriNetUnfolder]: For 602/636 co-relation queries the response was YES. [2021-03-25 14:25:56,975 INFO L84 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 193 events. 80/193 cut-off events. For 602/636 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 835 event pairs, 4 based on Foata normal form. 3/186 useless extension candidates. Maximal degree in co-relation 642. Up to 62 conditions per place. [2021-03-25 14:25:56,977 INFO L142 LiptonReduction]: Number of co-enabled transitions 404 [2021-03-25 14:25:57,624 WARN L205 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 180 [2021-03-25 14:25:58,201 WARN L205 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 177 [2021-03-25 14:25:59,536 WARN L205 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 304 DAG size of output: 260 [2021-03-25 14:26:00,123 WARN L205 SmtUtils]: Spent 585.00 ms on a formula simplification that was a NOOP. DAG size: 257 [2021-03-25 14:26:00,151 INFO L154 LiptonReduction]: Checked pairs total: 67 [2021-03-25 14:26:00,151 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:26:00,151 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3198 [2021-03-25 14:26:00,152 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 43 transitions, 317 flow [2021-03-25 14:26:00,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 156.0) internal successors, (1248), 8 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 14:26:00,152 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:00,152 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 14:26:00,152 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:26:00,152 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:00,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:00,153 INFO L82 PathProgramCache]: Analyzing trace with hash -265254949, now seen corresponding path program 1 times [2021-03-25 14:26:00,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:00,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731708627] [2021-03-25 14:26:00,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:26:00,202 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:26:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:26:00,260 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:26:00,301 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:26:00,301 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:26:00,301 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 14:26:00,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:26:00 BasicIcfg [2021-03-25 14:26:00,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:26:00,439 INFO L168 Benchmark]: Toolchain (without parser) took 38447.56 ms. Allocated memory was 339.7 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 302.8 MB in the beginning and 984.9 MB in the end (delta: -682.1 MB). Peak memory consumption was 565.5 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:00,439 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 339.7 MB. Free memory was 321.3 MB in the beginning and 321.2 MB in the end (delta: 69.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:26:00,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 553.50 ms. Allocated memory is still 339.7 MB. Free memory was 302.6 MB in the beginning and 297.4 MB in the end (delta: 5.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:00,439 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.58 ms. Allocated memory is still 339.7 MB. Free memory was 297.4 MB in the beginning and 295.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:00,440 INFO L168 Benchmark]: Boogie Preprocessor took 51.39 ms. Allocated memory is still 339.7 MB. Free memory was 295.3 MB in the beginning and 291.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:00,440 INFO L168 Benchmark]: RCFGBuilder took 2146.41 ms. Allocated memory is still 339.7 MB. Free memory was 291.1 MB in the beginning and 222.5 MB in the end (delta: 68.7 MB). Peak memory consumption was 158.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:00,440 INFO L168 Benchmark]: TraceAbstraction took 35605.01 ms. Allocated memory was 339.7 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 221.4 MB in the beginning and 984.9 MB in the end (delta: -763.5 MB). Peak memory consumption was 483.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:00,441 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 339.7 MB. Free memory was 321.3 MB in the beginning and 321.2 MB in the end (delta: 69.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 553.50 ms. Allocated memory is still 339.7 MB. Free memory was 302.6 MB in the beginning and 297.4 MB in the end (delta: 5.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 82.58 ms. Allocated memory is still 339.7 MB. Free memory was 297.4 MB in the beginning and 295.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 51.39 ms. Allocated memory is still 339.7 MB. Free memory was 295.3 MB in the beginning and 291.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2146.41 ms. Allocated memory is still 339.7 MB. Free memory was 291.1 MB in the beginning and 222.5 MB in the end (delta: 68.7 MB). Peak memory consumption was 158.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 35605.01 ms. Allocated memory was 339.7 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 221.4 MB in the beginning and 984.9 MB in the end (delta: -763.5 MB). Peak memory consumption was 483.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3655.3ms, 125 PlacesBefore, 60 PlacesAfterwards, 114 TransitionsBefore, 48 TransitionsAfterwards, 2774 CoEnabledTransitionPairs, 5 FixpointIterations, 30 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 72 TotalNumberOfCompositions, 4931 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2389, positive: 2284, positive conditional: 0, positive unconditional: 2284, negative: 105, negative conditional: 0, negative unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1667, positive: 1614, positive conditional: 0, positive unconditional: 1614, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1667, positive: 1614, positive conditional: 0, positive unconditional: 1614, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1667, positive: 1611, positive conditional: 0, positive unconditional: 1611, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 56, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 764, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 755, negative conditional: 0, negative unconditional: 755, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2389, positive: 670, positive conditional: 0, positive unconditional: 670, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 1667, unknown conditional: 0, unknown unconditional: 1667] , Statistics on independence cache: Total cache size (in pairs): 279, Positive cache size: 244, Positive conditional cache size: 0, Positive unconditional cache size: 244, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1157.1ms, 56 PlacesBefore, 44 PlacesAfterwards, 45 TransitionsBefore, 33 TransitionsAfterwards, 618 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 2547 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 695, positive: 578, positive conditional: 0, positive unconditional: 578, negative: 117, negative conditional: 0, negative unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, positive: 98, positive conditional: 0, positive unconditional: 98, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 111, positive: 98, positive conditional: 0, positive unconditional: 98, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 111, positive: 93, positive conditional: 0, positive unconditional: 93, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 261, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 241, negative conditional: 0, negative unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 695, positive: 480, positive conditional: 0, positive unconditional: 480, negative: 104, negative conditional: 0, negative unconditional: 104, unknown: 111, unknown conditional: 0, unknown unconditional: 111] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 247, Positive conditional cache size: 0, Positive unconditional cache size: 247, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1408.8ms, 53 PlacesBefore, 46 PlacesAfterwards, 35 TransitionsBefore, 33 TransitionsAfterwards, 506 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1215 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 299, positive: 242, positive conditional: 0, positive unconditional: 242, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 299, positive: 223, positive conditional: 0, positive unconditional: 223, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 266, Positive conditional cache size: 0, Positive unconditional cache size: 266, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 461.6ms, 50 PlacesBefore, 50 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 740 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 850 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 203, positive: 173, positive conditional: 0, positive unconditional: 173, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 174, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 174, negative conditional: 0, negative unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 203, positive: 161, positive conditional: 0, positive unconditional: 161, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 294, Positive cache size: 253, Positive conditional cache size: 0, Positive unconditional cache size: 253, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 322.6ms, 51 PlacesBefore, 51 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 676 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 732 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 162, positive: 136, positive conditional: 0, positive unconditional: 136, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 162, positive: 131, positive conditional: 0, positive unconditional: 131, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 323, Positive cache size: 283, Positive conditional cache size: 0, Positive unconditional cache size: 283, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 475.6ms, 59 PlacesBefore, 59 PlacesAfterwards, 51 TransitionsBefore, 50 TransitionsAfterwards, 932 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1023 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 211, positive: 181, positive conditional: 0, positive unconditional: 181, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 164, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 164, negative conditional: 0, negative unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 211, positive: 161, positive conditional: 0, positive unconditional: 161, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , Statistics on independence cache: Total cache size (in pairs): 327, Positive cache size: 282, Positive conditional cache size: 0, Positive unconditional cache size: 282, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2568.2ms, 61 PlacesBefore, 61 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 1192 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 277 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 58, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 318, Positive cache size: 274, Positive conditional cache size: 0, Positive unconditional cache size: 274, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 366.1ms, 69 PlacesBefore, 69 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 1340 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 134 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 3, negative conditional: 0, negative unconditional: 3, 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 16, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 318, Positive cache size: 274, Positive conditional cache size: 0, Positive unconditional cache size: 274, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 623.5ms, 71 PlacesBefore, 71 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 1352 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 215 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 61, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 262, Positive conditional cache size: 0, Positive unconditional cache size: 262, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 697.3ms, 79 PlacesBefore, 79 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 1488 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 88 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 262, Positive conditional cache size: 0, Positive unconditional cache size: 262, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 841.4ms, 86 PlacesBefore, 86 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 1690 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 96 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 14, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 262, Positive conditional cache size: 0, Positive unconditional cache size: 262, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6406.9ms, 95 PlacesBefore, 93 PlacesAfterwards, 80 TransitionsBefore, 79 TransitionsAfterwards, 1572 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 190 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 38, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 268, Positive cache size: 243, Positive conditional cache size: 0, Positive unconditional cache size: 243, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1051.6ms, 91 PlacesBefore, 83 PlacesAfterwards, 60 TransitionsBefore, 57 TransitionsAfterwards, 734 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 72 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 72, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 72, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 215, Positive conditional cache size: 0, Positive unconditional cache size: 215, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3197.1ms, 77 PlacesBefore, 70 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 67 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 58, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 190, Positive conditional cache size: 0, Positive unconditional cache size: 190, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 - 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t681; [L867] FCALL, FORK 0 pthread_create(&t681, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t682; [L869] FCALL, FORK 0 pthread_create(&t682, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L788] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L870] 0 pthread_t t683; [L871] FCALL, FORK 0 pthread_create(&t683, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L872] 0 pthread_t t684; [L873] FCALL, FORK 0 pthread_create(&t684, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L802] 3 y = 1 [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L822] 4 z = 2 [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L833] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L833] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L834] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L834] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L835] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L835] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L836] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L837] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L837] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L838] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L844] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L844] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L844] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L808] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L879] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L879] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L879] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L886] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 117 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 35302.8ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 9806.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3750.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 99 SDtfs, 92 SDslu, 87 SDs, 0 SdLazy, 535 SolverSat, 127 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 663.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 613.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=695occurred in iteration=10, InterpolantAutomatonStates: 77, 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: 49.4ms SsaConstructionTime, 533.8ms SatisfiabilityAnalysisTime, 1230.7ms InterpolantComputationTime, 289 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 1865 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...