/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe003_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:27:44,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:27:44,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:27:44,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:27:44,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:27:44,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:27:44,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:27:44,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:27:44,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:27:44,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:27:44,745 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:27:44,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:27:44,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:27:44,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:27:44,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:27:44,749 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:27:44,750 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:27:44,750 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:27:44,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:27:44,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:27:44,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:27:44,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:27:44,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:27:44,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:27:44,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:27:44,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:27:44,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:27:44,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:27:44,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:27:44,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:27:44,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:27:44,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:27:44,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:27:44,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:27:44,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:27:44,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:27:44,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:27:44,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:27:44,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:27:44,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:27:44,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:27:44,785 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:27:44,819 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:27:44,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:27:44,823 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:27:44,823 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:27:44,823 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:27:44,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:27:44,824 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:27:44,824 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:27:44,824 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:27:44,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:27:44,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:27:44,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:27:44,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:27:44,824 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:27:44,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:27:44,825 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:27:44,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:27:44,825 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:27:44,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:27:44,825 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:27:44,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:27:44,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:27:44,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:27:44,826 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:27:44,826 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:27:44,826 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:27:44,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:27:44,826 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:27:44,826 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:27:44,827 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:27:44,827 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 10:27:45,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:27:45,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:27:45,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:27:45,129 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:27:45,130 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:27:45,131 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_pso.oepc.i [2021-03-26 10:27:45,190 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74e29fc4/5854f7957bee483a8d31d4175de69217/FLAG2aecb9e03 [2021-03-26 10:27:45,780 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:27:45,780 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_pso.oepc.i [2021-03-26 10:27:45,791 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74e29fc4/5854f7957bee483a8d31d4175de69217/FLAG2aecb9e03 [2021-03-26 10:27:46,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74e29fc4/5854f7957bee483a8d31d4175de69217 [2021-03-26 10:27:46,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:27:46,164 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:27:46,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:27:46,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:27:46,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:27:46,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:27:46" (1/1) ... [2021-03-26 10:27:46,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b5ab989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:46, skipping insertion in model container [2021-03-26 10:27:46,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:27:46" (1/1) ... [2021-03-26 10:27:46,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:27:46,240 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:27:46,409 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/safe003_pso.oepc.i[950,963] [2021-03-26 10:27:46,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:27:46,648 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:27:46,665 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/safe003_pso.oepc.i[950,963] [2021-03-26 10:27:46,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:27:46,766 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:27:46,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:46 WrapperNode [2021-03-26 10:27:46,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:27:46,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:27:46,769 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:27:46,769 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:27:46,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:46" (1/1) ... [2021-03-26 10:27:46,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:46" (1/1) ... [2021-03-26 10:27:46,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:27:46,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:27:46,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:27:46,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:27:46,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:46" (1/1) ... [2021-03-26 10:27:46,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:46" (1/1) ... [2021-03-26 10:27:46,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:46" (1/1) ... [2021-03-26 10:27:46,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:46" (1/1) ... [2021-03-26 10:27:46,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:46" (1/1) ... [2021-03-26 10:27:46,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:46" (1/1) ... [2021-03-26 10:27:46,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:46" (1/1) ... [2021-03-26 10:27:46,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:27:46,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:27:46,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:27:46,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:27:46,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:46" (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 10:27:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:27:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:27:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:27:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:27:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:27:47,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:27:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:27:47,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:27:47,007 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:27:47,007 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:27:47,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:27:47,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:27:47,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:27:47,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:27:47,009 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 10:27:49,982 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:27:49,982 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:27:49,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:27:49 BoogieIcfgContainer [2021-03-26 10:27:49,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:27:49,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:27:49,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:27:49,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:27:49,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:27:46" (1/3) ... [2021-03-26 10:27:49,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fd6a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:27:49, skipping insertion in model container [2021-03-26 10:27:49,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:46" (2/3) ... [2021-03-26 10:27:49,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fd6a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:27:49, skipping insertion in model container [2021-03-26 10:27:49,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:27:49" (3/3) ... [2021-03-26 10:27:49,992 INFO L111 eAbstractionObserver]: Analyzing ICFG safe003_pso.oepc.i [2021-03-26 10:27:49,999 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:27:50,004 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:27:50,004 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:27:50,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,052 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,052 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,053 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,053 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,053 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,053 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,054 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,054 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,058 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,058 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,059 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,059 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,062 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,062 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,063 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,063 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,099 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,099 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,099 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,101 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,101 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,107 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,108 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:50,110 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:27:50,126 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 10:27:50,150 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:27:50,151 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:27:50,151 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:27:50,151 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:27:50,151 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:27:50,151 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:27:50,152 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:27:50,152 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:27:50,164 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2021-03-26 10:27:50,205 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-26 10:27:50,205 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:27:50,217 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:27:50,217 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 98 transitions, 211 flow [2021-03-26 10:27:50,222 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 95 transitions, 199 flow [2021-03-26 10:27:50,224 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:27:50,236 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-26 10:27:50,240 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-26 10:27:50,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 199 flow [2021-03-26 10:27:50,264 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-26 10:27:50,264 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:27:50,265 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:27:50,267 INFO L142 LiptonReduction]: Number of co-enabled transitions 1694 [2021-03-26 10:27:51,918 WARN L205 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-26 10:27:52,209 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 10:27:53,592 WARN L205 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 10:27:54,184 WARN L205 SmtUtils]: Spent 589.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:27:54,901 WARN L205 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 175 [2021-03-26 10:27:55,180 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-26 10:27:56,447 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 299 DAG size of output: 255 [2021-03-26 10:27:57,027 WARN L205 SmtUtils]: Spent 578.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 10:27:57,396 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:27:57,771 WARN L205 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2021-03-26 10:27:57,921 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 10:27:59,371 WARN L205 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2021-03-26 10:27:59,657 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:28:00,335 WARN L205 SmtUtils]: Spent 674.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:28:00,959 WARN L205 SmtUtils]: Spent 622.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:28:01,217 INFO L154 LiptonReduction]: Checked pairs total: 3349 [2021-03-26 10:28:01,218 INFO L156 LiptonReduction]: Total number of compositions: 66 [2021-03-26 10:28:01,219 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10996 [2021-03-26 10:28:01,226 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-26 10:28:01,226 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:28:01,227 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:01,227 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:01,227 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:01,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:01,231 INFO L82 PathProgramCache]: Analyzing trace with hash 231868783, now seen corresponding path program 1 times [2021-03-26 10:28:01,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:01,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178880580] [2021-03-26 10:28:01,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:01,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:01,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:28:01,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:01,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:01,438 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 10:28:01,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178880580] [2021-03-26 10:28:01,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:01,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:28:01,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675808717] [2021-03-26 10:28:01,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:28:01,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:01,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:28:01,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:28:01,463 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 164 [2021-03-26 10:28:01,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states 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 10:28:01,468 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:01,468 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 164 [2021-03-26 10:28:01,469 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:01,646 INFO L129 PetriNetUnfolder]: 161/364 cut-off events. [2021-03-26 10:28:01,646 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:28:01,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 364 events. 161/364 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2040 event pairs, 33 based on Foata normal form. 22/357 useless extension candidates. Maximal degree in co-relation 610. Up to 193 conditions per place. [2021-03-26 10:28:01,651 INFO L132 encePairwiseOnDemand]: 160/164 looper letters, 13 selfloop transitions, 2 changer transitions 3/44 dead transitions. [2021-03-26 10:28:01,652 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 131 flow [2021-03-26 10:28:01,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:28:01,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:28:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2021-03-26 10:28:01,671 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8699186991869918 [2021-03-26 10:28:01,671 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2021-03-26 10:28:01,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2021-03-26 10:28:01,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:01,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2021-03-26 10:28:01,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states 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 10:28:01,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:28:01,687 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:28:01,689 INFO L185 Difference]: Start difference. First operand has 49 places, 40 transitions, 89 flow. Second operand 3 states and 428 transitions. [2021-03-26 10:28:01,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 131 flow [2021-03-26 10:28:01,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 128 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:28:01,693 INFO L241 Difference]: Finished difference. Result has 46 places, 35 transitions, 80 flow [2021-03-26 10:28:01,695 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2021-03-26 10:28:01,695 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2021-03-26 10:28:01,695 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:01,696 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 35 transitions, 80 flow [2021-03-26 10:28:01,697 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 35 transitions, 80 flow [2021-03-26 10:28:01,697 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 80 flow [2021-03-26 10:28:01,702 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-03-26 10:28:01,702 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:28:01,703 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:28:01,703 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-26 10:28:02,434 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 10:28:02,758 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 10:28:03,377 WARN L205 SmtUtils]: Spent 617.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:28:04,024 WARN L205 SmtUtils]: Spent 645.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:28:05,053 INFO L154 LiptonReduction]: Checked pairs total: 1518 [2021-03-26 10:28:05,053 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 10:28:05,053 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3358 [2021-03-26 10:28:05,054 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-03-26 10:28:05,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states 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 10:28:05,055 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:05,055 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:05,055 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:28:05,055 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:05,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:05,056 INFO L82 PathProgramCache]: Analyzing trace with hash -471362213, now seen corresponding path program 1 times [2021-03-26 10:28:05,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:05,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816538438] [2021-03-26 10:28:05,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:05,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:05,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:28:05,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:05,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:05,212 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:28:05,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:28:05,217 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 10:28:05,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816538438] [2021-03-26 10:28:05,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:05,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:28:05,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414566553] [2021-03-26 10:28:05,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:28:05,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:05,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:28:05,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:28:05,223 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 176 [2021-03-26 10:28:05,224 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states 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 10:28:05,224 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:05,224 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 176 [2021-03-26 10:28:05,224 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:05,241 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 10:28:05,241 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:28:05,241 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 35 event pairs, 0 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:28:05,241 INFO L132 encePairwiseOnDemand]: 173/176 looper letters, 1 selfloop transitions, 2 changer transitions 1/23 dead transitions. [2021-03-26 10:28:05,241 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 62 flow [2021-03-26 10:28:05,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:28:05,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:28:05,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-03-26 10:28:05,243 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8712121212121212 [2021-03-26 10:28:05,243 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-03-26 10:28:05,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-03-26 10:28:05,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:05,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-03-26 10:28:05,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states 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 10:28:05,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states 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 10:28:05,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states 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 10:28:05,247 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states and 460 transitions. [2021-03-26 10:28:05,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 62 flow [2021-03-26 10:28:05,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 23 transitions, 58 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:28:05,248 INFO L241 Difference]: Finished difference. Result has 33 places, 22 transitions, 58 flow [2021-03-26 10:28:05,248 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2021-03-26 10:28:05,248 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -16 predicate places. [2021-03-26 10:28:05,248 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:05,249 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 58 flow [2021-03-26 10:28:05,249 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 58 flow [2021-03-26 10:28:05,249 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 22 transitions, 58 flow [2021-03-26 10:28:05,254 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-26 10:28:05,254 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:28:05,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:28:05,255 INFO L142 LiptonReduction]: Number of co-enabled transitions 214 [2021-03-26 10:28:05,634 WARN L205 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-26 10:28:05,767 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 10:28:06,082 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-26 10:28:06,220 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 10:28:06,278 INFO L154 LiptonReduction]: Checked pairs total: 518 [2021-03-26 10:28:06,278 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:28:06,278 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1030 [2021-03-26 10:28:06,279 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2021-03-26 10:28:06,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states 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 10:28:06,280 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:06,280 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:06,280 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:28:06,280 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:06,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:06,281 INFO L82 PathProgramCache]: Analyzing trace with hash -499376363, now seen corresponding path program 1 times [2021-03-26 10:28:06,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:06,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838387211] [2021-03-26 10:28:06,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:06,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:06,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:06,392 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 10:28:06,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838387211] [2021-03-26 10:28:06,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:06,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:28:06,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390911119] [2021-03-26 10:28:06,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:28:06,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:06,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:28:06,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:28:06,394 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 177 [2021-03-26 10:28:06,394 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states 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 10:28:06,395 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:06,395 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 177 [2021-03-26 10:28:06,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:06,410 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-26 10:28:06,410 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-26 10:28:06,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 21 events. 0/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 1/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:28:06,410 INFO L132 encePairwiseOnDemand]: 174/177 looper letters, 1 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2021-03-26 10:28:06,410 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 21 transitions, 62 flow [2021-03-26 10:28:06,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:28:06,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:28:06,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2021-03-26 10:28:06,412 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8945386064030132 [2021-03-26 10:28:06,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 475 transitions. [2021-03-26 10:28:06,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 475 transitions. [2021-03-26 10:28:06,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:06,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 475 transitions. [2021-03-26 10:28:06,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states 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 10:28:06,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states 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 10:28:06,414 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states 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 10:28:06,414 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 475 transitions. [2021-03-26 10:28:06,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 21 transitions, 62 flow [2021-03-26 10:28:06,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 21 transitions, 58 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:28:06,414 INFO L241 Difference]: Finished difference. Result has 32 places, 21 transitions, 60 flow [2021-03-26 10:28:06,415 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2021-03-26 10:28:06,415 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -17 predicate places. [2021-03-26 10:28:06,415 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:06,415 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 60 flow [2021-03-26 10:28:06,415 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 21 transitions, 60 flow [2021-03-26 10:28:06,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 21 transitions, 60 flow [2021-03-26 10:28:06,421 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-26 10:28:06,421 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:28:06,421 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 21 events. 0/21 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:28:06,421 INFO L142 LiptonReduction]: Number of co-enabled transitions 212 [2021-03-26 10:28:06,446 INFO L154 LiptonReduction]: Checked pairs total: 257 [2021-03-26 10:28:06,446 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:06,447 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32 [2021-03-26 10:28:06,448 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 60 flow [2021-03-26 10:28:06,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states 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 10:28:06,448 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:06,448 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:06,448 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:28:06,448 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:06,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:06,449 INFO L82 PathProgramCache]: Analyzing trace with hash 2121851424, now seen corresponding path program 1 times [2021-03-26 10:28:06,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:06,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544842078] [2021-03-26 10:28:06,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:06,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:06,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:06,531 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 10:28:06,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544842078] [2021-03-26 10:28:06,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:06,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:28:06,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876904773] [2021-03-26 10:28:06,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:28:06,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:06,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:28:06,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:28:06,533 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 177 [2021-03-26 10:28:06,533 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states 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 10:28:06,533 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:06,533 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 177 [2021-03-26 10:28:06,533 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:06,543 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-26 10:28:06,543 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-26 10:28:06,544 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 21 events. 0/21 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 1/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:28:06,544 INFO L132 encePairwiseOnDemand]: 174/177 looper letters, 1 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2021-03-26 10:28:06,544 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 21 transitions, 66 flow [2021-03-26 10:28:06,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:28:06,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:28:06,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2021-03-26 10:28:06,546 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8832391713747646 [2021-03-26 10:28:06,546 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2021-03-26 10:28:06,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2021-03-26 10:28:06,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:06,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2021-03-26 10:28:06,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states 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 10:28:06,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states 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 10:28:06,549 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states 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 10:28:06,549 INFO L185 Difference]: Start difference. First operand has 32 places, 21 transitions, 60 flow. Second operand 3 states and 469 transitions. [2021-03-26 10:28:06,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 21 transitions, 66 flow [2021-03-26 10:28:06,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 21 transitions, 58 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-26 10:28:06,550 INFO L241 Difference]: Finished difference. Result has 32 places, 21 transitions, 60 flow [2021-03-26 10:28:06,550 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2021-03-26 10:28:06,550 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -17 predicate places. [2021-03-26 10:28:06,550 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:06,551 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 60 flow [2021-03-26 10:28:06,551 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 21 transitions, 60 flow [2021-03-26 10:28:06,551 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 21 transitions, 60 flow [2021-03-26 10:28:06,555 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-26 10:28:06,555 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:28:06,555 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 21 events. 0/21 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:28:06,555 INFO L142 LiptonReduction]: Number of co-enabled transitions 210 [2021-03-26 10:28:06,557 INFO L154 LiptonReduction]: Checked pairs total: 244 [2021-03-26 10:28:06,557 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:06,557 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-03-26 10:28:06,558 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 60 flow [2021-03-26 10:28:06,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states 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 10:28:06,558 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:06,558 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:06,558 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:28:06,558 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:06,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:06,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1286103425, now seen corresponding path program 1 times [2021-03-26 10:28:06,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:06,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043289545] [2021-03-26 10:28:06,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:06,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:06,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:28:06,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:06,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:06,660 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 10:28:06,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043289545] [2021-03-26 10:28:06,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:06,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:28:06,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259470489] [2021-03-26 10:28:06,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:28:06,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:06,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:28:06,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:28:06,666 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 177 [2021-03-26 10:28:06,666 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 0 states 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 10:28:06,666 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:06,666 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 177 [2021-03-26 10:28:06,666 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:06,779 INFO L129 PetriNetUnfolder]: 221/422 cut-off events. [2021-03-26 10:28:06,779 INFO L130 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2021-03-26 10:28:06,782 INFO L84 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 422 events. 221/422 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2135 event pairs, 58 based on Foata normal form. 18/434 useless extension candidates. Maximal degree in co-relation 858. Up to 193 conditions per place. [2021-03-26 10:28:06,783 INFO L132 encePairwiseOnDemand]: 170/177 looper letters, 13 selfloop transitions, 5 changer transitions 5/34 dead transitions. [2021-03-26 10:28:06,783 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 134 flow [2021-03-26 10:28:06,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:28:06,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:28:06,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 564 transitions. [2021-03-26 10:28:06,786 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7966101694915254 [2021-03-26 10:28:06,786 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 564 transitions. [2021-03-26 10:28:06,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 564 transitions. [2021-03-26 10:28:06,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:06,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 564 transitions. [2021-03-26 10:28:06,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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 10:28:06,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 0 states 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 10:28:06,790 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 0 states 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 10:28:06,790 INFO L185 Difference]: Start difference. First operand has 32 places, 21 transitions, 60 flow. Second operand 4 states and 564 transitions. [2021-03-26 10:28:06,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 134 flow [2021-03-26 10:28:06,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 34 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:28:06,792 INFO L241 Difference]: Finished difference. Result has 35 places, 24 transitions, 90 flow [2021-03-26 10:28:06,792 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2021-03-26 10:28:06,792 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -14 predicate places. [2021-03-26 10:28:06,792 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:06,792 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 24 transitions, 90 flow [2021-03-26 10:28:06,793 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 24 transitions, 90 flow [2021-03-26 10:28:06,793 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 24 transitions, 90 flow [2021-03-26 10:28:06,801 INFO L129 PetriNetUnfolder]: 14/73 cut-off events. [2021-03-26 10:28:06,802 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-26 10:28:06,802 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 73 events. 14/73 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 255 event pairs, 6 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 119. Up to 29 conditions per place. [2021-03-26 10:28:06,803 INFO L142 LiptonReduction]: Number of co-enabled transitions 214 [2021-03-26 10:28:06,882 INFO L154 LiptonReduction]: Checked pairs total: 159 [2021-03-26 10:28:06,882 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:06,882 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 90 [2021-03-26 10:28:06,883 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 90 flow [2021-03-26 10:28:06,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 0 states 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 10:28:06,883 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:06,883 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:06,883 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:28:06,883 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:06,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:06,884 INFO L82 PathProgramCache]: Analyzing trace with hash -482659293, now seen corresponding path program 2 times [2021-03-26 10:28:06,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:06,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932067409] [2021-03-26 10:28:06,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:06,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:06,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:06,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:06,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:06,964 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 10:28:06,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932067409] [2021-03-26 10:28:06,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:06,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:28:06,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639628471] [2021-03-26 10:28:06,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:28:06,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:06,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:28:06,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:28:06,968 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 177 [2021-03-26 10:28:06,969 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states 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 10:28:06,969 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:06,969 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 177 [2021-03-26 10:28:06,969 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:07,004 INFO L129 PetriNetUnfolder]: 18/77 cut-off events. [2021-03-26 10:28:07,004 INFO L130 PetriNetUnfolder]: For 84/99 co-relation queries the response was YES. [2021-03-26 10:28:07,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 77 events. 18/77 cut-off events. For 84/99 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 309 event pairs, 10 based on Foata normal form. 9/76 useless extension candidates. Maximal degree in co-relation 145. Up to 37 conditions per place. [2021-03-26 10:28:07,005 INFO L132 encePairwiseOnDemand]: 173/177 looper letters, 2 selfloop transitions, 3 changer transitions 1/25 dead transitions. [2021-03-26 10:28:07,005 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 25 transitions, 103 flow [2021-03-26 10:28:07,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:28:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:28:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2021-03-26 10:28:07,008 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8573446327683616 [2021-03-26 10:28:07,008 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 607 transitions. [2021-03-26 10:28:07,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 607 transitions. [2021-03-26 10:28:07,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:07,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 607 transitions. [2021-03-26 10:28:07,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states 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 10:28:07,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 0 states 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 10:28:07,012 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 0 states 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 10:28:07,012 INFO L185 Difference]: Start difference. First operand has 35 places, 24 transitions, 90 flow. Second operand 4 states and 607 transitions. [2021-03-26 10:28:07,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 25 transitions, 103 flow [2021-03-26 10:28:07,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 25 transitions, 95 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:28:07,014 INFO L241 Difference]: Finished difference. Result has 38 places, 24 transitions, 96 flow [2021-03-26 10:28:07,015 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2021-03-26 10:28:07,015 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -11 predicate places. [2021-03-26 10:28:07,015 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:07,015 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 24 transitions, 96 flow [2021-03-26 10:28:07,015 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 24 transitions, 96 flow [2021-03-26 10:28:07,016 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 24 transitions, 96 flow [2021-03-26 10:28:07,029 INFO L129 PetriNetUnfolder]: 14/89 cut-off events. [2021-03-26 10:28:07,029 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-03-26 10:28:07,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 89 events. 14/89 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 400 event pairs, 8 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 160. Up to 31 conditions per place. [2021-03-26 10:28:07,030 INFO L142 LiptonReduction]: Number of co-enabled transitions 212 [2021-03-26 10:28:07,035 INFO L154 LiptonReduction]: Checked pairs total: 131 [2021-03-26 10:28:07,035 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:07,036 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-26 10:28:07,040 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 96 flow [2021-03-26 10:28:07,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states 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 10:28:07,040 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:07,040 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:07,041 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:28:07,041 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:07,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:07,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1695059940, now seen corresponding path program 1 times [2021-03-26 10:28:07,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:07,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047604933] [2021-03-26 10:28:07,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:07,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:07,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:28:07,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:07,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:28:07,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:07,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:28:07,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:07,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:28:07,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:07,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 10:28:07,231 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 10:28:07,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047604933] [2021-03-26 10:28:07,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:07,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:28:07,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595050526] [2021-03-26 10:28:07,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:28:07,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:07,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:28:07,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:28:07,233 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 177 [2021-03-26 10:28:07,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 96 flow. Second operand has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:07,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:07,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 177 [2021-03-26 10:28:07,233 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:07,382 INFO L129 PetriNetUnfolder]: 170/334 cut-off events. [2021-03-26 10:28:07,382 INFO L130 PetriNetUnfolder]: For 196/222 co-relation queries the response was YES. [2021-03-26 10:28:07,383 INFO L84 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 334 events. 170/334 cut-off events. For 196/222 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1659 event pairs, 86 based on Foata normal form. 6/325 useless extension candidates. Maximal degree in co-relation 824. Up to 268 conditions per place. [2021-03-26 10:28:07,384 INFO L132 encePairwiseOnDemand]: 170/177 looper letters, 17 selfloop transitions, 10 changer transitions 0/39 dead transitions. [2021-03-26 10:28:07,384 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 202 flow [2021-03-26 10:28:07,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:28:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:28:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 691 transitions. [2021-03-26 10:28:07,387 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7807909604519774 [2021-03-26 10:28:07,387 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 691 transitions. [2021-03-26 10:28:07,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 691 transitions. [2021-03-26 10:28:07,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:07,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 691 transitions. [2021-03-26 10:28:07,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.2) internal successors, (691), 5 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:07,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states 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 10:28:07,391 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states 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 10:28:07,391 INFO L185 Difference]: Start difference. First operand has 38 places, 24 transitions, 96 flow. Second operand 5 states and 691 transitions. [2021-03-26 10:28:07,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 202 flow [2021-03-26 10:28:07,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 39 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:28:07,394 INFO L241 Difference]: Finished difference. Result has 43 places, 33 transitions, 164 flow [2021-03-26 10:28:07,394 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2021-03-26 10:28:07,395 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -6 predicate places. [2021-03-26 10:28:07,395 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:07,395 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 33 transitions, 164 flow [2021-03-26 10:28:07,395 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 33 transitions, 164 flow [2021-03-26 10:28:07,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 33 transitions, 164 flow [2021-03-26 10:28:07,421 INFO L129 PetriNetUnfolder]: 62/221 cut-off events. [2021-03-26 10:28:07,422 INFO L130 PetriNetUnfolder]: For 102/103 co-relation queries the response was YES. [2021-03-26 10:28:07,422 INFO L84 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 221 events. 62/221 cut-off events. For 102/103 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1320 event pairs, 12 based on Foata normal form. 1/210 useless extension candidates. Maximal degree in co-relation 499. Up to 77 conditions per place. [2021-03-26 10:28:07,424 INFO L142 LiptonReduction]: Number of co-enabled transitions 272 [2021-03-26 10:28:07,666 INFO L154 LiptonReduction]: Checked pairs total: 127 [2021-03-26 10:28:07,667 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:07,667 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 272 [2021-03-26 10:28:07,671 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 164 flow [2021-03-26 10:28:07,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:07,672 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:07,672 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:07,672 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:28:07,672 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:07,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:07,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1647676282, now seen corresponding path program 1 times [2021-03-26 10:28:07,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:07,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797824719] [2021-03-26 10:28:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:07,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:07,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:28:07,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:07,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:28:07,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:07,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:28:07,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:07,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:28:07,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:07,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 10:28:07,862 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 10:28:07,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797824719] [2021-03-26 10:28:07,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:07,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:28:07,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307695893] [2021-03-26 10:28:07,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:28:07,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:07,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:28:07,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:28:07,865 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 177 [2021-03-26 10:28:07,866 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 164 flow. Second operand has 6 states, 6 states have (on average 126.16666666666667) internal successors, (757), 6 states have internal predecessors, (757), 0 states have call successors, (0), 0 states 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 10:28:07,866 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:07,866 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 177 [2021-03-26 10:28:07,866 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:08,103 INFO L129 PetriNetUnfolder]: 235/461 cut-off events. [2021-03-26 10:28:08,103 INFO L130 PetriNetUnfolder]: For 587/614 co-relation queries the response was YES. [2021-03-26 10:28:08,105 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1463 conditions, 461 events. 235/461 cut-off events. For 587/614 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2471 event pairs, 33 based on Foata normal form. 23/467 useless extension candidates. Maximal degree in co-relation 1445. Up to 231 conditions per place. [2021-03-26 10:28:08,108 INFO L132 encePairwiseOnDemand]: 168/177 looper letters, 20 selfloop transitions, 18 changer transitions 11/61 dead transitions. [2021-03-26 10:28:08,108 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 61 transitions, 413 flow [2021-03-26 10:28:08,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:28:08,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:28:08,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 905 transitions. [2021-03-26 10:28:08,111 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7304277643260694 [2021-03-26 10:28:08,111 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 905 transitions. [2021-03-26 10:28:08,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 905 transitions. [2021-03-26 10:28:08,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:08,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 905 transitions. [2021-03-26 10:28:08,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.28571428571428) internal successors, (905), 7 states have internal predecessors, (905), 0 states have call successors, (0), 0 states 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 10:28:08,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 177.0) internal successors, (1416), 8 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states 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 10:28:08,116 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 177.0) internal successors, (1416), 8 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states 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 10:28:08,116 INFO L185 Difference]: Start difference. First operand has 43 places, 33 transitions, 164 flow. Second operand 7 states and 905 transitions. [2021-03-26 10:28:08,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 61 transitions, 413 flow [2021-03-26 10:28:08,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 413 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:28:08,120 INFO L241 Difference]: Finished difference. Result has 53 places, 47 transitions, 344 flow [2021-03-26 10:28:08,120 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=344, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2021-03-26 10:28:08,121 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2021-03-26 10:28:08,121 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:08,121 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 47 transitions, 344 flow [2021-03-26 10:28:08,121 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 47 transitions, 344 flow [2021-03-26 10:28:08,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 47 transitions, 344 flow [2021-03-26 10:28:08,181 INFO L129 PetriNetUnfolder]: 183/437 cut-off events. [2021-03-26 10:28:08,181 INFO L130 PetriNetUnfolder]: For 680/700 co-relation queries the response was YES. [2021-03-26 10:28:08,183 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1514 conditions, 437 events. 183/437 cut-off events. For 680/700 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2619 event pairs, 11 based on Foata normal form. 6/426 useless extension candidates. Maximal degree in co-relation 1492. Up to 193 conditions per place. [2021-03-26 10:28:08,187 INFO L142 LiptonReduction]: Number of co-enabled transitions 328 [2021-03-26 10:28:08,337 INFO L154 LiptonReduction]: Checked pairs total: 103 [2021-03-26 10:28:08,338 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:08,338 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 217 [2021-03-26 10:28:08,338 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 344 flow [2021-03-26 10:28:08,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 126.16666666666667) internal successors, (757), 6 states have internal predecessors, (757), 0 states have call successors, (0), 0 states 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 10:28:08,339 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:08,339 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:08,339 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:28:08,339 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:08,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:08,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1151063334, now seen corresponding path program 1 times [2021-03-26 10:28:08,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:08,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775711366] [2021-03-26 10:28:08,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:08,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:08,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:28:08,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:08,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:28:08,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:08,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:08,440 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 10:28:08,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775711366] [2021-03-26 10:28:08,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:08,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:28:08,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986608821] [2021-03-26 10:28:08,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:28:08,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:08,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:28:08,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:28:08,442 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 177 [2021-03-26 10:28:08,442 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 344 flow. Second operand has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states 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 10:28:08,442 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:08,442 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 177 [2021-03-26 10:28:08,443 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:08,632 INFO L129 PetriNetUnfolder]: 334/700 cut-off events. [2021-03-26 10:28:08,632 INFO L130 PetriNetUnfolder]: For 1429/1473 co-relation queries the response was YES. [2021-03-26 10:28:08,635 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2888 conditions, 700 events. 334/700 cut-off events. For 1429/1473 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 4493 event pairs, 47 based on Foata normal form. 27/704 useless extension candidates. Maximal degree in co-relation 2864. Up to 307 conditions per place. [2021-03-26 10:28:08,637 INFO L132 encePairwiseOnDemand]: 171/177 looper letters, 35 selfloop transitions, 9 changer transitions 20/76 dead transitions. [2021-03-26 10:28:08,637 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 76 transitions, 713 flow [2021-03-26 10:28:08,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:28:08,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:28:08,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 557 transitions. [2021-03-26 10:28:08,640 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.786723163841808 [2021-03-26 10:28:08,640 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 557 transitions. [2021-03-26 10:28:08,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 557 transitions. [2021-03-26 10:28:08,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:08,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 557 transitions. [2021-03-26 10:28:08,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states 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 10:28:08,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 0 states 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 10:28:08,643 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 0 states 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 10:28:08,643 INFO L185 Difference]: Start difference. First operand has 52 places, 47 transitions, 344 flow. Second operand 4 states and 557 transitions. [2021-03-26 10:28:08,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 76 transitions, 713 flow [2021-03-26 10:28:08,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 76 transitions, 706 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-26 10:28:08,652 INFO L241 Difference]: Finished difference. Result has 56 places, 50 transitions, 412 flow [2021-03-26 10:28:08,652 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=412, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2021-03-26 10:28:08,652 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2021-03-26 10:28:08,652 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:08,652 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 50 transitions, 412 flow [2021-03-26 10:28:08,652 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 50 transitions, 412 flow [2021-03-26 10:28:08,653 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 412 flow [2021-03-26 10:28:08,746 INFO L129 PetriNetUnfolder]: 164/402 cut-off events. [2021-03-26 10:28:08,746 INFO L130 PetriNetUnfolder]: For 927/951 co-relation queries the response was YES. [2021-03-26 10:28:08,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1491 conditions, 402 events. 164/402 cut-off events. For 927/951 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2426 event pairs, 3 based on Foata normal form. 9/395 useless extension candidates. Maximal degree in co-relation 1466. Up to 180 conditions per place. [2021-03-26 10:28:08,753 INFO L142 LiptonReduction]: Number of co-enabled transitions 310 [2021-03-26 10:28:08,770 INFO L154 LiptonReduction]: Checked pairs total: 173 [2021-03-26 10:28:08,770 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:08,770 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 118 [2021-03-26 10:28:08,771 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 412 flow [2021-03-26 10:28:08,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states 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 10:28:08,771 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:08,771 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:08,771 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:28:08,772 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:08,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:08,772 INFO L82 PathProgramCache]: Analyzing trace with hash 205040568, now seen corresponding path program 2 times [2021-03-26 10:28:08,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:08,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404339592] [2021-03-26 10:28:08,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:08,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:08,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:28:08,869 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-26 10:28:08,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-26 10:28:08,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:08,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:28:08,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:08,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:28:08,910 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 10:28:08,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404339592] [2021-03-26 10:28:08,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:08,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:28:08,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107486815] [2021-03-26 10:28:08,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:28:08,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:08,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:28:08,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:28:08,912 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 177 [2021-03-26 10:28:08,913 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 412 flow. Second operand has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 0 states have call successors, (0), 0 states 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 10:28:08,913 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:08,913 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 177 [2021-03-26 10:28:08,913 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:09,158 INFO L129 PetriNetUnfolder]: 269/612 cut-off events. [2021-03-26 10:28:09,158 INFO L130 PetriNetUnfolder]: For 1620/1684 co-relation queries the response was YES. [2021-03-26 10:28:09,160 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2687 conditions, 612 events. 269/612 cut-off events. For 1620/1684 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 3996 event pairs, 13 based on Foata normal form. 46/643 useless extension candidates. Maximal degree in co-relation 2660. Up to 285 conditions per place. [2021-03-26 10:28:09,162 INFO L132 encePairwiseOnDemand]: 170/177 looper letters, 36 selfloop transitions, 12 changer transitions 18/78 dead transitions. [2021-03-26 10:28:09,162 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 78 transitions, 798 flow [2021-03-26 10:28:09,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:28:09,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:28:09,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 816 transitions. [2021-03-26 10:28:09,165 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.768361581920904 [2021-03-26 10:28:09,165 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 816 transitions. [2021-03-26 10:28:09,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 816 transitions. [2021-03-26 10:28:09,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:09,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 816 transitions. [2021-03-26 10:28:09,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.0) internal successors, (816), 6 states have internal predecessors, (816), 0 states have call successors, (0), 0 states 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 10:28:09,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states 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 10:28:09,171 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states 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 10:28:09,171 INFO L185 Difference]: Start difference. First operand has 56 places, 50 transitions, 412 flow. Second operand 6 states and 816 transitions. [2021-03-26 10:28:09,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 78 transitions, 798 flow [2021-03-26 10:28:09,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 78 transitions, 753 flow, removed 10 selfloop flow, removed 4 redundant places. [2021-03-26 10:28:09,178 INFO L241 Difference]: Finished difference. Result has 59 places, 52 transitions, 454 flow [2021-03-26 10:28:09,178 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=454, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2021-03-26 10:28:09,178 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2021-03-26 10:28:09,178 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:09,179 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 52 transitions, 454 flow [2021-03-26 10:28:09,179 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 52 transitions, 454 flow [2021-03-26 10:28:09,179 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 52 transitions, 454 flow [2021-03-26 10:28:09,238 INFO L129 PetriNetUnfolder]: 170/395 cut-off events. [2021-03-26 10:28:09,238 INFO L130 PetriNetUnfolder]: For 1247/1346 co-relation queries the response was YES. [2021-03-26 10:28:09,240 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 395 events. 170/395 cut-off events. For 1247/1346 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2358 event pairs, 13 based on Foata normal form. 24/392 useless extension candidates. Maximal degree in co-relation 1512. Up to 189 conditions per place. [2021-03-26 10:28:09,243 INFO L142 LiptonReduction]: Number of co-enabled transitions 312 [2021-03-26 10:28:09,261 INFO L154 LiptonReduction]: Checked pairs total: 124 [2021-03-26 10:28:09,261 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:09,262 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 84 [2021-03-26 10:28:09,262 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 454 flow [2021-03-26 10:28:09,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 0 states have call successors, (0), 0 states 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 10:28:09,264 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:09,264 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:09,264 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:28:09,264 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:09,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:09,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1869618378, now seen corresponding path program 3 times [2021-03-26 10:28:09,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:09,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910780431] [2021-03-26 10:28:09,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:09,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:09,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:28:09,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:09,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:28:09,365 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-26 10:28:09,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 10:28:09,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:09,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:28:09,395 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 10:28:09,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910780431] [2021-03-26 10:28:09,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:09,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:28:09,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109608590] [2021-03-26 10:28:09,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:28:09,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:09,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:28:09,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:28:09,397 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 177 [2021-03-26 10:28:09,398 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 454 flow. Second operand has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states 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 10:28:09,398 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:09,398 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 177 [2021-03-26 10:28:09,398 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:09,607 INFO L129 PetriNetUnfolder]: 214/508 cut-off events. [2021-03-26 10:28:09,608 INFO L130 PetriNetUnfolder]: For 1782/1859 co-relation queries the response was YES. [2021-03-26 10:28:09,610 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2239 conditions, 508 events. 214/508 cut-off events. For 1782/1859 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3184 event pairs, 11 based on Foata normal form. 58/559 useless extension candidates. Maximal degree in co-relation 2211. Up to 220 conditions per place. [2021-03-26 10:28:09,612 INFO L132 encePairwiseOnDemand]: 168/177 looper letters, 22 selfloop transitions, 10 changer transitions 29/72 dead transitions. [2021-03-26 10:28:09,612 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 72 transitions, 754 flow [2021-03-26 10:28:09,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:28:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:28:09,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2021-03-26 10:28:09,614 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7457627118644068 [2021-03-26 10:28:09,614 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2021-03-26 10:28:09,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2021-03-26 10:28:09,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:09,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2021-03-26 10:28:09,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:09,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states 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 10:28:09,618 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states 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 10:28:09,618 INFO L185 Difference]: Start difference. First operand has 59 places, 52 transitions, 454 flow. Second operand 5 states and 660 transitions. [2021-03-26 10:28:09,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 72 transitions, 754 flow [2021-03-26 10:28:09,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 707 flow, removed 9 selfloop flow, removed 5 redundant places. [2021-03-26 10:28:09,624 INFO L241 Difference]: Finished difference. Result has 61 places, 37 transitions, 328 flow [2021-03-26 10:28:09,624 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=328, PETRI_PLACES=61, PETRI_TRANSITIONS=37} [2021-03-26 10:28:09,624 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2021-03-26 10:28:09,624 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:09,624 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 37 transitions, 328 flow [2021-03-26 10:28:09,625 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 37 transitions, 328 flow [2021-03-26 10:28:09,625 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 37 transitions, 328 flow [2021-03-26 10:28:09,651 INFO L129 PetriNetUnfolder]: 58/164 cut-off events. [2021-03-26 10:28:09,651 INFO L130 PetriNetUnfolder]: For 624/628 co-relation queries the response was YES. [2021-03-26 10:28:09,652 INFO L84 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 164 events. 58/164 cut-off events. For 624/628 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 737 event pairs, 7 based on Foata normal form. 4/168 useless extension candidates. Maximal degree in co-relation 641. Up to 80 conditions per place. [2021-03-26 10:28:09,654 INFO L142 LiptonReduction]: Number of co-enabled transitions 200 [2021-03-26 10:28:10,130 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 66 [2021-03-26 10:28:10,472 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 85 [2021-03-26 10:28:10,540 INFO L154 LiptonReduction]: Checked pairs total: 509 [2021-03-26 10:28:10,541 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-26 10:28:10,541 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 917 [2021-03-26 10:28:10,541 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 36 transitions, 346 flow [2021-03-26 10:28:10,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states 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 10:28:10,542 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:10,542 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:10,542 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:28:10,542 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:10,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:10,543 INFO L82 PathProgramCache]: Analyzing trace with hash -90958477, now seen corresponding path program 1 times [2021-03-26 10:28:10,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:10,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902345945] [2021-03-26 10:28:10,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:10,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:10,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:28:10,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:10,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 10:28:10,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:10,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 10:28:10,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:10,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 10:28:10,692 INFO L142 QuantifierPusher]: treesize reduction 5, result has 84.4 percent of original size [2021-03-26 10:28:10,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 10:28:10,713 INFO L142 QuantifierPusher]: treesize reduction 5, result has 80.8 percent of original size [2021-03-26 10:28:10,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 10:28:10,732 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 10:28:10,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902345945] [2021-03-26 10:28:10,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:10,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:28:10,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499071715] [2021-03-26 10:28:10,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:28:10,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:10,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:28:10,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:28:10,735 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 183 [2021-03-26 10:28:10,736 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 36 transitions, 346 flow. Second operand has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states 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 10:28:10,736 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:10,736 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 183 [2021-03-26 10:28:10,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:10,967 INFO L129 PetriNetUnfolder]: 79/193 cut-off events. [2021-03-26 10:28:10,968 INFO L130 PetriNetUnfolder]: For 839/919 co-relation queries the response was YES. [2021-03-26 10:28:10,968 INFO L84 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 193 events. 79/193 cut-off events. For 839/919 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 880 event pairs, 12 based on Foata normal form. 21/209 useless extension candidates. Maximal degree in co-relation 886. Up to 97 conditions per place. [2021-03-26 10:28:10,969 INFO L132 encePairwiseOnDemand]: 170/183 looper letters, 16 selfloop transitions, 23 changer transitions 0/49 dead transitions. [2021-03-26 10:28:10,970 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 49 transitions, 533 flow [2021-03-26 10:28:10,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:28:10,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:28:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 747 transitions. [2021-03-26 10:28:10,973 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.680327868852459 [2021-03-26 10:28:10,973 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 747 transitions. [2021-03-26 10:28:10,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 747 transitions. [2021-03-26 10:28:10,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:10,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 747 transitions. [2021-03-26 10:28:10,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 0 states have call successors, (0), 0 states 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 10:28:10,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states 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 10:28:10,977 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states 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 10:28:10,977 INFO L185 Difference]: Start difference. First operand has 57 places, 36 transitions, 346 flow. Second operand 6 states and 747 transitions. [2021-03-26 10:28:10,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 49 transitions, 533 flow [2021-03-26 10:28:10,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 447 flow, removed 24 selfloop flow, removed 10 redundant places. [2021-03-26 10:28:10,982 INFO L241 Difference]: Finished difference. Result has 53 places, 45 transitions, 410 flow [2021-03-26 10:28:10,982 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=410, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2021-03-26 10:28:10,982 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2021-03-26 10:28:10,982 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:10,982 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 45 transitions, 410 flow [2021-03-26 10:28:10,983 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 45 transitions, 410 flow [2021-03-26 10:28:10,983 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 410 flow [2021-03-26 10:28:11,006 INFO L129 PetriNetUnfolder]: 55/151 cut-off events. [2021-03-26 10:28:11,007 INFO L130 PetriNetUnfolder]: For 410/482 co-relation queries the response was YES. [2021-03-26 10:28:11,007 INFO L84 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 151 events. 55/151 cut-off events. For 410/482 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 638 event pairs, 7 based on Foata normal form. 12/153 useless extension candidates. Maximal degree in co-relation 594. Up to 74 conditions per place. [2021-03-26 10:28:11,009 INFO L142 LiptonReduction]: Number of co-enabled transitions 224 [2021-03-26 10:28:11,046 INFO L154 LiptonReduction]: Checked pairs total: 532 [2021-03-26 10:28:11,046 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:28:11,046 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 64 [2021-03-26 10:28:11,047 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 412 flow [2021-03-26 10:28:11,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states 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 10:28:11,048 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:11,048 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:11,048 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:28:11,048 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:11,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:11,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1985659409, now seen corresponding path program 1 times [2021-03-26 10:28:11,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:11,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553949288] [2021-03-26 10:28:11,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:11,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:11,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:28:11,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:11,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:28:11,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:11,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:28:11,166 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:28:11,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:28:11,169 INFO L142 QuantifierPusher]: treesize reduction 21, result has 77.4 percent of original size [2021-03-26 10:28:11,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 72 [2021-03-26 10:28:11,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:11,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:28:11,224 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 10:28:11,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553949288] [2021-03-26 10:28:11,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:11,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:28:11,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825201024] [2021-03-26 10:28:11,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:28:11,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:11,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:28:11,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:28:11,227 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 184 [2021-03-26 10:28:11,228 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 412 flow. Second operand has 6 states, 6 states have (on average 129.33333333333334) internal successors, (776), 6 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:11,228 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:11,228 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 184 [2021-03-26 10:28:11,229 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:11,352 INFO L129 PetriNetUnfolder]: 77/200 cut-off events. [2021-03-26 10:28:11,352 INFO L130 PetriNetUnfolder]: For 537/620 co-relation queries the response was YES. [2021-03-26 10:28:11,353 INFO L84 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 200 events. 77/200 cut-off events. For 537/620 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 980 event pairs, 15 based on Foata normal form. 18/213 useless extension candidates. Maximal degree in co-relation 863. Up to 97 conditions per place. [2021-03-26 10:28:11,354 INFO L132 encePairwiseOnDemand]: 172/184 looper letters, 19 selfloop transitions, 20 changer transitions 1/50 dead transitions. [2021-03-26 10:28:11,354 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 532 flow [2021-03-26 10:28:11,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:28:11,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:28:11,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 535 transitions. [2021-03-26 10:28:11,356 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7269021739130435 [2021-03-26 10:28:11,356 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 535 transitions. [2021-03-26 10:28:11,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 535 transitions. [2021-03-26 10:28:11,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:11,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 535 transitions. [2021-03-26 10:28:11,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:11,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 184.0) internal successors, (920), 5 states have internal predecessors, (920), 0 states have call successors, (0), 0 states 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 10:28:11,359 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 184.0) internal successors, (920), 5 states have internal predecessors, (920), 0 states have call successors, (0), 0 states 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 10:28:11,359 INFO L185 Difference]: Start difference. First operand has 53 places, 45 transitions, 412 flow. Second operand 4 states and 535 transitions. [2021-03-26 10:28:11,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 532 flow [2021-03-26 10:28:11,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 510 flow, removed 5 selfloop flow, removed 3 redundant places. [2021-03-26 10:28:11,363 INFO L241 Difference]: Finished difference. Result has 54 places, 48 transitions, 484 flow [2021-03-26 10:28:11,363 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=484, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2021-03-26 10:28:11,363 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2021-03-26 10:28:11,363 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:11,363 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 48 transitions, 484 flow [2021-03-26 10:28:11,364 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 48 transitions, 484 flow [2021-03-26 10:28:11,364 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 48 transitions, 484 flow [2021-03-26 10:28:11,390 INFO L129 PetriNetUnfolder]: 57/180 cut-off events. [2021-03-26 10:28:11,390 INFO L130 PetriNetUnfolder]: For 446/463 co-relation queries the response was YES. [2021-03-26 10:28:11,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 764 conditions, 180 events. 57/180 cut-off events. For 446/463 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 941 event pairs, 1 based on Foata normal form. 3/180 useless extension candidates. Maximal degree in co-relation 744. Up to 78 conditions per place. [2021-03-26 10:28:11,392 INFO L142 LiptonReduction]: Number of co-enabled transitions 242 [2021-03-26 10:28:11,733 INFO L154 LiptonReduction]: Checked pairs total: 712 [2021-03-26 10:28:11,733 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:28:11,734 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 371 [2021-03-26 10:28:11,734 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 488 flow [2021-03-26 10:28:11,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 129.33333333333334) internal successors, (776), 6 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:11,734 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:11,735 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:11,735 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:28:11,735 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:11,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:11,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1731987113, now seen corresponding path program 1 times [2021-03-26 10:28:11,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:11,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33493171] [2021-03-26 10:28:11,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:11,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:11,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:11,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:11,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:11,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:11,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:28:11,795 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 10:28:11,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33493171] [2021-03-26 10:28:11,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:11,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:28:11,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488138196] [2021-03-26 10:28:11,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:28:11,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:11,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:28:11,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:28:11,796 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 186 [2021-03-26 10:28:11,797 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 488 flow. Second operand has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states 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 10:28:11,797 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:11,797 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 186 [2021-03-26 10:28:11,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:11,865 INFO L129 PetriNetUnfolder]: 159/366 cut-off events. [2021-03-26 10:28:11,865 INFO L130 PetriNetUnfolder]: For 828/971 co-relation queries the response was YES. [2021-03-26 10:28:11,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 366 events. 159/366 cut-off events. For 828/971 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 2112 event pairs, 52 based on Foata normal form. 81/417 useless extension candidates. Maximal degree in co-relation 1184. Up to 201 conditions per place. [2021-03-26 10:28:11,868 INFO L132 encePairwiseOnDemand]: 180/186 looper letters, 8 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2021-03-26 10:28:11,868 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 357 flow [2021-03-26 10:28:11,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:28:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:28:11,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 778 transitions. [2021-03-26 10:28:11,871 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8365591397849462 [2021-03-26 10:28:11,871 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 778 transitions. [2021-03-26 10:28:11,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 778 transitions. [2021-03-26 10:28:11,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:11,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 778 transitions. [2021-03-26 10:28:11,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 155.6) internal successors, (778), 5 states have internal predecessors, (778), 0 states have call successors, (0), 0 states 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 10:28:11,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states 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 10:28:11,875 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states 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 10:28:11,875 INFO L185 Difference]: Start difference. First operand has 54 places, 48 transitions, 488 flow. Second operand 5 states and 778 transitions. [2021-03-26 10:28:11,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 357 flow [2021-03-26 10:28:11,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 331 flow, removed 3 selfloop flow, removed 8 redundant places. [2021-03-26 10:28:11,878 INFO L241 Difference]: Finished difference. Result has 53 places, 42 transitions, 339 flow [2021-03-26 10:28:11,878 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=5, PETRI_FLOW=339, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2021-03-26 10:28:11,878 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2021-03-26 10:28:11,878 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:11,878 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 42 transitions, 339 flow [2021-03-26 10:28:11,879 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 42 transitions, 339 flow [2021-03-26 10:28:11,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 42 transitions, 339 flow [2021-03-26 10:28:11,916 INFO L129 PetriNetUnfolder]: 157/366 cut-off events. [2021-03-26 10:28:11,917 INFO L130 PetriNetUnfolder]: For 832/918 co-relation queries the response was YES. [2021-03-26 10:28:11,918 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1389 conditions, 366 events. 157/366 cut-off events. For 832/918 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2181 event pairs, 50 based on Foata normal form. 28/369 useless extension candidates. Maximal degree in co-relation 1370. Up to 199 conditions per place. [2021-03-26 10:28:11,921 INFO L142 LiptonReduction]: Number of co-enabled transitions 342 [2021-03-26 10:28:11,927 INFO L154 LiptonReduction]: Checked pairs total: 23 [2021-03-26 10:28:11,927 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:28:11,927 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 49 [2021-03-26 10:28:11,927 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 333 flow [2021-03-26 10:28:11,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states 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 10:28:11,928 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:11,928 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:11,928 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:28:11,928 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:11,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:11,928 INFO L82 PathProgramCache]: Analyzing trace with hash -69476536, now seen corresponding path program 1 times [2021-03-26 10:28:11,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:11,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205888016] [2021-03-26 10:28:11,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:11,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:11,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:11,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:11,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:12,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:12,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:12,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:12,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:28:12,010 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 10:28:12,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205888016] [2021-03-26 10:28:12,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:12,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:28:12,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168894593] [2021-03-26 10:28:12,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:28:12,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:12,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:28:12,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:28:12,012 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 186 [2021-03-26 10:28:12,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 333 flow. Second operand has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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 10:28:12,013 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:12,013 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 186 [2021-03-26 10:28:12,013 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:12,074 INFO L129 PetriNetUnfolder]: 71/215 cut-off events. [2021-03-26 10:28:12,074 INFO L130 PetriNetUnfolder]: For 771/950 co-relation queries the response was YES. [2021-03-26 10:28:12,075 INFO L84 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 215 events. 71/215 cut-off events. For 771/950 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1109 event pairs, 6 based on Foata normal form. 84/293 useless extension candidates. Maximal degree in co-relation 911. Up to 130 conditions per place. [2021-03-26 10:28:12,076 INFO L132 encePairwiseOnDemand]: 180/186 looper letters, 5 selfloop transitions, 11 changer transitions 3/48 dead transitions. [2021-03-26 10:28:12,076 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 411 flow [2021-03-26 10:28:12,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:28:12,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:28:12,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 933 transitions. [2021-03-26 10:28:12,079 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8360215053763441 [2021-03-26 10:28:12,079 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 933 transitions. [2021-03-26 10:28:12,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 933 transitions. [2021-03-26 10:28:12,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:12,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 933 transitions. [2021-03-26 10:28:12,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 155.5) internal successors, (933), 6 states have internal predecessors, (933), 0 states have call successors, (0), 0 states 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 10:28:12,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states 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 10:28:12,083 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states 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 10:28:12,085 INFO L185 Difference]: Start difference. First operand has 53 places, 41 transitions, 333 flow. Second operand 6 states and 933 transitions. [2021-03-26 10:28:12,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 411 flow [2021-03-26 10:28:12,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 48 transitions, 395 flow, removed 6 selfloop flow, removed 2 redundant places. [2021-03-26 10:28:12,088 INFO L241 Difference]: Finished difference. Result has 57 places, 45 transitions, 387 flow [2021-03-26 10:28:12,088 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2021-03-26 10:28:12,088 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2021-03-26 10:28:12,089 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:12,089 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 45 transitions, 387 flow [2021-03-26 10:28:12,089 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 45 transitions, 387 flow [2021-03-26 10:28:12,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 45 transitions, 387 flow [2021-03-26 10:28:12,173 INFO L129 PetriNetUnfolder]: 67/209 cut-off events. [2021-03-26 10:28:12,173 INFO L130 PetriNetUnfolder]: For 593/617 co-relation queries the response was YES. [2021-03-26 10:28:12,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 209 events. 67/209 cut-off events. For 593/617 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1139 event pairs, 6 based on Foata normal form. 7/211 useless extension candidates. Maximal degree in co-relation 929. Up to 124 conditions per place. [2021-03-26 10:28:12,176 INFO L142 LiptonReduction]: Number of co-enabled transitions 290 [2021-03-26 10:28:12,212 INFO L154 LiptonReduction]: Checked pairs total: 23 [2021-03-26 10:28:12,212 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:28:12,212 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 123 [2021-03-26 10:28:12,215 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 377 flow [2021-03-26 10:28:12,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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 10:28:12,216 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:12,216 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 10:28:12,216 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 10:28:12,216 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:12,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:12,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1780630011, now seen corresponding path program 1 times [2021-03-26 10:28:12,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:12,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548847578] [2021-03-26 10:28:12,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:12,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:12,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:12,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:12,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:12,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:12,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:12,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:12,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:12,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:12,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:28:12,310 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 10:28:12,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548847578] [2021-03-26 10:28:12,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:12,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:28:12,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940411574] [2021-03-26 10:28:12,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:28:12,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:12,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:28:12,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:28:12,314 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 187 [2021-03-26 10:28:12,315 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 377 flow. Second operand has 6 states, 6 states have (on average 153.83333333333334) internal successors, (923), 6 states have internal predecessors, (923), 0 states have call successors, (0), 0 states 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 10:28:12,315 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:12,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 187 [2021-03-26 10:28:12,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:12,373 INFO L129 PetriNetUnfolder]: 38/128 cut-off events. [2021-03-26 10:28:12,373 INFO L130 PetriNetUnfolder]: For 560/642 co-relation queries the response was YES. [2021-03-26 10:28:12,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 128 events. 38/128 cut-off events. For 560/642 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 529 event pairs, 0 based on Foata normal form. 50/175 useless extension candidates. Maximal degree in co-relation 618. Up to 73 conditions per place. [2021-03-26 10:28:12,375 INFO L132 encePairwiseOnDemand]: 181/187 looper letters, 2 selfloop transitions, 11 changer transitions 3/44 dead transitions. [2021-03-26 10:28:12,375 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 44 transitions, 409 flow [2021-03-26 10:28:12,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:28:12,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:28:12,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1089 transitions. [2021-03-26 10:28:12,378 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8319327731092437 [2021-03-26 10:28:12,378 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1089 transitions. [2021-03-26 10:28:12,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1089 transitions. [2021-03-26 10:28:12,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:12,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1089 transitions. [2021-03-26 10:28:12,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states 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 10:28:12,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 187.0) internal successors, (1496), 8 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states 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 10:28:12,383 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 187.0) internal successors, (1496), 8 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states 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 10:28:12,383 INFO L185 Difference]: Start difference. First operand has 56 places, 43 transitions, 377 flow. Second operand 7 states and 1089 transitions. [2021-03-26 10:28:12,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 44 transitions, 409 flow [2021-03-26 10:28:12,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 44 transitions, 367 flow, removed 15 selfloop flow, removed 5 redundant places. [2021-03-26 10:28:12,386 INFO L241 Difference]: Finished difference. Result has 58 places, 41 transitions, 347 flow [2021-03-26 10:28:12,386 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=347, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2021-03-26 10:28:12,386 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2021-03-26 10:28:12,387 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:12,387 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 41 transitions, 347 flow [2021-03-26 10:28:12,387 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 41 transitions, 347 flow [2021-03-26 10:28:12,387 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 41 transitions, 347 flow [2021-03-26 10:28:12,401 INFO L129 PetriNetUnfolder]: 34/122 cut-off events. [2021-03-26 10:28:12,402 INFO L130 PetriNetUnfolder]: For 289/298 co-relation queries the response was YES. [2021-03-26 10:28:12,402 INFO L84 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 122 events. 34/122 cut-off events. For 289/298 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 550 event pairs, 0 based on Foata normal form. 2/123 useless extension candidates. Maximal degree in co-relation 531. Up to 42 conditions per place. [2021-03-26 10:28:12,403 INFO L142 LiptonReduction]: Number of co-enabled transitions 184 [2021-03-26 10:28:13,109 WARN L205 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 182 [2021-03-26 10:28:13,335 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2021-03-26 10:28:15,329 WARN L205 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 337 DAG size of output: 264 [2021-03-26 10:28:15,908 WARN L205 SmtUtils]: Spent 577.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2021-03-26 10:28:16,200 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:28:16,438 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:28:17,017 WARN L205 SmtUtils]: Spent 577.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-26 10:28:17,617 WARN L205 SmtUtils]: Spent 598.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-26 10:28:17,622 INFO L154 LiptonReduction]: Checked pairs total: 11 [2021-03-26 10:28:17,622 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:28:17,622 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5235 [2021-03-26 10:28:17,623 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 333 flow [2021-03-26 10:28:17,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 153.83333333333334) internal successors, (923), 6 states have internal predecessors, (923), 0 states have call successors, (0), 0 states 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 10:28:17,623 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:17,623 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:17,623 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 10:28:17,623 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:17,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:17,624 INFO L82 PathProgramCache]: Analyzing trace with hash -214210116, now seen corresponding path program 1 times [2021-03-26 10:28:17,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:17,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160334475] [2021-03-26 10:28:17,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:17,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:17,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:28:17,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:17,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 10:28:17,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:17,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 10:28:17,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:17,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 10:28:17,747 INFO L142 QuantifierPusher]: treesize reduction 51, result has 59.8 percent of original size [2021-03-26 10:28:17,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 76 [2021-03-26 10:28:17,789 INFO L142 QuantifierPusher]: treesize reduction 37, result has 52.6 percent of original size [2021-03-26 10:28:17,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 10:28:17,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:17,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 10:28:17,854 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.4 percent of original size [2021-03-26 10:28:17,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-26 10:28:17,889 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 10:28:17,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160334475] [2021-03-26 10:28:17,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:17,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 10:28:17,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757178400] [2021-03-26 10:28:17,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 10:28:17,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:17,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 10:28:17,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-03-26 10:28:17,891 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 189 [2021-03-26 10:28:17,892 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 333 flow. Second operand has 9 states, 9 states have (on average 121.0) internal successors, (1089), 9 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states 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 10:28:17,892 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:17,892 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 189 [2021-03-26 10:28:17,892 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:18,100 INFO L129 PetriNetUnfolder]: 46/143 cut-off events. [2021-03-26 10:28:18,100 INFO L130 PetriNetUnfolder]: For 702/774 co-relation queries the response was YES. [2021-03-26 10:28:18,101 INFO L84 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 143 events. 46/143 cut-off events. For 702/774 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 646 event pairs, 0 based on Foata normal form. 27/166 useless extension candidates. Maximal degree in co-relation 680. Up to 55 conditions per place. [2021-03-26 10:28:18,101 INFO L132 encePairwiseOnDemand]: 184/189 looper letters, 20 selfloop transitions, 2 changer transitions 11/47 dead transitions. [2021-03-26 10:28:18,101 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 47 transitions, 480 flow [2021-03-26 10:28:18,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:28:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:28:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 736 transitions. [2021-03-26 10:28:18,104 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6490299823633157 [2021-03-26 10:28:18,104 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 736 transitions. [2021-03-26 10:28:18,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 736 transitions. [2021-03-26 10:28:18,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:18,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 736 transitions. [2021-03-26 10:28:18,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:18,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states 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 10:28:18,114 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states 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 10:28:18,114 INFO L185 Difference]: Start difference. First operand has 54 places, 38 transitions, 333 flow. Second operand 6 states and 736 transitions. [2021-03-26 10:28:18,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 47 transitions, 480 flow [2021-03-26 10:28:18,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 47 transitions, 429 flow, removed 15 selfloop flow, removed 8 redundant places. [2021-03-26 10:28:18,117 INFO L241 Difference]: Finished difference. Result has 52 places, 36 transitions, 269 flow [2021-03-26 10:28:18,117 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2021-03-26 10:28:18,117 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2021-03-26 10:28:18,118 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:18,118 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 36 transitions, 269 flow [2021-03-26 10:28:18,118 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 36 transitions, 269 flow [2021-03-26 10:28:18,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 36 transitions, 269 flow [2021-03-26 10:28:18,130 INFO L129 PetriNetUnfolder]: 32/100 cut-off events. [2021-03-26 10:28:18,131 INFO L130 PetriNetUnfolder]: For 151/156 co-relation queries the response was YES. [2021-03-26 10:28:18,131 INFO L84 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 100 events. 32/100 cut-off events. For 151/156 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 423 event pairs, 0 based on Foata normal form. 4/103 useless extension candidates. Maximal degree in co-relation 356. Up to 30 conditions per place. [2021-03-26 10:28:18,132 INFO L142 LiptonReduction]: Number of co-enabled transitions 140 [2021-03-26 10:28:18,359 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-26 10:28:18,784 WARN L205 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 92 [2021-03-26 10:28:18,925 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-26 10:28:18,929 INFO L154 LiptonReduction]: Checked pairs total: 2 [2021-03-26 10:28:18,929 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:28:18,929 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 811 [2021-03-26 10:28:18,930 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 276 flow [2021-03-26 10:28:18,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 121.0) internal successors, (1089), 9 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states 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 10:28:18,930 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:18,930 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 10:28:18,930 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-26 10:28:18,930 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:18,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:18,931 INFO L82 PathProgramCache]: Analyzing trace with hash -905453319, now seen corresponding path program 1 times [2021-03-26 10:28:18,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:18,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735627483] [2021-03-26 10:28:18,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:18,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:18,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:18,988 INFO L142 QuantifierPusher]: treesize reduction 9, result has 66.7 percent of original size [2021-03-26 10:28:18,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:28:19,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:19,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:28:19,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:19,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:28:19,023 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 10:28:19,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735627483] [2021-03-26 10:28:19,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:19,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:28:19,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94688441] [2021-03-26 10:28:19,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:28:19,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:19,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:28:19,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:28:19,025 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 190 [2021-03-26 10:28:19,026 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 276 flow. Second operand has 6 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 0 states 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 10:28:19,026 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:19,026 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 190 [2021-03-26 10:28:19,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:19,161 INFO L129 PetriNetUnfolder]: 41/127 cut-off events. [2021-03-26 10:28:19,161 INFO L130 PetriNetUnfolder]: For 253/291 co-relation queries the response was YES. [2021-03-26 10:28:19,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 127 events. 41/127 cut-off events. For 253/291 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 554 event pairs, 0 based on Foata normal form. 16/139 useless extension candidates. Maximal degree in co-relation 493. Up to 40 conditions per place. [2021-03-26 10:28:19,163 INFO L132 encePairwiseOnDemand]: 183/190 looper letters, 16 selfloop transitions, 5 changer transitions 10/45 dead transitions. [2021-03-26 10:28:19,163 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 45 transitions, 415 flow [2021-03-26 10:28:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:28:19,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:28:19,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 787 transitions. [2021-03-26 10:28:19,166 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6903508771929825 [2021-03-26 10:28:19,166 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 787 transitions. [2021-03-26 10:28:19,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 787 transitions. [2021-03-26 10:28:19,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:19,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 787 transitions. [2021-03-26 10:28:19,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.16666666666666) internal successors, (787), 6 states have internal predecessors, (787), 0 states have call successors, (0), 0 states 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 10:28:19,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 190.0) internal successors, (1330), 7 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states 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 10:28:19,170 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 190.0) internal successors, (1330), 7 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states 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 10:28:19,170 INFO L185 Difference]: Start difference. First operand has 49 places, 36 transitions, 276 flow. Second operand 6 states and 787 transitions. [2021-03-26 10:28:19,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 45 transitions, 415 flow [2021-03-26 10:28:19,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 405 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-26 10:28:19,172 INFO L241 Difference]: Finished difference. Result has 52 places, 35 transitions, 274 flow [2021-03-26 10:28:19,172 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=274, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2021-03-26 10:28:19,173 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2021-03-26 10:28:19,173 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:19,173 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 35 transitions, 274 flow [2021-03-26 10:28:19,173 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 35 transitions, 274 flow [2021-03-26 10:28:19,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 35 transitions, 274 flow [2021-03-26 10:28:19,184 INFO L129 PetriNetUnfolder]: 28/90 cut-off events. [2021-03-26 10:28:19,185 INFO L130 PetriNetUnfolder]: For 164/180 co-relation queries the response was YES. [2021-03-26 10:28:19,185 INFO L84 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 90 events. 28/90 cut-off events. For 164/180 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 366 event pairs, 0 based on Foata normal form. 4/93 useless extension candidates. Maximal degree in co-relation 329. Up to 27 conditions per place. [2021-03-26 10:28:19,186 INFO L142 LiptonReduction]: Number of co-enabled transitions 126 [2021-03-26 10:28:19,188 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:28:19,188 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:19,188 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-26 10:28:19,189 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 274 flow [2021-03-26 10:28:19,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 0 states 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 10:28:19,189 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:19,189 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:19,189 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-26 10:28:19,189 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:19,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:19,190 INFO L82 PathProgramCache]: Analyzing trace with hash -860609680, now seen corresponding path program 1 times [2021-03-26 10:28:19,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:19,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591800751] [2021-03-26 10:28:19,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:28:19,245 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:28:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:28:19,319 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:28:19,363 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:28:19,363 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:28:19,364 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-26 10:28:19,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:28:19 BasicIcfg [2021-03-26 10:28:19,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:28:19,457 INFO L168 Benchmark]: Toolchain (without parser) took 33291.73 ms. Allocated memory was 362.8 MB in the beginning and 861.9 MB in the end (delta: 499.1 MB). Free memory was 325.3 MB in the beginning and 555.3 MB in the end (delta: -230.0 MB). Peak memory consumption was 269.6 MB. Max. memory is 16.0 GB. [2021-03-26 10:28:19,457 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 362.8 MB. Free memory was 343.9 MB in the beginning and 343.8 MB in the end (delta: 76.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:28:19,457 INFO L168 Benchmark]: CACSL2BoogieTranslator took 598.74 ms. Allocated memory is still 362.8 MB. Free memory was 325.1 MB in the beginning and 319.4 MB in the end (delta: 5.7 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.0 GB. [2021-03-26 10:28:19,457 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.56 ms. Allocated memory is still 362.8 MB. Free memory was 319.4 MB in the beginning and 315.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:28:19,457 INFO L168 Benchmark]: Boogie Preprocessor took 68.53 ms. Allocated memory is still 362.8 MB. Free memory was 315.2 MB in the beginning and 312.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:28:19,457 INFO L168 Benchmark]: RCFGBuilder took 3070.41 ms. Allocated memory was 362.8 MB in the beginning and 436.2 MB in the end (delta: 73.4 MB). Free memory was 312.1 MB in the beginning and 292.7 MB in the end (delta: 19.4 MB). Peak memory consumption was 164.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:28:19,457 INFO L168 Benchmark]: TraceAbstraction took 29468.52 ms. Allocated memory was 436.2 MB in the beginning and 861.9 MB in the end (delta: 425.7 MB). Free memory was 292.7 MB in the beginning and 555.3 MB in the end (delta: -262.6 MB). Peak memory consumption was 163.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:28:19,463 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.44 ms. Allocated memory is still 362.8 MB. Free memory was 343.9 MB in the beginning and 343.8 MB in the end (delta: 76.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 598.74 ms. Allocated memory is still 362.8 MB. Free memory was 325.1 MB in the beginning and 319.4 MB in the end (delta: 5.7 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 77.56 ms. Allocated memory is still 362.8 MB. Free memory was 319.4 MB in the beginning and 315.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 68.53 ms. Allocated memory is still 362.8 MB. Free memory was 315.2 MB in the beginning and 312.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 3070.41 ms. Allocated memory was 362.8 MB in the beginning and 436.2 MB in the end (delta: 73.4 MB). Free memory was 312.1 MB in the beginning and 292.7 MB in the end (delta: 19.4 MB). Peak memory consumption was 164.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 29468.52 ms. Allocated memory was 436.2 MB in the beginning and 861.9 MB in the end (delta: 425.7 MB). Free memory was 292.7 MB in the beginning and 555.3 MB in the end (delta: -262.6 MB). Peak memory consumption was 163.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10978.0ms, 103 PlacesBefore, 49 PlacesAfterwards, 95 TransitionsBefore, 40 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 6 FixpointIterations, 24 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 66 TotalNumberOfCompositions, 3349 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1450, positive: 1353, positive conditional: 1353, positive unconditional: 0, negative: 97, negative conditional: 97, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1450, positive: 1353, positive conditional: 0, positive unconditional: 1353, negative: 97, negative conditional: 0, negative unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1450, positive: 1353, positive conditional: 0, positive unconditional: 1353, negative: 97, negative conditional: 0, negative unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1119, positive: 1089, positive conditional: 0, positive unconditional: 1089, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1119, positive: 1082, positive conditional: 0, positive unconditional: 1082, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 37, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 758, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 739, negative conditional: 0, negative unconditional: 739, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1450, positive: 264, positive conditional: 0, positive unconditional: 264, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 1119, unknown conditional: 0, unknown unconditional: 1119] , Statistics on independence cache: Total cache size (in pairs): 1119, Positive cache size: 1089, Positive conditional cache size: 0, Positive unconditional cache size: 1089, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3356.2ms, 46 PlacesBefore, 32 PlacesAfterwards, 35 TransitionsBefore, 23 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 5 FixpointIterations, 11 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1518 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 275, positive: 166, positive conditional: 166, positive unconditional: 0, negative: 109, negative conditional: 109, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 275, positive: 166, positive conditional: 12, positive unconditional: 154, negative: 109, negative conditional: 5, negative unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 275, positive: 166, positive conditional: 12, positive unconditional: 154, negative: 109, negative conditional: 5, negative unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 38, positive: 23, positive conditional: 3, positive unconditional: 20, negative: 15, negative conditional: 1, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 38, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 15, negative conditional: 1, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 305, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 305, negative conditional: 20, negative unconditional: 285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 275, positive: 143, positive conditional: 9, positive unconditional: 134, negative: 94, negative conditional: 4, negative unconditional: 90, unknown: 38, unknown conditional: 4, unknown unconditional: 34] , Statistics on independence cache: Total cache size (in pairs): 1157, Positive cache size: 1112, Positive conditional cache size: 3, Positive unconditional cache size: 1109, Negative cache size: 45, Negative conditional cache size: 1, Negative unconditional cache size: 44, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1029.1ms, 33 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 518 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 144, positive: 104, positive conditional: 104, positive unconditional: 0, negative: 40, negative conditional: 40, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 144, positive: 104, positive conditional: 0, positive unconditional: 104, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 144, positive: 104, positive conditional: 0, positive unconditional: 104, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 40, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 40, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 112, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 95, negative conditional: 0, negative unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 144, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 40, unknown conditional: 0, unknown unconditional: 40] , Statistics on independence cache: Total cache size (in pairs): 1197, Positive cache size: 1144, Positive conditional cache size: 3, Positive unconditional cache size: 1141, Negative cache size: 53, Negative conditional cache size: 1, Negative unconditional cache size: 52, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.4ms, 32 PlacesBefore, 32 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 257 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 74, positive: 54, positive conditional: 54, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 74, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 74, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 23, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 74, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1200, Positive cache size: 1146, Positive conditional cache size: 3, Positive unconditional cache size: 1143, Negative cache size: 54, Negative conditional cache size: 1, Negative unconditional cache size: 53, Eliminated conditions: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9ms, 32 PlacesBefore, 32 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 244 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, positive: 54, positive conditional: 54, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 73, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 73, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 73, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 1206, Positive cache size: 1152, Positive conditional cache size: 3, Positive unconditional cache size: 1149, Negative cache size: 54, Negative conditional cache size: 1, Negative unconditional cache size: 53, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 89.1ms, 35 PlacesBefore, 35 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 159 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, positive: 45, positive conditional: 45, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 5, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 76, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1211, Positive cache size: 1155, Positive conditional cache size: 3, Positive unconditional cache size: 1152, Negative cache size: 56, Negative conditional cache size: 1, Negative unconditional cache size: 55, Eliminated conditions: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.1ms, 38 PlacesBefore, 38 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 131 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, positive: 37, positive conditional: 37, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 47, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1212, Positive cache size: 1156, Positive conditional cache size: 3, Positive unconditional cache size: 1153, Negative cache size: 56, Negative conditional cache size: 1, Negative unconditional cache size: 55, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 271.6ms, 43 PlacesBefore, 43 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 272 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 127 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, positive: 67, positive conditional: 67, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78, positive: 67, positive conditional: 4, positive unconditional: 63, negative: 11, negative conditional: 2, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78, positive: 67, positive conditional: 4, positive unconditional: 63, negative: 11, negative conditional: 2, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 6, positive conditional: 2, positive unconditional: 4, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 228, positive: 117, positive conditional: 117, positive unconditional: 0, negative: 110, negative conditional: 81, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, positive: 61, positive conditional: 2, positive unconditional: 59, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 9, unknown conditional: 4, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1221, Positive cache size: 1162, Positive conditional cache size: 5, Positive unconditional cache size: 1157, Negative cache size: 59, Negative conditional cache size: 3, Negative unconditional cache size: 56, Eliminated conditions: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 216.6ms, 53 PlacesBefore, 52 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 103 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, positive: 58, positive conditional: 58, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, positive: 58, positive conditional: 15, positive unconditional: 43, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, positive: 58, positive conditional: 15, positive unconditional: 43, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 2, positive unconditional: 2, 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: 5, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 134, positive: 100, positive conditional: 100, positive unconditional: 0, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, positive: 54, positive conditional: 13, positive unconditional: 41, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1226, Positive cache size: 1166, Positive conditional cache size: 7, Positive unconditional cache size: 1159, Negative cache size: 60, Negative conditional cache size: 3, Negative unconditional cache size: 57, Eliminated conditions: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 117.8ms, 56 PlacesBefore, 56 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 173 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 145, positive: 136, positive conditional: 136, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 145, positive: 136, positive conditional: 28, positive unconditional: 108, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 145, positive: 136, positive conditional: 28, positive unconditional: 108, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 145, positive: 136, positive conditional: 28, positive unconditional: 108, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1226, Positive cache size: 1166, Positive conditional cache size: 7, Positive unconditional cache size: 1159, Negative cache size: 60, Negative conditional cache size: 3, Negative unconditional cache size: 57, Eliminated conditions: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 82.7ms, 59 PlacesBefore, 59 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 312 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 124 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, positive: 80, positive conditional: 80, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 86, positive: 80, positive conditional: 18, positive unconditional: 62, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 86, positive: 80, positive conditional: 18, positive unconditional: 62, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 86, positive: 79, positive conditional: 17, positive unconditional: 62, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1227, Positive cache size: 1167, Positive conditional cache size: 8, Positive unconditional cache size: 1159, Negative cache size: 60, Negative conditional cache size: 3, Negative unconditional cache size: 57, Eliminated conditions: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 916.0ms, 61 PlacesBefore, 57 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 509 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 346, positive: 320, positive conditional: 320, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 346, positive: 320, positive conditional: 82, positive unconditional: 238, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 346, positive: 320, positive conditional: 82, positive unconditional: 238, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 8, positive unconditional: 4, 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: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 346, positive: 308, positive conditional: 74, positive unconditional: 234, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 12, unknown conditional: 8, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1239, Positive cache size: 1179, Positive conditional cache size: 16, Positive unconditional cache size: 1163, Negative cache size: 60, Negative conditional cache size: 3, Negative unconditional cache size: 57, Eliminated conditions: 69 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 63.6ms, 53 PlacesBefore, 53 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 224 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 532 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 425, positive: 401, positive conditional: 401, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 425, positive: 401, positive conditional: 143, positive unconditional: 258, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 425, positive: 401, positive conditional: 143, positive unconditional: 258, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 4, positive unconditional: 1, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 425, positive: 396, positive conditional: 139, positive unconditional: 257, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1244, Positive cache size: 1184, Positive conditional cache size: 20, Positive unconditional cache size: 1164, Negative cache size: 60, Negative conditional cache size: 3, Negative unconditional cache size: 57, Eliminated conditions: 88 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 369.9ms, 54 PlacesBefore, 54 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 712 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 584, positive: 554, positive conditional: 554, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 584, positive: 554, positive conditional: 256, positive unconditional: 298, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 584, positive: 554, positive conditional: 256, positive unconditional: 298, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 9, positive unconditional: 1, 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: 10, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 275, positive: 275, positive conditional: 275, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 584, positive: 544, positive conditional: 247, positive unconditional: 297, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 10, unknown conditional: 9, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1254, Positive cache size: 1194, Positive conditional cache size: 29, Positive unconditional cache size: 1165, Negative cache size: 60, Negative conditional cache size: 3, Negative unconditional cache size: 57, Eliminated conditions: 90 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 48.1ms, 53 PlacesBefore, 53 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 23 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.Independence Queries: [ total: 23, positive: 23, positive conditional: 20, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23, positive: 23, positive conditional: 20, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 6, positive unconditional: 2, 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: 8, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 23, positive: 15, positive conditional: 14, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 8, unknown conditional: 6, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1262, Positive cache size: 1202, Positive conditional cache size: 35, Positive unconditional cache size: 1167, Negative cache size: 60, Negative conditional cache size: 3, Negative unconditional cache size: 57, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 123.0ms, 57 PlacesBefore, 56 PlacesAfterwards, 45 TransitionsBefore, 43 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 23 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.Independence Queries: [ total: 23, positive: 23, positive conditional: 20, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23, positive: 23, positive conditional: 20, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 23, positive: 23, positive conditional: 20, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1262, Positive cache size: 1202, Positive conditional cache size: 35, Positive unconditional cache size: 1167, Negative cache size: 60, Negative conditional cache size: 3, Negative unconditional cache size: 57, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5235.4ms, 58 PlacesBefore, 54 PlacesAfterwards, 41 TransitionsBefore, 38 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 11 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 11, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1263, Positive cache size: 1203, Positive conditional cache size: 36, Positive unconditional cache size: 1167, Negative cache size: 60, Negative conditional cache size: 3, Negative unconditional cache size: 57, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 811.1ms, 52 PlacesBefore, 49 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 2 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1265, Positive cache size: 1205, Positive conditional cache size: 36, Positive unconditional cache size: 1169, Negative cache size: 60, Negative conditional cache size: 3, Negative unconditional cache size: 57, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.7ms, 52 PlacesBefore, 51 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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] , Statistics on independence cache: Total cache size (in pairs): 1265, Positive cache size: 1205, Positive conditional cache size: 36, Positive unconditional cache size: 1169, Negative cache size: 60, Negative conditional cache size: 3, Negative unconditional cache size: 57, Eliminated conditions: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1855; [L847] FCALL, FORK 0 pthread_create(&t1855, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L848] 0 pthread_t t1856; [L849] FCALL, FORK 0 pthread_create(&t1856, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L850] 0 pthread_t t1857; [L851] FCALL, FORK 0 pthread_create(&t1857, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 2 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 1 y$r_buff0_thd1 = (_Bool)1 [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x [L775] 2 y = 1 [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L778] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L778] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L780] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L781] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L782] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 y$flush_delayed = weak$$choice2 [L795] 3 y$mem_tmp = y [L796] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L796] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L797] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L797] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L798] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L798] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L799] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L799] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L801] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L802] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = y [L804] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L804] 3 y = y$flush_delayed ? y$mem_tmp : y [L805] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 y$flush_delayed = weak$$choice2 [L811] 3 y$mem_tmp = y [L812] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L812] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L813] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L814] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L814] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L815] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L815] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L816] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L817] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L818] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EBX = y [L820] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L820] 3 y = y$flush_delayed ? y$mem_tmp : y [L821] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L758] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L759] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L760] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L761] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L761] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L762] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L824] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L824] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L826] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L828] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L876] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=54, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 29225.2ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2601.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 11071.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 82 SDtfs, 67 SDslu, 52 SDs, 0 SdLazy, 540 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 763.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 890.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=488occurred in iteration=13, InterpolantAutomatonStates: 87, 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: 71.2ms SsaConstructionTime, 693.8ms SatisfiabilityAnalysisTime, 1575.8ms InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 1991 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...