/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:24:35,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:24:35,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:24:35,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:24:35,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:24:35,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:24:35,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:24:35,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:24:35,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:24:35,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:24:35,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:24:35,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:24:35,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:24:35,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:24:35,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:24:35,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:24:35,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:24:35,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:24:35,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:24:35,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:24:35,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:24:35,756 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:24:35,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:24:35,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:24:35,765 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:24:35,765 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:24:35,765 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:24:35,766 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:24:35,766 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:24:35,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:24:35,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:24:35,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:24:35,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:24:35,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:24:35,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:24:35,770 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:24:35,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:24:35,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:24:35,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:24:35,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:24:35,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:24:35,777 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-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:24:35,810 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:24:35,810 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:24:35,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:24:35,814 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:24:35,814 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:24:35,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:24:35,814 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:24:35,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:24:35,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:24:35,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:24:35,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:24:35,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:24:35,816 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:24:35,816 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:24:35,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:24:35,816 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:24:35,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:24:35,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:24:35,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:24:35,816 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:24:35,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:24:35,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:24:35,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:24:35,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:24:35,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:24:35,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:24:35,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:24:35,818 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:24:35,818 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:24:35,818 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:24:35,818 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-26 00:24:36,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:24:36,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:24:36,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:24:36,133 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:24:36,134 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:24:36,135 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_power.oepc.i [2021-03-26 00:24:36,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1263053fc/796222504e1242e7afcda6e94d5626e0/FLAGa85cc8189 [2021-03-26 00:24:36,749 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:24:36,750 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.oepc.i [2021-03-26 00:24:36,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1263053fc/796222504e1242e7afcda6e94d5626e0/FLAGa85cc8189 [2021-03-26 00:24:37,058 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1263053fc/796222504e1242e7afcda6e94d5626e0 [2021-03-26 00:24:37,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:24:37,061 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:24:37,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:24:37,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:24:37,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:24:37,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:24:37" (1/1) ... [2021-03-26 00:24:37,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c7732b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:37, skipping insertion in model container [2021-03-26 00:24:37,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:24:37" (1/1) ... [2021-03-26 00:24:37,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:24:37,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:24:37,238 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/mix057_power.oepc.i[951,964] [2021-03-26 00:24:37,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:24:37,446 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:24:37,454 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/mix057_power.oepc.i[951,964] [2021-03-26 00:24:37,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:24:37,575 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:24:37,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:37 WrapperNode [2021-03-26 00:24:37,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:24:37,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:24:37,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:24:37,577 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:24:37,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:37" (1/1) ... [2021-03-26 00:24:37,608 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:37" (1/1) ... [2021-03-26 00:24:37,630 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:24:37,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:24:37,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:24:37,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:24:37,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:37" (1/1) ... [2021-03-26 00:24:37,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:37" (1/1) ... [2021-03-26 00:24:37,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:37" (1/1) ... [2021-03-26 00:24:37,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:37" (1/1) ... [2021-03-26 00:24:37,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:37" (1/1) ... [2021-03-26 00:24:37,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:37" (1/1) ... [2021-03-26 00:24:37,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:37" (1/1) ... [2021-03-26 00:24:37,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:24:37,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:24:37,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:24:37,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:24:37,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:37" (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-26 00:24:37,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:24:37,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:24:37,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:24:37,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:24:37,730 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:24:37,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:24:37,731 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:24:37,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:24:37,731 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:24:37,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:24:37,731 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:24:37,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:24:37,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:24:37,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:24:37,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:24:37,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:24:37,733 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:24:39,609 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:24:39,610 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:24:39,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:24:39 BoogieIcfgContainer [2021-03-26 00:24:39,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:24:39,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:24:39,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:24:39,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:24:39,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:24:37" (1/3) ... [2021-03-26 00:24:39,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ebdbba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:24:39, skipping insertion in model container [2021-03-26 00:24:39,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:37" (2/3) ... [2021-03-26 00:24:39,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ebdbba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:24:39, skipping insertion in model container [2021-03-26 00:24:39,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:24:39" (3/3) ... [2021-03-26 00:24:39,617 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_power.oepc.i [2021-03-26 00:24:39,623 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:24:39,626 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:24:39,627 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:24:39,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,671 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,671 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,672 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,672 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,672 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,672 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,672 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,673 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,675 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,675 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,675 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,675 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,675 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,675 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,678 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,678 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,678 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,678 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,681 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,681 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,682 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,682 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,685 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,685 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,685 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,685 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,686 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,686 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,686 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,686 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,686 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,687 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,687 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,687 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,688 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,692 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,708 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,708 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,708 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,708 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,708 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,708 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,710 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,710 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,710 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,710 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,712 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,712 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,714 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,715 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,716 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,716 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,716 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,716 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,717 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,718 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,719 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,722 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,722 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,722 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,732 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,732 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,732 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:39,734 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:24:39,749 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 00:24:39,777 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:24:39,778 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:24:39,778 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:24:39,778 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:24:39,778 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:24:39,778 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:24:39,778 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:24:39,778 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:24:39,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 114 transitions, 248 flow [2021-03-26 00:24:39,827 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2021-03-26 00:24:39,827 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:24:39,831 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 83 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-26 00:24:39,831 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 114 transitions, 248 flow [2021-03-26 00:24:39,835 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 110 transitions, 232 flow [2021-03-26 00:24:39,837 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:39,849 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 110 transitions, 232 flow [2021-03-26 00:24:39,852 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 110 transitions, 232 flow [2021-03-26 00:24:39,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 232 flow [2021-03-26 00:24:39,880 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2021-03-26 00:24:39,880 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:24:39,881 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 86 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-26 00:24:39,883 INFO L142 LiptonReduction]: Number of co-enabled transitions 2672 [2021-03-26 00:24:41,292 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:24:41,740 WARN L205 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:24:41,854 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:24:43,473 INFO L154 LiptonReduction]: Checked pairs total: 4891 [2021-03-26 00:24:43,473 INFO L156 LiptonReduction]: Total number of compositions: 74 [2021-03-26 00:24:43,476 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3639 [2021-03-26 00:24:43,487 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2021-03-26 00:24:43,487 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:24:43,488 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:43,488 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:24:43,489 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:24:43,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:43,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1028802545, now seen corresponding path program 1 times [2021-03-26 00:24:43,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:43,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661870827] [2021-03-26 00:24:43,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:43,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:43,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:24:43,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:43,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:43,754 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-26 00:24:43,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661870827] [2021-03-26 00:24:43,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:43,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:24:43,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531895855] [2021-03-26 00:24:43,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:24:43,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:43,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:24:43,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:24:43,777 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 188 [2021-03-26 00:24:43,783 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:43,783 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:43,783 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 188 [2021-03-26 00:24:43,784 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:43,906 INFO L129 PetriNetUnfolder]: 133/296 cut-off events. [2021-03-26 00:24:43,906 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:24:43,908 INFO L84 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 296 events. 133/296 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1435 event pairs, 110 based on Foata normal form. 33/316 useless extension candidates. Maximal degree in co-relation 496. Up to 153 conditions per place. [2021-03-26 00:24:43,911 INFO L132 encePairwiseOnDemand]: 184/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2021-03-26 00:24:43,911 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 132 flow [2021-03-26 00:24:43,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:24:43,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:24:43,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2021-03-26 00:24:43,928 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9113475177304965 [2021-03-26 00:24:43,929 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 514 transitions. [2021-03-26 00:24:43,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 514 transitions. [2021-03-26 00:24:43,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:43,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 514 transitions. [2021-03-26 00:24:43,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:43,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:43,953 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:43,955 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 514 transitions. [2021-03-26 00:24:43,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 132 flow [2021-03-26 00:24:43,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 47 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:24:43,959 INFO L241 Difference]: Finished difference. Result has 53 places, 42 transitions, 96 flow [2021-03-26 00:24:43,960 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2021-03-26 00:24:43,961 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2021-03-26 00:24:43,961 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:43,961 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 42 transitions, 96 flow [2021-03-26 00:24:43,962 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 42 transitions, 96 flow [2021-03-26 00:24:43,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 42 transitions, 96 flow [2021-03-26 00:24:43,966 INFO L129 PetriNetUnfolder]: 0/42 cut-off events. [2021-03-26 00:24:43,967 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:24:43,967 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 42 events. 0/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:24:43,967 INFO L142 LiptonReduction]: Number of co-enabled transitions 608 [2021-03-26 00:24:45,413 INFO L154 LiptonReduction]: Checked pairs total: 2552 [2021-03-26 00:24:45,413 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-26 00:24:45,413 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1452 [2021-03-26 00:24:45,415 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2021-03-26 00:24:45,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:45,416 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:45,416 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:24:45,416 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:24:45,416 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:24:45,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:45,416 INFO L82 PathProgramCache]: Analyzing trace with hash -135319801, now seen corresponding path program 1 times [2021-03-26 00:24:45,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:45,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685716012] [2021-03-26 00:24:45,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:45,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:45,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:24:45,525 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:24:45,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:24:45,535 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:24:45,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:24:45,538 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-26 00:24:45,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685716012] [2021-03-26 00:24:45,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:45,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:24:45,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304339260] [2021-03-26 00:24:45,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:24:45,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:45,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:24:45,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:24:45,541 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 199 [2021-03-26 00:24:45,542 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:45,542 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:45,542 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 199 [2021-03-26 00:24:45,542 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:45,717 INFO L129 PetriNetUnfolder]: 523/1139 cut-off events. [2021-03-26 00:24:45,718 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:24:45,722 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1952 conditions, 1139 events. 523/1139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 7902 event pairs, 106 based on Foata normal form. 0/1062 useless extension candidates. Maximal degree in co-relation 1941. Up to 264 conditions per place. [2021-03-26 00:24:45,728 INFO L132 encePairwiseOnDemand]: 189/199 looper letters, 9 selfloop transitions, 8 changer transitions 17/53 dead transitions. [2021-03-26 00:24:45,728 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 184 flow [2021-03-26 00:24:45,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:24:45,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:24:45,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 799 transitions. [2021-03-26 00:24:45,732 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8030150753768844 [2021-03-26 00:24:45,732 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 799 transitions. [2021-03-26 00:24:45,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 799 transitions. [2021-03-26 00:24:45,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:45,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 799 transitions. [2021-03-26 00:24:45,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 159.8) internal successors, (799), 5 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:45,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:45,737 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:45,737 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 5 states and 799 transitions. [2021-03-26 00:24:45,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 184 flow [2021-03-26 00:24:45,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:24:45,739 INFO L241 Difference]: Finished difference. Result has 48 places, 36 transitions, 142 flow [2021-03-26 00:24:45,739 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2021-03-26 00:24:45,740 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -9 predicate places. [2021-03-26 00:24:45,740 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:45,740 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 36 transitions, 142 flow [2021-03-26 00:24:45,740 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 36 transitions, 142 flow [2021-03-26 00:24:45,741 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 36 transitions, 142 flow [2021-03-26 00:24:45,841 INFO L129 PetriNetUnfolder]: 284/686 cut-off events. [2021-03-26 00:24:45,842 INFO L130 PetriNetUnfolder]: For 213/221 co-relation queries the response was YES. [2021-03-26 00:24:45,843 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1573 conditions, 686 events. 284/686 cut-off events. For 213/221 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4573 event pairs, 94 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 1561. Up to 263 conditions per place. [2021-03-26 00:24:45,850 INFO L142 LiptonReduction]: Number of co-enabled transitions 532 [2021-03-26 00:24:46,600 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-26 00:24:46,745 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:24:47,070 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-26 00:24:47,217 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:24:47,282 INFO L154 LiptonReduction]: Checked pairs total: 670 [2021-03-26 00:24:47,282 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:24:47,283 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1543 [2021-03-26 00:24:47,284 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 140 flow [2021-03-26 00:24:47,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:47,284 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:47,285 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:24:47,285 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:24:47,285 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:24:47,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:47,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1486756277, now seen corresponding path program 1 times [2021-03-26 00:24:47,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:47,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988730595] [2021-03-26 00:24:47,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:47,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:47,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:24:47,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:47,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:47,374 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-26 00:24:47,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988730595] [2021-03-26 00:24:47,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:47,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:24:47,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773968611] [2021-03-26 00:24:47,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:24:47,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:47,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:24:47,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:24:47,376 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 200 [2021-03-26 00:24:47,384 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:47,384 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:47,384 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 200 [2021-03-26 00:24:47,384 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:47,473 INFO L129 PetriNetUnfolder]: 239/599 cut-off events. [2021-03-26 00:24:47,473 INFO L130 PetriNetUnfolder]: For 357/466 co-relation queries the response was YES. [2021-03-26 00:24:47,476 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1490 conditions, 599 events. 239/599 cut-off events. For 357/466 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3780 event pairs, 71 based on Foata normal form. 8/592 useless extension candidates. Maximal degree in co-relation 1477. Up to 216 conditions per place. [2021-03-26 00:24:47,479 INFO L132 encePairwiseOnDemand]: 196/200 looper letters, 5 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2021-03-26 00:24:47,480 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 184 flow [2021-03-26 00:24:47,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:24:47,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:24:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2021-03-26 00:24:47,481 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8866666666666667 [2021-03-26 00:24:47,482 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 532 transitions. [2021-03-26 00:24:47,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 532 transitions. [2021-03-26 00:24:47,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:47,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 532 transitions. [2021-03-26 00:24:47,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:47,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:47,485 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:47,485 INFO L185 Difference]: Start difference. First operand has 43 places, 35 transitions, 140 flow. Second operand 3 states and 532 transitions. [2021-03-26 00:24:47,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 184 flow [2021-03-26 00:24:47,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 146 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-03-26 00:24:47,493 INFO L241 Difference]: Finished difference. Result has 42 places, 39 transitions, 151 flow [2021-03-26 00:24:47,494 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2021-03-26 00:24:47,494 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -15 predicate places. [2021-03-26 00:24:47,494 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:47,494 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 39 transitions, 151 flow [2021-03-26 00:24:47,495 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 39 transitions, 151 flow [2021-03-26 00:24:47,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 39 transitions, 151 flow [2021-03-26 00:24:47,587 INFO L129 PetriNetUnfolder]: 239/615 cut-off events. [2021-03-26 00:24:47,587 INFO L130 PetriNetUnfolder]: For 90/160 co-relation queries the response was YES. [2021-03-26 00:24:47,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 615 events. 239/615 cut-off events. For 90/160 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4068 event pairs, 67 based on Foata normal form. 0/601 useless extension candidates. Maximal degree in co-relation 1160. Up to 216 conditions per place. [2021-03-26 00:24:47,593 INFO L142 LiptonReduction]: Number of co-enabled transitions 606 [2021-03-26 00:24:47,707 INFO L154 LiptonReduction]: Checked pairs total: 395 [2021-03-26 00:24:47,707 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:24:47,708 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 213 [2021-03-26 00:24:47,713 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 151 flow [2021-03-26 00:24:47,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:47,713 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:47,713 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:24:47,714 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:24:47,714 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:24:47,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:47,714 INFO L82 PathProgramCache]: Analyzing trace with hash 40114371, now seen corresponding path program 1 times [2021-03-26 00:24:47,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:47,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479422180] [2021-03-26 00:24:47,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:47,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:47,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:47,791 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-26 00:24:47,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479422180] [2021-03-26 00:24:47,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:47,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:24:47,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609258773] [2021-03-26 00:24:47,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:24:47,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:47,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:24:47,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:24:47,793 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 200 [2021-03-26 00:24:47,794 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:47,794 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:47,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 200 [2021-03-26 00:24:47,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:47,851 INFO L129 PetriNetUnfolder]: 213/544 cut-off events. [2021-03-26 00:24:47,852 INFO L130 PetriNetUnfolder]: For 236/409 co-relation queries the response was YES. [2021-03-26 00:24:47,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 544 events. 213/544 cut-off events. For 236/409 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3362 event pairs, 38 based on Foata normal form. 5/535 useless extension candidates. Maximal degree in co-relation 1174. Up to 193 conditions per place. [2021-03-26 00:24:47,856 INFO L132 encePairwiseOnDemand]: 196/200 looper letters, 5 selfloop transitions, 5 changer transitions 0/43 dead transitions. [2021-03-26 00:24:47,856 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 187 flow [2021-03-26 00:24:47,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:24:47,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:24:47,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2021-03-26 00:24:47,858 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8866666666666667 [2021-03-26 00:24:47,858 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 532 transitions. [2021-03-26 00:24:47,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 532 transitions. [2021-03-26 00:24:47,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:47,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 532 transitions. [2021-03-26 00:24:47,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:47,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:47,861 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:47,861 INFO L185 Difference]: Start difference. First operand has 42 places, 39 transitions, 151 flow. Second operand 3 states and 532 transitions. [2021-03-26 00:24:47,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 187 flow [2021-03-26 00:24:47,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:24:47,864 INFO L241 Difference]: Finished difference. Result has 44 places, 43 transitions, 187 flow [2021-03-26 00:24:47,865 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=187, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2021-03-26 00:24:47,865 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -13 predicate places. [2021-03-26 00:24:47,865 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:47,865 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 43 transitions, 187 flow [2021-03-26 00:24:47,865 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 43 transitions, 187 flow [2021-03-26 00:24:47,866 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 187 flow [2021-03-26 00:24:47,915 INFO L129 PetriNetUnfolder]: 213/542 cut-off events. [2021-03-26 00:24:47,915 INFO L130 PetriNetUnfolder]: For 217/360 co-relation queries the response was YES. [2021-03-26 00:24:47,916 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1180 conditions, 542 events. 213/542 cut-off events. For 217/360 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3436 event pairs, 37 based on Foata normal form. 1/530 useless extension candidates. Maximal degree in co-relation 1168. Up to 193 conditions per place. [2021-03-26 00:24:47,921 INFO L142 LiptonReduction]: Number of co-enabled transitions 686 [2021-03-26 00:24:47,980 INFO L154 LiptonReduction]: Checked pairs total: 466 [2021-03-26 00:24:47,980 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:24:47,980 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 115 [2021-03-26 00:24:47,981 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 187 flow [2021-03-26 00:24:47,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:47,981 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:47,982 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:24:47,982 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:24:47,982 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:24:47,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:47,982 INFO L82 PathProgramCache]: Analyzing trace with hash 363493826, now seen corresponding path program 1 times [2021-03-26 00:24:47,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:47,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928805427] [2021-03-26 00:24:47,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:48,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:48,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:48,027 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-26 00:24:48,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928805427] [2021-03-26 00:24:48,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:48,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:24:48,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897115719] [2021-03-26 00:24:48,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:24:48,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:48,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:24:48,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:24:48,029 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 200 [2021-03-26 00:24:48,030 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:48,030 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:48,030 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 200 [2021-03-26 00:24:48,030 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:48,092 INFO L129 PetriNetUnfolder]: 190/507 cut-off events. [2021-03-26 00:24:48,092 INFO L130 PetriNetUnfolder]: For 422/653 co-relation queries the response was YES. [2021-03-26 00:24:48,094 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 507 events. 190/507 cut-off events. For 422/653 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3130 event pairs, 23 based on Foata normal form. 4/502 useless extension candidates. Maximal degree in co-relation 1182. Up to 176 conditions per place. [2021-03-26 00:24:48,096 INFO L132 encePairwiseOnDemand]: 196/200 looper letters, 5 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2021-03-26 00:24:48,096 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 47 transitions, 223 flow [2021-03-26 00:24:48,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:24:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:24:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2021-03-26 00:24:48,098 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8866666666666667 [2021-03-26 00:24:48,098 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 532 transitions. [2021-03-26 00:24:48,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 532 transitions. [2021-03-26 00:24:48,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:48,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 532 transitions. [2021-03-26 00:24:48,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:48,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:48,101 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:48,102 INFO L185 Difference]: Start difference. First operand has 44 places, 43 transitions, 187 flow. Second operand 3 states and 532 transitions. [2021-03-26 00:24:48,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 47 transitions, 223 flow [2021-03-26 00:24:48,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:24:48,104 INFO L241 Difference]: Finished difference. Result has 46 places, 47 transitions, 223 flow [2021-03-26 00:24:48,104 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=223, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2021-03-26 00:24:48,104 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -11 predicate places. [2021-03-26 00:24:48,105 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:48,105 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 47 transitions, 223 flow [2021-03-26 00:24:48,105 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 47 transitions, 223 flow [2021-03-26 00:24:48,105 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 47 transitions, 223 flow [2021-03-26 00:24:48,152 INFO L129 PetriNetUnfolder]: 190/491 cut-off events. [2021-03-26 00:24:48,152 INFO L130 PetriNetUnfolder]: For 268/381 co-relation queries the response was YES. [2021-03-26 00:24:48,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1185 conditions, 491 events. 190/491 cut-off events. For 268/381 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3003 event pairs, 36 based on Foata normal form. 0/483 useless extension candidates. Maximal degree in co-relation 1171. Up to 176 conditions per place. [2021-03-26 00:24:48,158 INFO L142 LiptonReduction]: Number of co-enabled transitions 746 [2021-03-26 00:24:48,216 INFO L154 LiptonReduction]: Checked pairs total: 500 [2021-03-26 00:24:48,216 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:24:48,216 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 111 [2021-03-26 00:24:48,220 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 223 flow [2021-03-26 00:24:48,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:48,220 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:48,220 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:24:48,220 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:24:48,220 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:24:48,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:48,221 INFO L82 PathProgramCache]: Analyzing trace with hash 849396282, now seen corresponding path program 1 times [2021-03-26 00:24:48,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:48,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180337148] [2021-03-26 00:24:48,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:48,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:48,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:24:48,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:48,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:48,270 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-26 00:24:48,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180337148] [2021-03-26 00:24:48,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:48,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:24:48,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546061520] [2021-03-26 00:24:48,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:24:48,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:48,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:24:48,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:24:48,272 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 200 [2021-03-26 00:24:48,273 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:48,273 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:48,273 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 200 [2021-03-26 00:24:48,273 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:48,336 INFO L129 PetriNetUnfolder]: 190/572 cut-off events. [2021-03-26 00:24:48,336 INFO L130 PetriNetUnfolder]: For 614/859 co-relation queries the response was YES. [2021-03-26 00:24:48,338 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 572 events. 190/572 cut-off events. For 614/859 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3909 event pairs, 23 based on Foata normal form. 14/577 useless extension candidates. Maximal degree in co-relation 1379. Up to 178 conditions per place. [2021-03-26 00:24:48,341 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 4 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2021-03-26 00:24:48,341 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 243 flow [2021-03-26 00:24:48,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:24:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:24:48,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions. [2021-03-26 00:24:48,343 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.885 [2021-03-26 00:24:48,343 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 531 transitions. [2021-03-26 00:24:48,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 531 transitions. [2021-03-26 00:24:48,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:48,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 531 transitions. [2021-03-26 00:24:48,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:48,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:48,347 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:48,347 INFO L185 Difference]: Start difference. First operand has 46 places, 47 transitions, 223 flow. Second operand 3 states and 531 transitions. [2021-03-26 00:24:48,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 243 flow [2021-03-26 00:24:48,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:24:48,350 INFO L241 Difference]: Finished difference. Result has 48 places, 47 transitions, 238 flow [2021-03-26 00:24:48,350 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2021-03-26 00:24:48,350 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -9 predicate places. [2021-03-26 00:24:48,350 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:48,350 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 47 transitions, 238 flow [2021-03-26 00:24:48,351 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 47 transitions, 238 flow [2021-03-26 00:24:48,351 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 47 transitions, 238 flow [2021-03-26 00:24:48,404 INFO L129 PetriNetUnfolder]: 190/558 cut-off events. [2021-03-26 00:24:48,404 INFO L130 PetriNetUnfolder]: For 616/727 co-relation queries the response was YES. [2021-03-26 00:24:48,405 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1344 conditions, 558 events. 190/558 cut-off events. For 616/727 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3791 event pairs, 31 based on Foata normal form. 1/551 useless extension candidates. Maximal degree in co-relation 1329. Up to 178 conditions per place. [2021-03-26 00:24:48,412 INFO L142 LiptonReduction]: Number of co-enabled transitions 746 [2021-03-26 00:24:48,450 INFO L154 LiptonReduction]: Checked pairs total: 436 [2021-03-26 00:24:48,451 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:24:48,451 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 101 [2021-03-26 00:24:48,452 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 238 flow [2021-03-26 00:24:48,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:48,453 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:48,453 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:24:48,453 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:24:48,453 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:24:48,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:48,453 INFO L82 PathProgramCache]: Analyzing trace with hash -751213849, now seen corresponding path program 1 times [2021-03-26 00:24:48,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:48,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760353900] [2021-03-26 00:24:48,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:48,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:48,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:24:48,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:48,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:48,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:24:48,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760353900] [2021-03-26 00:24:48,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:48,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:24:48,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613658394] [2021-03-26 00:24:48,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:24:48,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:48,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:24:48,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:24:48,512 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 200 [2021-03-26 00:24:48,513 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:48,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:48,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 200 [2021-03-26 00:24:48,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:48,634 INFO L129 PetriNetUnfolder]: 186/649 cut-off events. [2021-03-26 00:24:48,634 INFO L130 PetriNetUnfolder]: For 930/1144 co-relation queries the response was YES. [2021-03-26 00:24:48,636 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 649 events. 186/649 cut-off events. For 930/1144 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4890 event pairs, 24 based on Foata normal form. 15/655 useless extension candidates. Maximal degree in co-relation 1567. Up to 189 conditions per place. [2021-03-26 00:24:48,639 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 4 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2021-03-26 00:24:48,639 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 258 flow [2021-03-26 00:24:48,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:24:48,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:24:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions. [2021-03-26 00:24:48,641 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.885 [2021-03-26 00:24:48,641 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 531 transitions. [2021-03-26 00:24:48,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 531 transitions. [2021-03-26 00:24:48,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:48,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 531 transitions. [2021-03-26 00:24:48,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:48,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:48,644 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:48,644 INFO L185 Difference]: Start difference. First operand has 48 places, 47 transitions, 238 flow. Second operand 3 states and 531 transitions. [2021-03-26 00:24:48,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 258 flow [2021-03-26 00:24:48,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 248 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 00:24:48,649 INFO L241 Difference]: Finished difference. Result has 50 places, 47 transitions, 248 flow [2021-03-26 00:24:48,649 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2021-03-26 00:24:48,649 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -7 predicate places. [2021-03-26 00:24:48,649 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:48,649 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 47 transitions, 248 flow [2021-03-26 00:24:48,649 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 47 transitions, 248 flow [2021-03-26 00:24:48,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 47 transitions, 248 flow [2021-03-26 00:24:48,711 INFO L129 PetriNetUnfolder]: 186/655 cut-off events. [2021-03-26 00:24:48,711 INFO L130 PetriNetUnfolder]: For 794/853 co-relation queries the response was YES. [2021-03-26 00:24:48,713 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 655 events. 186/655 cut-off events. For 794/853 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5029 event pairs, 39 based on Foata normal form. 1/648 useless extension candidates. Maximal degree in co-relation 1545. Up to 189 conditions per place. [2021-03-26 00:24:48,719 INFO L142 LiptonReduction]: Number of co-enabled transitions 746 [2021-03-26 00:24:48,786 INFO L154 LiptonReduction]: Checked pairs total: 507 [2021-03-26 00:24:48,786 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:24:48,786 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 137 [2021-03-26 00:24:48,790 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 248 flow [2021-03-26 00:24:48,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:48,791 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:48,791 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:24:48,791 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:24:48,791 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:24:48,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:48,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1817631073, now seen corresponding path program 1 times [2021-03-26 00:24:48,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:48,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730653852] [2021-03-26 00:24:48,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:48,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:48,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:48,852 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:24:48,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:24:48,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:48,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:24:48,861 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-26 00:24:48,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730653852] [2021-03-26 00:24:48,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:48,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:24:48,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538523652] [2021-03-26 00:24:48,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:24:48,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:48,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:24:48,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:24:48,863 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 200 [2021-03-26 00:24:48,863 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 248 flow. Second operand has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:48,864 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:48,864 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 200 [2021-03-26 00:24:48,864 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:49,222 INFO L129 PetriNetUnfolder]: 2081/3931 cut-off events. [2021-03-26 00:24:49,222 INFO L130 PetriNetUnfolder]: For 2031/2419 co-relation queries the response was YES. [2021-03-26 00:24:49,240 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8558 conditions, 3931 events. 2081/3931 cut-off events. For 2031/2419 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 33641 event pairs, 778 based on Foata normal form. 266/3477 useless extension candidates. Maximal degree in co-relation 8540. Up to 2770 conditions per place. [2021-03-26 00:24:49,258 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 12 selfloop transitions, 10 changer transitions 0/61 dead transitions. [2021-03-26 00:24:49,258 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 320 flow [2021-03-26 00:24:49,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:24:49,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:24:49,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 839 transitions. [2021-03-26 00:24:49,261 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.839 [2021-03-26 00:24:49,261 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 839 transitions. [2021-03-26 00:24:49,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 839 transitions. [2021-03-26 00:24:49,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:49,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 839 transitions. [2021-03-26 00:24:49,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:49,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:49,265 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:49,265 INFO L185 Difference]: Start difference. First operand has 50 places, 47 transitions, 248 flow. Second operand 5 states and 839 transitions. [2021-03-26 00:24:49,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 320 flow [2021-03-26 00:24:49,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 310 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 00:24:49,268 INFO L241 Difference]: Finished difference. Result has 56 places, 56 transitions, 313 flow [2021-03-26 00:24:49,268 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2021-03-26 00:24:49,268 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2021-03-26 00:24:49,268 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:49,269 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 56 transitions, 313 flow [2021-03-26 00:24:49,269 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 56 transitions, 313 flow [2021-03-26 00:24:49,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 56 transitions, 313 flow [2021-03-26 00:24:49,538 INFO L129 PetriNetUnfolder]: 1593/3197 cut-off events. [2021-03-26 00:24:49,539 INFO L130 PetriNetUnfolder]: For 3539/4451 co-relation queries the response was YES. [2021-03-26 00:24:49,555 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9339 conditions, 3197 events. 1593/3197 cut-off events. For 3539/4451 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 28179 event pairs, 698 based on Foata normal form. 28/2931 useless extension candidates. Maximal degree in co-relation 9319. Up to 2170 conditions per place. [2021-03-26 00:24:49,589 INFO L142 LiptonReduction]: Number of co-enabled transitions 1128 [2021-03-26 00:24:51,389 INFO L154 LiptonReduction]: Checked pairs total: 988 [2021-03-26 00:24:51,389 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:24:51,389 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2121 [2021-03-26 00:24:51,390 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 307 flow [2021-03-26 00:24:51,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:51,391 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:51,391 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:24:51,391 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:24:51,391 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:24:51,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:51,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1395256338, now seen corresponding path program 1 times [2021-03-26 00:24:51,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:51,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382511938] [2021-03-26 00:24:51,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:51,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:51,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:24:51,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:51,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:51,425 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:24:51,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:24:51,435 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-26 00:24:51,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382511938] [2021-03-26 00:24:51,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:51,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:24:51,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60484200] [2021-03-26 00:24:51,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:24:51,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:51,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:24:51,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:24:51,437 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 200 [2021-03-26 00:24:51,437 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 307 flow. Second operand has 4 states, 4 states have (on average 158.25) internal successors, (633), 4 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:51,438 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:51,438 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 200 [2021-03-26 00:24:51,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:51,804 INFO L129 PetriNetUnfolder]: 2001/3820 cut-off events. [2021-03-26 00:24:51,804 INFO L130 PetriNetUnfolder]: For 5475/7291 co-relation queries the response was YES. [2021-03-26 00:24:51,823 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11463 conditions, 3820 events. 2001/3820 cut-off events. For 5475/7291 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 32477 event pairs, 1006 based on Foata normal form. 113/3535 useless extension candidates. Maximal degree in co-relation 11441. Up to 2719 conditions per place. [2021-03-26 00:24:51,895 INFO L132 encePairwiseOnDemand]: 191/200 looper letters, 27 selfloop transitions, 17 changer transitions 0/67 dead transitions. [2021-03-26 00:24:51,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 67 transitions, 477 flow [2021-03-26 00:24:51,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:24:51,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:24:51,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 651 transitions. [2021-03-26 00:24:51,897 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.81375 [2021-03-26 00:24:51,898 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 651 transitions. [2021-03-26 00:24:51,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 651 transitions. [2021-03-26 00:24:51,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:51,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 651 transitions. [2021-03-26 00:24:51,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:51,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:51,901 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:51,901 INFO L185 Difference]: Start difference. First operand has 56 places, 55 transitions, 307 flow. Second operand 4 states and 651 transitions. [2021-03-26 00:24:51,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 67 transitions, 477 flow [2021-03-26 00:24:51,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 67 transitions, 470 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:24:51,941 INFO L241 Difference]: Finished difference. Result has 58 places, 60 transitions, 424 flow [2021-03-26 00:24:51,941 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=424, PETRI_PLACES=58, PETRI_TRANSITIONS=60} [2021-03-26 00:24:51,941 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 1 predicate places. [2021-03-26 00:24:51,941 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:51,941 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 60 transitions, 424 flow [2021-03-26 00:24:51,941 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 60 transitions, 424 flow [2021-03-26 00:24:51,942 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 424 flow [2021-03-26 00:24:52,205 INFO L129 PetriNetUnfolder]: 1940/3719 cut-off events. [2021-03-26 00:24:52,205 INFO L130 PetriNetUnfolder]: For 4416/5234 co-relation queries the response was YES. [2021-03-26 00:24:52,221 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10790 conditions, 3719 events. 1940/3719 cut-off events. For 4416/5234 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 32083 event pairs, 973 based on Foata normal form. 8/3383 useless extension candidates. Maximal degree in co-relation 10767. Up to 2626 conditions per place. [2021-03-26 00:24:52,257 INFO L142 LiptonReduction]: Number of co-enabled transitions 1098 [2021-03-26 00:24:54,527 INFO L154 LiptonReduction]: Checked pairs total: 574 [2021-03-26 00:24:54,527 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:24:54,527 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2586 [2021-03-26 00:24:54,528 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 60 transitions, 424 flow [2021-03-26 00:24:54,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 158.25) internal successors, (633), 4 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:54,529 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:54,529 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:24:54,529 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:24:54,529 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:24:54,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:54,529 INFO L82 PathProgramCache]: Analyzing trace with hash -957705454, now seen corresponding path program 1 times [2021-03-26 00:24:54,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:54,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46991309] [2021-03-26 00:24:54,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:54,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:54,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:54,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:54,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:54,569 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:24:54,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:24:54,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:54,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:24:54,576 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-26 00:24:54,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46991309] [2021-03-26 00:24:54,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:54,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:24:54,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250078815] [2021-03-26 00:24:54,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:24:54,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:54,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:24:54,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:24:54,578 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 200 [2021-03-26 00:24:54,579 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 60 transitions, 424 flow. Second operand has 5 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:54,579 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:54,579 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 200 [2021-03-26 00:24:54,579 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:55,014 INFO L129 PetriNetUnfolder]: 2322/4409 cut-off events. [2021-03-26 00:24:55,014 INFO L130 PetriNetUnfolder]: For 4586/8522 co-relation queries the response was YES. [2021-03-26 00:24:55,029 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15775 conditions, 4409 events. 2322/4409 cut-off events. For 4586/8522 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 37347 event pairs, 308 based on Foata normal form. 675/4661 useless extension candidates. Maximal degree in co-relation 15750. Up to 3230 conditions per place. [2021-03-26 00:24:55,048 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 13 selfloop transitions, 14 changer transitions 0/75 dead transitions. [2021-03-26 00:24:55,048 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 75 transitions, 558 flow [2021-03-26 00:24:55,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:24:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:24:55,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1007 transitions. [2021-03-26 00:24:55,051 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8391666666666666 [2021-03-26 00:24:55,051 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1007 transitions. [2021-03-26 00:24:55,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1007 transitions. [2021-03-26 00:24:55,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:55,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1007 transitions. [2021-03-26 00:24:55,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 167.83333333333334) internal successors, (1007), 6 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:55,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:55,056 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:55,056 INFO L185 Difference]: Start difference. First operand has 58 places, 60 transitions, 424 flow. Second operand 6 states and 1007 transitions. [2021-03-26 00:24:55,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 75 transitions, 558 flow [2021-03-26 00:24:55,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 75 transitions, 554 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-03-26 00:24:55,062 INFO L241 Difference]: Finished difference. Result has 66 places, 69 transitions, 540 flow [2021-03-26 00:24:55,062 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=540, PETRI_PLACES=66, PETRI_TRANSITIONS=69} [2021-03-26 00:24:55,062 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2021-03-26 00:24:55,062 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:55,062 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 69 transitions, 540 flow [2021-03-26 00:24:55,062 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 69 transitions, 540 flow [2021-03-26 00:24:55,063 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 69 transitions, 540 flow [2021-03-26 00:24:55,283 INFO L129 PetriNetUnfolder]: 1556/3248 cut-off events. [2021-03-26 00:24:55,283 INFO L130 PetriNetUnfolder]: For 7971/9976 co-relation queries the response was YES. [2021-03-26 00:24:55,294 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14331 conditions, 3248 events. 1556/3248 cut-off events. For 7971/9976 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 28175 event pairs, 290 based on Foata normal form. 80/3163 useless extension candidates. Maximal degree in co-relation 14303. Up to 2463 conditions per place. [2021-03-26 00:24:55,327 INFO L142 LiptonReduction]: Number of co-enabled transitions 1536 [2021-03-26 00:25:00,055 INFO L154 LiptonReduction]: Checked pairs total: 1568 [2021-03-26 00:25:00,055 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:25:00,055 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4993 [2021-03-26 00:25:00,056 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 532 flow [2021-03-26 00:25:00,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:00,056 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:00,057 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:00,057 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:25:00,057 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:00,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:00,057 INFO L82 PathProgramCache]: Analyzing trace with hash -341577538, now seen corresponding path program 1 times [2021-03-26 00:25:00,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:00,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718049531] [2021-03-26 00:25:00,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:00,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:00,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:00,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:00,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:00,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:00,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:00,110 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:25:00,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:25:00,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:00,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:25:00,117 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-26 00:25:00,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718049531] [2021-03-26 00:25:00,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:00,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:25:00,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708891355] [2021-03-26 00:25:00,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:25:00,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:00,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:25:00,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:25:00,119 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 200 [2021-03-26 00:25:00,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 68 transitions, 532 flow. Second operand has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:00,120 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:00,120 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 200 [2021-03-26 00:25:00,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:00,444 INFO L129 PetriNetUnfolder]: 1620/3156 cut-off events. [2021-03-26 00:25:00,444 INFO L130 PetriNetUnfolder]: For 8925/13785 co-relation queries the response was YES. [2021-03-26 00:25:00,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15148 conditions, 3156 events. 1620/3156 cut-off events. For 8925/13785 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 24961 event pairs, 44 based on Foata normal form. 693/3514 useless extension candidates. Maximal degree in co-relation 15118. Up to 2224 conditions per place. [2021-03-26 00:25:00,462 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 10 selfloop transitions, 18 changer transitions 4/80 dead transitions. [2021-03-26 00:25:00,462 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 80 transitions, 688 flow [2021-03-26 00:25:00,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:25:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:25:00,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1175 transitions. [2021-03-26 00:25:00,469 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8392857142857143 [2021-03-26 00:25:00,469 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1175 transitions. [2021-03-26 00:25:00,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1175 transitions. [2021-03-26 00:25:00,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:00,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1175 transitions. [2021-03-26 00:25:00,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 167.85714285714286) internal successors, (1175), 7 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:00,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:00,477 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:00,477 INFO L185 Difference]: Start difference. First operand has 66 places, 68 transitions, 532 flow. Second operand 7 states and 1175 transitions. [2021-03-26 00:25:00,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 80 transitions, 688 flow [2021-03-26 00:25:00,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 80 transitions, 626 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 00:25:00,570 INFO L241 Difference]: Finished difference. Result has 69 places, 73 transitions, 592 flow [2021-03-26 00:25:00,571 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=592, PETRI_PLACES=69, PETRI_TRANSITIONS=73} [2021-03-26 00:25:00,571 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2021-03-26 00:25:00,571 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:00,571 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 73 transitions, 592 flow [2021-03-26 00:25:00,571 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 73 transitions, 592 flow [2021-03-26 00:25:00,572 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 73 transitions, 592 flow [2021-03-26 00:25:00,691 INFO L129 PetriNetUnfolder]: 812/1945 cut-off events. [2021-03-26 00:25:00,691 INFO L130 PetriNetUnfolder]: For 5035/5403 co-relation queries the response was YES. [2021-03-26 00:25:00,696 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8548 conditions, 1945 events. 812/1945 cut-off events. For 5035/5403 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 16168 event pairs, 45 based on Foata normal form. 5/1859 useless extension candidates. Maximal degree in co-relation 8519. Up to 1283 conditions per place. [2021-03-26 00:25:00,711 INFO L142 LiptonReduction]: Number of co-enabled transitions 1416 [2021-03-26 00:25:02,043 INFO L154 LiptonReduction]: Checked pairs total: 1758 [2021-03-26 00:25:02,044 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:25:02,044 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1473 [2021-03-26 00:25:02,045 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 72 transitions, 582 flow [2021-03-26 00:25:02,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:02,045 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:02,045 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-26 00:25:02,045 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:25:02,046 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:02,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:02,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1787982463, now seen corresponding path program 1 times [2021-03-26 00:25:02,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:02,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442138267] [2021-03-26 00:25:02,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:02,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:02,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:02,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:02,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:02,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:02,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:02,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:02,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:02,144 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:25:02,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:25:02,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:02,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:25:02,152 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-26 00:25:02,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442138267] [2021-03-26 00:25:02,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:02,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:25:02,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742053798] [2021-03-26 00:25:02,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:25:02,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:02,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:25:02,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:25:02,155 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 200 [2021-03-26 00:25:02,156 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 72 transitions, 582 flow. Second operand has 7 states, 7 states have (on average 163.85714285714286) internal successors, (1147), 7 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:02,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:02,156 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 200 [2021-03-26 00:25:02,156 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:02,463 INFO L129 PetriNetUnfolder]: 1330/2514 cut-off events. [2021-03-26 00:25:02,464 INFO L130 PetriNetUnfolder]: For 6831/10085 co-relation queries the response was YES. [2021-03-26 00:25:02,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11231 conditions, 2514 events. 1330/2514 cut-off events. For 6831/10085 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 18443 event pairs, 12 based on Foata normal form. 389/2586 useless extension candidates. Maximal degree in co-relation 11200. Up to 1448 conditions per place. [2021-03-26 00:25:02,479 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 6 selfloop transitions, 18 changer transitions 6/77 dead transitions. [2021-03-26 00:25:02,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 77 transitions, 648 flow [2021-03-26 00:25:02,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:25:02,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:25:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1335 transitions. [2021-03-26 00:25:02,482 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.834375 [2021-03-26 00:25:02,482 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1335 transitions. [2021-03-26 00:25:02,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1335 transitions. [2021-03-26 00:25:02,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:02,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1335 transitions. [2021-03-26 00:25:02,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 166.875) internal successors, (1335), 8 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:02,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:02,489 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:02,489 INFO L185 Difference]: Start difference. First operand has 69 places, 72 transitions, 582 flow. Second operand 8 states and 1335 transitions. [2021-03-26 00:25:02,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 77 transitions, 648 flow [2021-03-26 00:25:02,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 77 transitions, 601 flow, removed 17 selfloop flow, removed 4 redundant places. [2021-03-26 00:25:02,572 INFO L241 Difference]: Finished difference. Result has 73 places, 68 transitions, 541 flow [2021-03-26 00:25:02,572 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=541, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2021-03-26 00:25:02,572 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places. [2021-03-26 00:25:02,572 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:02,572 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 68 transitions, 541 flow [2021-03-26 00:25:02,573 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 68 transitions, 541 flow [2021-03-26 00:25:02,573 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 68 transitions, 541 flow [2021-03-26 00:25:02,657 INFO L129 PetriNetUnfolder]: 517/1293 cut-off events. [2021-03-26 00:25:02,657 INFO L130 PetriNetUnfolder]: For 2979/3256 co-relation queries the response was YES. [2021-03-26 00:25:02,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5259 conditions, 1293 events. 517/1293 cut-off events. For 2979/3256 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 10074 event pairs, 18 based on Foata normal form. 4/1226 useless extension candidates. Maximal degree in co-relation 5228. Up to 485 conditions per place. [2021-03-26 00:25:02,669 INFO L142 LiptonReduction]: Number of co-enabled transitions 1120 [2021-03-26 00:25:03,103 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:25:03,268 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:25:03,697 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:25:03,924 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:25:04,061 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:25:04,222 INFO L154 LiptonReduction]: Checked pairs total: 2036 [2021-03-26 00:25:04,222 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:25:04,222 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1650 [2021-03-26 00:25:04,223 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 525 flow [2021-03-26 00:25:04,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 163.85714285714286) internal successors, (1147), 7 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:04,223 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:04,223 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:04,224 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:25:04,224 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:04,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:04,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1327581195, now seen corresponding path program 1 times [2021-03-26 00:25:04,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:04,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119285884] [2021-03-26 00:25:04,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:25:04,271 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:25:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:25:04,334 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:25:04,375 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:25:04,376 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:25:04,376 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:25:04,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:25:04 BasicIcfg [2021-03-26 00:25:04,483 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:25:04,489 INFO L168 Benchmark]: Toolchain (without parser) took 27421.99 ms. Allocated memory was 255.9 MB in the beginning and 771.8 MB in the end (delta: 515.9 MB). Free memory was 232.3 MB in the beginning and 386.4 MB in the end (delta: -154.2 MB). Peak memory consumption was 360.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:25:04,489 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 255.9 MB. Free memory was 237.6 MB in the beginning and 237.4 MB in the end (delta: 178.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:25:04,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 514.16 ms. Allocated memory was 255.9 MB in the beginning and 375.4 MB in the end (delta: 119.5 MB). Free memory was 232.3 MB in the beginning and 334.3 MB in the end (delta: -102.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:25:04,490 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.39 ms. Allocated memory is still 375.4 MB. Free memory was 334.3 MB in the beginning and 331.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:25:04,490 INFO L168 Benchmark]: Boogie Preprocessor took 33.21 ms. Allocated memory is still 375.4 MB. Free memory was 331.7 MB in the beginning and 329.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:25:04,490 INFO L168 Benchmark]: RCFGBuilder took 1946.83 ms. Allocated memory is still 375.4 MB. Free memory was 329.2 MB in the beginning and 308.5 MB in the end (delta: 20.6 MB). Peak memory consumption was 119.4 MB. Max. memory is 16.0 GB. [2021-03-26 00:25:04,491 INFO L168 Benchmark]: TraceAbstraction took 24870.15 ms. Allocated memory was 375.4 MB in the beginning and 771.8 MB in the end (delta: 396.4 MB). Free memory was 307.5 MB in the beginning and 386.4 MB in the end (delta: -79.0 MB). Peak memory consumption was 316.3 MB. Max. memory is 16.0 GB. [2021-03-26 00:25:04,495 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.51 ms. Allocated memory is still 255.9 MB. Free memory was 237.6 MB in the beginning and 237.4 MB in the end (delta: 178.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 514.16 ms. Allocated memory was 255.9 MB in the beginning and 375.4 MB in the end (delta: 119.5 MB). Free memory was 232.3 MB in the beginning and 334.3 MB in the end (delta: -102.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 53.39 ms. Allocated memory is still 375.4 MB. Free memory was 334.3 MB in the beginning and 331.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 33.21 ms. Allocated memory is still 375.4 MB. Free memory was 331.7 MB in the beginning and 329.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1946.83 ms. Allocated memory is still 375.4 MB. Free memory was 329.2 MB in the beginning and 308.5 MB in the end (delta: 20.6 MB). Peak memory consumption was 119.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 24870.15 ms. Allocated memory was 375.4 MB in the beginning and 771.8 MB in the end (delta: 396.4 MB). Free memory was 307.5 MB in the beginning and 386.4 MB in the end (delta: -79.0 MB). Peak memory consumption was 316.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3621.5ms, 121 PlacesBefore, 57 PlacesAfterwards, 110 TransitionsBefore, 45 TransitionsAfterwards, 2672 CoEnabledTransitionPairs, 5 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 74 TotalNumberOfCompositions, 4891 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2553, positive: 2449, positive conditional: 2449, positive unconditional: 0, negative: 104, negative conditional: 104, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1836, positive: 1788, positive conditional: 0, positive unconditional: 1788, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1836, positive: 1788, positive conditional: 0, positive unconditional: 1788, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1836, positive: 1777, positive conditional: 0, positive unconditional: 1777, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 613, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 575, negative conditional: 0, negative unconditional: 575, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2553, positive: 661, positive conditional: 661, positive unconditional: 0, negative: 56, negative conditional: 56, negative unconditional: 0, unknown: 1836, unknown conditional: 1836, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 148, Positive conditional cache size: 148, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1451.6ms, 53 PlacesBefore, 42 PlacesAfterwards, 42 TransitionsBefore, 31 TransitionsAfterwards, 608 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 2552 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 740, positive: 622, positive conditional: 622, positive unconditional: 0, negative: 118, negative conditional: 118, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 241, positive: 207, positive conditional: 17, positive unconditional: 190, negative: 34, negative conditional: 8, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 241, positive: 207, positive conditional: 17, positive unconditional: 190, negative: 34, negative conditional: 8, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 241, positive: 196, positive conditional: 0, positive unconditional: 196, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 34, negative conditional: 8, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 434, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 399, negative conditional: 135, negative unconditional: 265, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 740, positive: 415, positive conditional: 415, positive unconditional: 0, negative: 84, negative conditional: 84, negative unconditional: 0, unknown: 241, unknown conditional: 241, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 233, Positive conditional cache size: 233, Positive unconditional cache size: 0, Negative cache size: 43, Negative conditional cache size: 43, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1542.1ms, 48 PlacesBefore, 43 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 670 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 182, positive: 154, positive conditional: 154, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, positive: 46, positive conditional: 6, positive unconditional: 40, 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: 52, positive: 46, positive conditional: 6, positive unconditional: 40, 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: 52, positive: 46, positive conditional: 0, positive unconditional: 46, 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: 239, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 239, negative conditional: 0, negative unconditional: 239, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 182, positive: 108, positive conditional: 108, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 52, unknown conditional: 52, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 328, Positive cache size: 279, Positive conditional cache size: 279, Positive unconditional cache size: 0, Negative cache size: 49, Negative conditional cache size: 49, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 212.7ms, 42 PlacesBefore, 42 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 606 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 395 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 99, positive: 84, positive conditional: 84, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, positive: 45, positive conditional: 6, positive unconditional: 39, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 48, positive: 45, positive conditional: 6, positive unconditional: 39, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 48, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 66, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 99, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 48, unknown conditional: 48, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 376, Positive cache size: 324, Positive conditional cache size: 324, Positive unconditional cache size: 0, Negative cache size: 52, Negative conditional cache size: 52, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 114.5ms, 44 PlacesBefore, 44 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 686 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 466 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 105, positive: 89, positive conditional: 89, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 21, positive conditional: 7, positive unconditional: 14, 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: 22, positive: 21, positive conditional: 7, positive unconditional: 14, 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: 22, positive: 21, positive conditional: 0, positive unconditional: 21, 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: 25, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 105, positive: 68, positive conditional: 68, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 398, Positive cache size: 345, Positive conditional cache size: 345, Positive unconditional cache size: 0, Negative cache size: 53, Negative conditional cache size: 53, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 111.4ms, 46 PlacesBefore, 46 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 746 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 500 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 101, positive: 85, positive conditional: 85, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, positive: 24, positive conditional: 15, positive unconditional: 9, 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: 25, positive: 24, positive conditional: 15, positive unconditional: 9, 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: 25, positive: 24, positive conditional: 0, positive unconditional: 24, 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: 27, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 101, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 423, Positive cache size: 369, Positive conditional cache size: 369, Positive unconditional cache size: 0, Negative cache size: 54, Negative conditional cache size: 54, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 100.0ms, 48 PlacesBefore, 48 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 746 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 436 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 81, positive: 67, positive conditional: 67, positive unconditional: 0, negative: 14, negative conditional: 14, 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: 11, positive unconditional: 6, 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: 11, positive unconditional: 6, 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: 81, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 440, Positive cache size: 386, Positive conditional cache size: 386, Positive unconditional cache size: 0, Negative cache size: 54, Negative conditional cache size: 54, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 136.4ms, 50 PlacesBefore, 50 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 746 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 507 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 102, positive: 86, positive conditional: 86, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, positive: 33, positive conditional: 16, 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: 33, positive: 33, positive conditional: 16, 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: 33, positive: 33, positive conditional: 0, positive unconditional: 33, 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: 102, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 33, unknown conditional: 33, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 473, Positive cache size: 419, Positive conditional cache size: 419, Positive unconditional cache size: 0, Negative cache size: 54, Negative conditional cache size: 54, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2120.6ms, 56 PlacesBefore, 56 PlacesAfterwards, 56 TransitionsBefore, 55 TransitionsAfterwards, 1128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 988 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 175, positive: 149, positive conditional: 149, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, positive: 54, positive conditional: 44, positive unconditional: 10, 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: 54, positive: 54, positive conditional: 44, positive unconditional: 10, 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: 54, positive: 54, positive conditional: 0, positive unconditional: 54, 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: 175, positive: 95, positive conditional: 95, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 54, unknown conditional: 54, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 489, Positive cache size: 436, Positive conditional cache size: 436, Positive unconditional cache size: 0, Negative cache size: 53, Negative conditional cache size: 53, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2586.1ms, 58 PlacesBefore, 58 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 1098 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 574 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 30, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 6, positive conditional: 4, positive unconditional: 2, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 6, positive conditional: 4, positive unconditional: 2, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 330, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 330, negative conditional: 330, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 502, Positive cache size: 442, Positive conditional cache size: 442, Positive unconditional cache size: 0, Negative cache size: 60, Negative conditional cache size: 60, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4992.7ms, 66 PlacesBefore, 66 PlacesAfterwards, 69 TransitionsBefore, 68 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1568 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 137, positive: 103, positive conditional: 103, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, positive: 51, positive conditional: 46, positive unconditional: 5, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 55, positive: 51, positive conditional: 46, positive unconditional: 5, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 55, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 70, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 137, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 55, unknown conditional: 55, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 518, Positive cache size: 454, Positive conditional cache size: 454, Positive unconditional cache size: 0, Negative cache size: 64, Negative conditional cache size: 64, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1472.5ms, 69 PlacesBefore, 69 PlacesAfterwards, 73 TransitionsBefore, 72 TransitionsAfterwards, 1416 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1758 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 179, positive: 141, positive conditional: 141, positive unconditional: 0, negative: 38, negative conditional: 38, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, positive: 57, positive conditional: 57, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 59, positive: 57, positive conditional: 57, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 59, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 68, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 179, positive: 84, positive conditional: 84, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 59, unknown conditional: 59, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 538, Positive cache size: 472, Positive conditional cache size: 472, Positive unconditional cache size: 0, Negative cache size: 66, Negative conditional cache size: 66, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1649.2ms, 73 PlacesBefore, 69 PlacesAfterwards, 68 TransitionsBefore, 65 TransitionsAfterwards, 1120 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 2036 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 119, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, positive: 23, positive conditional: 23, 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: 23, positive: 23, positive conditional: 23, 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: 23, positive: 23, positive conditional: 0, positive unconditional: 23, 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: 119, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 23, unknown conditional: 23, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 457, Positive cache size: 408, Positive conditional cache size: 408, Positive unconditional cache size: 0, Negative cache size: 49, Negative conditional cache size: 49, Negative unconditional cache size: 0 - 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_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool a$flush_delayed; [L716] 0 int a$mem_tmp; [L717] 0 _Bool a$r_buff0_thd0; [L718] 0 _Bool a$r_buff0_thd1; [L719] 0 _Bool a$r_buff0_thd2; [L720] 0 _Bool a$r_buff0_thd3; [L721] 0 _Bool a$r_buff0_thd4; [L722] 0 _Bool a$r_buff1_thd0; [L723] 0 _Bool a$r_buff1_thd1; [L724] 0 _Bool a$r_buff1_thd2; [L725] 0 _Bool a$r_buff1_thd3; [L726] 0 _Bool a$r_buff1_thd4; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L857] 0 pthread_t t1513; [L858] FCALL, FORK 0 pthread_create(&t1513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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] [L859] 0 pthread_t t1514; [L860] FCALL, FORK 0 pthread_create(&t1514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L755] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L861] 0 pthread_t t1515; [L862] FCALL, FORK 0 pthread_create(&t1515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L796] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L863] 0 pthread_t t1516; [L864] FCALL, FORK 0 pthread_create(&t1516, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L816] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L819] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 4 a$flush_delayed = weak$$choice2 [L822] 4 a$mem_tmp = a [L823] 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) [L823] 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) [L824] 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)) [L824] 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) [L824] 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)) [L824] 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)) [L825] 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)) [L825] 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) [L825] 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)) [L825] 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)) [L826] 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)) [L826] 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) [L826] 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)) [L826] 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)) [L827] 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)) [L827] 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) [L827] 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)) [L827] 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)) [L828] 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)) [L828] 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) [L828] 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)) [L828] 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)) [L829] 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)) [L829] 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) [L829] 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)) [L829] 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)) [L830] 4 __unbuffered_p3_EAX = a [L831] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L831] 4 a = a$flush_delayed ? a$mem_tmp : a [L832] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] [L762] 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) [L762] 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) [L763] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L764] 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 [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L766] 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 [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L782] 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) [L782] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L782] 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) [L782] 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) [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L784] 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 [L785] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L786] 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 [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L802] 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) [L802] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L802] 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) [L802] 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) [L803] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L803] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L804] 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 [L805] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L805] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L806] 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 [L809] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L811] 3 return 0; [L835] 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) [L835] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L835] 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) [L835] 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) [L836] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L836] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L837] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L837] 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 [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L838] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L839] 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 [L842] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L844] 4 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L870] 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) [L870] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L870] 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) [L870] 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) [L871] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L871] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L872] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L872] 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 [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L873] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L874] 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 [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 113 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 24603.6ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3139.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3706.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 69 SDtfs, 46 SDslu, 34 SDs, 0 SdLazy, 222 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 223.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 124.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=592occurred in iteration=11, InterpolantAutomatonStates: 53, 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: 36.0ms SsaConstructionTime, 322.0ms SatisfiabilityAnalysisTime, 564.9ms InterpolantComputationTime, 215 NumberOfCodeBlocks, 215 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 697 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...