/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 15:02:37,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 15:02:37,953 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 15:02:37,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 15:02:37,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 15:02:37,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 15:02:37,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 15:02:37,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 15:02:37,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 15:02:38,013 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 15:02:38,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 15:02:38,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 15:02:38,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 15:02:38,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 15:02:38,019 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 15:02:38,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 15:02:38,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 15:02:38,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 15:02:38,027 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 15:02:38,031 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 15:02:38,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 15:02:38,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 15:02:38,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 15:02:38,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 15:02:38,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 15:02:38,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 15:02:38,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 15:02:38,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 15:02:38,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 15:02:38,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 15:02:38,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 15:02:38,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 15:02:38,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 15:02:38,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 15:02:38,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 15:02:38,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 15:02:38,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 15:02:38,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 15:02:38,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 15:02:38,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 15:02:38,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 15:02:38,057 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-03-25 15:02:38,092 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 15:02:38,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 15:02:38,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 15:02:38,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 15:02:38,095 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 15:02:38,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 15:02:38,096 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 15:02:38,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 15:02:38,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 15:02:38,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 15:02:38,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 15:02:38,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 15:02:38,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 15:02:38,097 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 15:02:38,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 15:02:38,097 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 15:02:38,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 15:02:38,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 15:02:38,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 15:02:38,098 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 15:02:38,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 15:02:38,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 15:02:38,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 15:02:38,098 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 15:02:38,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 15:02:38,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 15:02:38,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 15:02:38,099 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 15:02:38,099 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 15:02:38,099 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 15:02:38,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 15:02:38,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 15:02:38,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 15:02:38,422 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 15:02:38,423 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 15:02:38,424 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.oepc.i [2021-03-25 15:02:38,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36c7f7520/513858a5eaf94abfb6dc5637e39f8ded/FLAGde4474580 [2021-03-25 15:02:38,997 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 15:02:38,998 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_rmo.oepc.i [2021-03-25 15:02:39,015 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36c7f7520/513858a5eaf94abfb6dc5637e39f8ded/FLAGde4474580 [2021-03-25 15:02:39,488 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36c7f7520/513858a5eaf94abfb6dc5637e39f8ded [2021-03-25 15:02:39,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 15:02:39,491 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 15:02:39,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 15:02:39,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 15:02:39,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 15:02:39,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 03:02:39" (1/1) ... [2021-03-25 15:02:39,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ceee96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:39, skipping insertion in model container [2021-03-25 15:02:39,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 03:02:39" (1/1) ... [2021-03-25 15:02:39,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 15:02:39,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 15:02:39,678 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/safe032_rmo.oepc.i[993,1006] [2021-03-25 15:02:39,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 15:02:39,942 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 15:02:39,952 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/safe032_rmo.oepc.i[993,1006] [2021-03-25 15:02:40,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 15:02:40,093 INFO L208 MainTranslator]: Completed translation [2021-03-25 15:02:40,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:40 WrapperNode [2021-03-25 15:02:40,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 15:02:40,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 15:02:40,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 15:02:40,097 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 15:02:40,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:40" (1/1) ... [2021-03-25 15:02:40,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:40" (1/1) ... [2021-03-25 15:02:40,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 15:02:40,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 15:02:40,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 15:02:40,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 15:02:40,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:40" (1/1) ... [2021-03-25 15:02:40,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:40" (1/1) ... [2021-03-25 15:02:40,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:40" (1/1) ... [2021-03-25 15:02:40,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:40" (1/1) ... [2021-03-25 15:02:40,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:40" (1/1) ... [2021-03-25 15:02:40,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:40" (1/1) ... [2021-03-25 15:02:40,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:40" (1/1) ... [2021-03-25 15:02:40,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 15:02:40,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 15:02:40,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 15:02:40,206 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 15:02:40,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 15:02:40,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 15:02:40,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 15:02:40,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 15:02:40,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 15:02:40,285 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 15:02:40,286 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 15:02:40,286 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 15:02:40,287 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 15:02:40,287 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 15:02:40,287 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 15:02:40,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 15:02:40,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 15:02:40,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 15:02:40,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 15:02:40,289 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 15:02:42,934 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 15:02:42,934 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 15:02:42,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 03:02:42 BoogieIcfgContainer [2021-03-25 15:02:42,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 15:02:42,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 15:02:42,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 15:02:42,940 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 15:02:42,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 03:02:39" (1/3) ... [2021-03-25 15:02:42,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36775a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 03:02:42, skipping insertion in model container [2021-03-25 15:02:42,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:40" (2/3) ... [2021-03-25 15:02:42,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36775a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 03:02:42, skipping insertion in model container [2021-03-25 15:02:42,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 03:02:42" (3/3) ... [2021-03-25 15:02:42,943 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_rmo.oepc.i [2021-03-25 15:02:42,949 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 15:02:42,952 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 15:02:42,953 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 15:02:43,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,001 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,001 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,002 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,002 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,004 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,004 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,004 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,006 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,006 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,006 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,006 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,006 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,006 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,009 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,009 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,009 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,009 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,009 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,009 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,009 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,009 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,010 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,010 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,010 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,010 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,010 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,010 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,010 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,010 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,010 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,010 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,014 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,016 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,016 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,016 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,016 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,017 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,017 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,027 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,027 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,027 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,039 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,039 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,039 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,039 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,039 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,039 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,039 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,039 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,039 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,041 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,041 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,042 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,042 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,042 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,042 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,043 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,043 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,053 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,053 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,053 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,053 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,058 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,058 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,063 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,065 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,067 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,067 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,068 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:43,071 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 15:02:43,086 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 15:02:43,113 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 15:02:43,113 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 15:02:43,113 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 15:02:43,113 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 15:02:43,113 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 15:02:43,113 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 15:02:43,113 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 15:02:43,113 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 15:02:43,129 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-25 15:02:43,170 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-25 15:02:43,170 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:02:43,178 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 15:02:43,179 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-25 15:02:43,189 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-25 15:02:43,190 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:02:43,200 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-25 15:02:43,202 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-25 15:02:43,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-25 15:02:43,233 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-25 15:02:43,233 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:02:43,240 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 15:02:43,244 INFO L142 LiptonReduction]: Number of co-enabled transitions 1668 [2021-03-25 15:02:44,236 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 15:02:44,655 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 15:02:44,779 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 15:02:46,493 WARN L205 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-03-25 15:02:46,796 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-25 15:02:48,104 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-25 15:02:48,720 WARN L205 SmtUtils]: Spent 614.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 15:02:49,515 INFO L154 LiptonReduction]: Checked pairs total: 3146 [2021-03-25 15:02:49,515 INFO L156 LiptonReduction]: Total number of compositions: 65 [2021-03-25 15:02:49,518 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6329 [2021-03-25 15:02:49,527 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-25 15:02:49,528 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:02:49,528 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:02:49,528 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:02:49,529 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:02:49,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:02:49,533 INFO L82 PathProgramCache]: Analyzing trace with hash -281805230, now seen corresponding path program 1 times [2021-03-25 15:02:49,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:02:49,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169584723] [2021-03-25 15:02:49,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:02:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:02:49,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:49,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:02:49,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:49,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:02:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:02:49,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169584723] [2021-03-25 15:02:49,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:02:49,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 15:02:49,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776212861] [2021-03-25 15:02:49,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 15:02:49,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:02:49,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 15:02:49,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 15:02:49,754 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 162 [2021-03-25 15:02:49,758 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:49,758 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:02:49,758 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 162 [2021-03-25 15:02:49,759 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:02:49,919 INFO L129 PetriNetUnfolder]: 115/301 cut-off events. [2021-03-25 15:02:49,919 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:02:49,921 INFO L84 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 301 events. 115/301 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1513 event pairs, 39 based on Foata normal form. 22/293 useless extension candidates. Maximal degree in co-relation 479. Up to 141 conditions per place. [2021-03-25 15:02:49,924 INFO L132 encePairwiseOnDemand]: 158/162 looper letters, 13 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2021-03-25 15:02:49,924 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 121 flow [2021-03-25 15:02:49,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 15:02:49,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 15:02:49,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2021-03-25 15:02:49,941 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8827160493827161 [2021-03-25 15:02:49,942 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2021-03-25 15:02:49,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2021-03-25 15:02:49,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:02:49,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2021-03-25 15:02:49,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:49,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:49,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:49,964 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 429 transitions. [2021-03-25 15:02:49,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 121 flow [2021-03-25 15:02:49,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 118 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 15:02:49,968 INFO L241 Difference]: Finished difference. Result has 44 places, 35 transitions, 80 flow [2021-03-25 15:02:49,970 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2021-03-25 15:02:49,970 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-25 15:02:49,970 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:02:49,971 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 80 flow [2021-03-25 15:02:49,971 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 80 flow [2021-03-25 15:02:49,972 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 80 flow [2021-03-25 15:02:49,977 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-03-25 15:02:49,977 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:02:49,977 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 3. Compared 33 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-25 15:02:49,978 INFO L142 LiptonReduction]: Number of co-enabled transitions 306 [2021-03-25 15:02:50,443 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 15:02:50,754 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 15:02:51,388 WARN L205 SmtUtils]: Spent 631.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 15:02:52,030 WARN L205 SmtUtils]: Spent 641.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 15:02:52,684 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-25 15:02:52,805 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-25 15:02:53,218 WARN L205 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-03-25 15:02:53,591 WARN L205 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-03-25 15:02:54,397 WARN L205 SmtUtils]: Spent 799.00 ms on a formula simplification that was a NOOP. DAG size: 285 [2021-03-25 15:02:55,242 WARN L205 SmtUtils]: Spent 843.00 ms on a formula simplification that was a NOOP. DAG size: 285 [2021-03-25 15:02:55,615 INFO L154 LiptonReduction]: Checked pairs total: 1174 [2021-03-25 15:02:55,615 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 15:02:55,615 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5645 [2021-03-25 15:02:55,616 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-25 15:02:55,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:55,617 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:02:55,617 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:02:55,617 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 15:02:55,617 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:02:55,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:02:55,617 INFO L82 PathProgramCache]: Analyzing trace with hash 557731296, now seen corresponding path program 1 times [2021-03-25 15:02:55,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:02:55,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614171912] [2021-03-25 15:02:55,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:02:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:02:55,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:55,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:02:55,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:55,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:02:55,768 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 15:02:55,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 15:02:55,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:02:55,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614171912] [2021-03-25 15:02:55,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:02:55,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 15:02:55,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316728492] [2021-03-25 15:02:55,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 15:02:55,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:02:55,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 15:02:55,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 15:02:55,778 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 174 [2021-03-25 15:02:55,779 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:55,779 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:02:55,779 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 174 [2021-03-25 15:02:55,779 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:02:55,823 INFO L129 PetriNetUnfolder]: 7/41 cut-off events. [2021-03-25 15:02:55,823 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 15:02:55,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 41 events. 7/41 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 95 event pairs, 1 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 59. Up to 10 conditions per place. [2021-03-25 15:02:55,825 INFO L132 encePairwiseOnDemand]: 169/174 looper letters, 3 selfloop transitions, 3 changer transitions 6/31 dead transitions. [2021-03-25 15:02:55,825 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 96 flow [2021-03-25 15:02:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 15:02:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 15:02:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 743 transitions. [2021-03-25 15:02:55,827 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8540229885057471 [2021-03-25 15:02:55,828 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 743 transitions. [2021-03-25 15:02:55,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 743 transitions. [2021-03-25 15:02:55,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:02:55,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 743 transitions. [2021-03-25 15:02:55,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.6) internal successors, (743), 5 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:55,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:55,833 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:55,833 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 5 states and 743 transitions. [2021-03-25 15:02:55,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 96 flow [2021-03-25 15:02:55,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 15:02:55,834 INFO L241 Difference]: Finished difference. Result has 37 places, 25 transitions, 75 flow [2021-03-25 15:02:55,834 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2021-03-25 15:02:55,835 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -10 predicate places. [2021-03-25 15:02:55,835 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:02:55,835 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 25 transitions, 75 flow [2021-03-25 15:02:55,835 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 25 transitions, 75 flow [2021-03-25 15:02:55,836 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 75 flow [2021-03-25 15:02:55,840 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-03-25 15:02:55,840 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-25 15:02:55,841 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 33 events. 3/33 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2021-03-25 15:02:55,842 INFO L142 LiptonReduction]: Number of co-enabled transitions 232 [2021-03-25 15:02:56,485 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-25 15:02:56,654 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 15:02:56,962 WARN L205 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-25 15:02:57,108 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 15:02:57,111 INFO L154 LiptonReduction]: Checked pairs total: 753 [2021-03-25 15:02:57,111 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 15:02:57,111 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1276 [2021-03-25 15:02:57,112 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 71 flow [2021-03-25 15:02:57,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:57,113 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:02:57,113 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:02:57,113 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 15:02:57,113 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:02:57,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:02:57,114 INFO L82 PathProgramCache]: Analyzing trace with hash -93592942, now seen corresponding path program 1 times [2021-03-25 15:02:57,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:02:57,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727209586] [2021-03-25 15:02:57,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:02:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:02:57,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:57,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:02:57,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:57,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:02:57,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:02:57,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727209586] [2021-03-25 15:02:57,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:02:57,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 15:02:57,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080981156] [2021-03-25 15:02:57,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 15:02:57,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:02:57,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 15:02:57,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 15:02:57,201 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 176 [2021-03-25 15:02:57,202 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 71 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-25 15:02:57,202 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:02:57,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 176 [2021-03-25 15:02:57,202 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:02:57,221 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-25 15:02:57,221 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-03-25 15:02:57,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 31 events. 3/31 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 62 event pairs, 1 based on Foata normal form. 2/32 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2021-03-25 15:02:57,222 INFO L132 encePairwiseOnDemand]: 173/176 looper letters, 1 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2021-03-25 15:02:57,222 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 77 flow [2021-03-25 15:02:57,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 15:02:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 15:02:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2021-03-25 15:02:57,224 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8882575757575758 [2021-03-25 15:02:57,224 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2021-03-25 15:02:57,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2021-03-25 15:02:57,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:02:57,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2021-03-25 15:02:57,225 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-25 15:02:57,226 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-25 15:02:57,227 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-25 15:02:57,227 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 71 flow. Second operand 3 states and 469 transitions. [2021-03-25 15:02:57,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 77 flow [2021-03-25 15:02:57,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 23 transitions, 70 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-25 15:02:57,228 INFO L241 Difference]: Finished difference. Result has 33 places, 23 transitions, 72 flow [2021-03-25 15:02:57,228 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=64, 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=72, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2021-03-25 15:02:57,228 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -14 predicate places. [2021-03-25 15:02:57,228 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:02:57,228 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 72 flow [2021-03-25 15:02:57,228 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 23 transitions, 72 flow [2021-03-25 15:02:57,229 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 72 flow [2021-03-25 15:02:57,234 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-25 15:02:57,234 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 15:02:57,234 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 3/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 60 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2021-03-25 15:02:57,235 INFO L142 LiptonReduction]: Number of co-enabled transitions 226 [2021-03-25 15:02:57,236 INFO L154 LiptonReduction]: Checked pairs total: 233 [2021-03-25 15:02:57,236 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:02:57,236 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8 [2021-03-25 15:02:57,237 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 72 flow [2021-03-25 15:02:57,237 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-25 15:02:57,237 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:02:57,238 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:02:57,238 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 15:02:57,238 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:02:57,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:02:57,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1386441617, now seen corresponding path program 1 times [2021-03-25 15:02:57,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:02:57,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313629719] [2021-03-25 15:02:57,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:02:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:02:57,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:57,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 15:02:57,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:57,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 15:02:57,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:57,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 15:02:57,426 INFO L142 QuantifierPusher]: treesize reduction 30, result has 62.0 percent of original size [2021-03-25 15:02:57,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 15:02:57,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:57,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 15:02:57,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:02:57,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313629719] [2021-03-25 15:02:57,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:02:57,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 15:02:57,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450573054] [2021-03-25 15:02:57,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 15:02:57,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:02:57,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 15:02:57,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-25 15:02:57,465 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 176 [2021-03-25 15:02:57,466 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 72 flow. Second operand has 6 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:57,466 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:02:57,466 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 176 [2021-03-25 15:02:57,466 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:02:57,620 INFO L129 PetriNetUnfolder]: 154/351 cut-off events. [2021-03-25 15:02:57,620 INFO L130 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2021-03-25 15:02:57,621 INFO L84 FinitePrefix]: Finished finitePrefix Result has 722 conditions, 351 events. 154/351 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2011 event pairs, 52 based on Foata normal form. 14/352 useless extension candidates. Maximal degree in co-relation 710. Up to 170 conditions per place. [2021-03-25 15:02:57,623 INFO L132 encePairwiseOnDemand]: 171/176 looper letters, 13 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2021-03-25 15:02:57,623 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 30 transitions, 123 flow [2021-03-25 15:02:57,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 15:02:57,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 15:02:57,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 546 transitions. [2021-03-25 15:02:57,625 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7755681818181818 [2021-03-25 15:02:57,626 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 546 transitions. [2021-03-25 15:02:57,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 546 transitions. [2021-03-25 15:02:57,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:02:57,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 546 transitions. [2021-03-25 15:02:57,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:57,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:57,629 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:57,629 INFO L185 Difference]: Start difference. First operand has 33 places, 23 transitions, 72 flow. Second operand 4 states and 546 transitions. [2021-03-25 15:02:57,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 30 transitions, 123 flow [2021-03-25 15:02:57,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 117 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 15:02:57,631 INFO L241 Difference]: Finished difference. Result has 35 places, 25 transitions, 89 flow [2021-03-25 15:02:57,632 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2021-03-25 15:02:57,632 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -12 predicate places. [2021-03-25 15:02:57,632 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:02:57,632 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 89 flow [2021-03-25 15:02:57,632 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 25 transitions, 89 flow [2021-03-25 15:02:57,632 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 89 flow [2021-03-25 15:02:57,643 INFO L129 PetriNetUnfolder]: 9/67 cut-off events. [2021-03-25 15:02:57,643 INFO L130 PetriNetUnfolder]: For 23/33 co-relation queries the response was YES. [2021-03-25 15:02:57,644 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 67 events. 9/67 cut-off events. For 23/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 271 event pairs, 4 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 119. Up to 20 conditions per place. [2021-03-25 15:02:57,644 INFO L142 LiptonReduction]: Number of co-enabled transitions 254 [2021-03-25 15:02:57,717 INFO L154 LiptonReduction]: Checked pairs total: 178 [2021-03-25 15:02:57,717 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:02:57,717 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 85 [2021-03-25 15:02:57,718 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 89 flow [2021-03-25 15:02:57,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:57,719 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:02:57,719 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:02:57,719 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 15:02:57,719 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:02:57,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:02:57,719 INFO L82 PathProgramCache]: Analyzing trace with hash 30015987, now seen corresponding path program 1 times [2021-03-25 15:02:57,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:02:57,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222830129] [2021-03-25 15:02:57,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:02:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:02:57,823 INFO L142 QuantifierPusher]: treesize reduction 17, result has 45.2 percent of original size [2021-03-25 15:02:57,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 15:02:57,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:57,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 15:02:57,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:57,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 15:02:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:02:57,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222830129] [2021-03-25 15:02:57,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:02:57,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 15:02:57,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115576187] [2021-03-25 15:02:57,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 15:02:57,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:02:57,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 15:02:57,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 15:02:57,877 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 176 [2021-03-25 15:02:57,878 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:57,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:02:57,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 176 [2021-03-25 15:02:57,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:02:58,161 INFO L129 PetriNetUnfolder]: 219/503 cut-off events. [2021-03-25 15:02:58,161 INFO L130 PetriNetUnfolder]: For 245/245 co-relation queries the response was YES. [2021-03-25 15:02:58,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1218 conditions, 503 events. 219/503 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3071 event pairs, 7 based on Foata normal form. 9/500 useless extension candidates. Maximal degree in co-relation 1205. Up to 180 conditions per place. [2021-03-25 15:02:58,168 INFO L132 encePairwiseOnDemand]: 166/176 looper letters, 30 selfloop transitions, 28 changer transitions 6/77 dead transitions. [2021-03-25 15:02:58,168 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 77 transitions, 401 flow [2021-03-25 15:02:58,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 15:02:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 15:02:58,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1184 transitions. [2021-03-25 15:02:58,173 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2021-03-25 15:02:58,173 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1184 transitions. [2021-03-25 15:02:58,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1184 transitions. [2021-03-25 15:02:58,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:02:58,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1184 transitions. [2021-03-25 15:02:58,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 131.55555555555554) internal successors, (1184), 9 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:58,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 176.0) internal successors, (1760), 10 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:58,180 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 176.0) internal successors, (1760), 10 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:58,180 INFO L185 Difference]: Start difference. First operand has 35 places, 25 transitions, 89 flow. Second operand 9 states and 1184 transitions. [2021-03-25 15:02:58,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 77 transitions, 401 flow [2021-03-25 15:02:58,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 77 transitions, 381 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 15:02:58,184 INFO L241 Difference]: Finished difference. Result has 48 places, 51 transitions, 319 flow [2021-03-25 15:02:58,184 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=319, PETRI_PLACES=48, PETRI_TRANSITIONS=51} [2021-03-25 15:02:58,184 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 1 predicate places. [2021-03-25 15:02:58,184 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:02:58,184 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 51 transitions, 319 flow [2021-03-25 15:02:58,185 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 51 transitions, 319 flow [2021-03-25 15:02:58,185 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 51 transitions, 319 flow [2021-03-25 15:02:58,255 INFO L129 PetriNetUnfolder]: 164/406 cut-off events. [2021-03-25 15:02:58,255 INFO L130 PetriNetUnfolder]: For 934/968 co-relation queries the response was YES. [2021-03-25 15:02:58,258 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 406 events. 164/406 cut-off events. For 934/968 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2485 event pairs, 25 based on Foata normal form. 2/388 useless extension candidates. Maximal degree in co-relation 1446. Up to 155 conditions per place. [2021-03-25 15:02:58,261 INFO L142 LiptonReduction]: Number of co-enabled transitions 410 [2021-03-25 15:02:58,293 INFO L154 LiptonReduction]: Checked pairs total: 208 [2021-03-25 15:02:58,293 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:02:58,293 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 109 [2021-03-25 15:02:58,295 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 51 transitions, 319 flow [2021-03-25 15:02:58,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:58,295 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:02:58,296 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:02:58,296 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 15:02:58,296 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:02:58,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:02:58,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1726215283, now seen corresponding path program 2 times [2021-03-25 15:02:58,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:02:58,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730984846] [2021-03-25 15:02:58,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:02:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:02:58,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:58,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:02:58,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:58,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 15:02:58,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:58,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:02:58,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:02:58,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730984846] [2021-03-25 15:02:58,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:02:58,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 15:02:58,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789939484] [2021-03-25 15:02:58,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 15:02:58,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:02:58,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 15:02:58,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 15:02:58,447 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 176 [2021-03-25 15:02:58,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 51 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:58,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:02:58,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 176 [2021-03-25 15:02:58,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:02:58,655 INFO L129 PetriNetUnfolder]: 227/529 cut-off events. [2021-03-25 15:02:58,655 INFO L130 PetriNetUnfolder]: For 1878/1941 co-relation queries the response was YES. [2021-03-25 15:02:58,657 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2299 conditions, 529 events. 227/529 cut-off events. For 1878/1941 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3340 event pairs, 13 based on Foata normal form. 16/537 useless extension candidates. Maximal degree in co-relation 2279. Up to 288 conditions per place. [2021-03-25 15:02:58,660 INFO L132 encePairwiseOnDemand]: 169/176 looper letters, 35 selfloop transitions, 13 changer transitions 24/85 dead transitions. [2021-03-25 15:02:58,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 85 transitions, 732 flow [2021-03-25 15:02:58,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 15:02:58,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 15:02:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 974 transitions. [2021-03-25 15:02:58,663 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7905844155844156 [2021-03-25 15:02:58,663 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 974 transitions. [2021-03-25 15:02:58,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 974 transitions. [2021-03-25 15:02:58,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:02:58,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 974 transitions. [2021-03-25 15:02:58,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.14285714285714) internal successors, (974), 7 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:58,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:58,668 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:58,668 INFO L185 Difference]: Start difference. First operand has 48 places, 51 transitions, 319 flow. Second operand 7 states and 974 transitions. [2021-03-25 15:02:58,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 85 transitions, 732 flow [2021-03-25 15:02:58,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 85 transitions, 732 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 15:02:58,676 INFO L241 Difference]: Finished difference. Result has 59 places, 55 transitions, 402 flow [2021-03-25 15:02:58,676 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=402, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2021-03-25 15:02:58,676 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 12 predicate places. [2021-03-25 15:02:58,677 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:02:58,677 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 55 transitions, 402 flow [2021-03-25 15:02:58,677 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 55 transitions, 402 flow [2021-03-25 15:02:58,677 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 55 transitions, 402 flow [2021-03-25 15:02:58,733 INFO L129 PetriNetUnfolder]: 151/391 cut-off events. [2021-03-25 15:02:58,733 INFO L130 PetriNetUnfolder]: For 1274/1309 co-relation queries the response was YES. [2021-03-25 15:02:58,735 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1562 conditions, 391 events. 151/391 cut-off events. For 1274/1309 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2439 event pairs, 24 based on Foata normal form. 1/378 useless extension candidates. Maximal degree in co-relation 1537. Up to 154 conditions per place. [2021-03-25 15:02:58,738 INFO L142 LiptonReduction]: Number of co-enabled transitions 424 [2021-03-25 15:02:58,769 INFO L154 LiptonReduction]: Checked pairs total: 214 [2021-03-25 15:02:58,769 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:02:58,769 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 92 [2021-03-25 15:02:58,773 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 402 flow [2021-03-25 15:02:58,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:58,774 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:02:58,774 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:02:58,774 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 15:02:58,774 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:02:58,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:02:58,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1592064245, now seen corresponding path program 3 times [2021-03-25 15:02:58,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:02:58,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769023989] [2021-03-25 15:02:58,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:02:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:02:58,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:58,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 15:02:58,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:58,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 15:02:58,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:58,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 15:02:58,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:58,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 15:02:58,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:02:58,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769023989] [2021-03-25 15:02:58,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:02:58,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 15:02:58,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667754970] [2021-03-25 15:02:58,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 15:02:58,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:02:58,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 15:02:58,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 15:02:58,902 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 176 [2021-03-25 15:02:58,903 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 402 flow. Second operand has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:58,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:02:58,903 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 176 [2021-03-25 15:02:58,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:02:59,106 INFO L129 PetriNetUnfolder]: 209/496 cut-off events. [2021-03-25 15:02:59,107 INFO L130 PetriNetUnfolder]: For 2398/2467 co-relation queries the response was YES. [2021-03-25 15:02:59,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2347 conditions, 496 events. 209/496 cut-off events. For 2398/2467 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3093 event pairs, 41 based on Foata normal form. 18/503 useless extension candidates. Maximal degree in co-relation 2320. Up to 300 conditions per place. [2021-03-25 15:02:59,112 INFO L132 encePairwiseOnDemand]: 168/176 looper letters, 43 selfloop transitions, 22 changer transitions 0/78 dead transitions. [2021-03-25 15:02:59,112 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 710 flow [2021-03-25 15:02:59,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 15:02:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 15:02:59,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2021-03-25 15:02:59,115 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7602272727272728 [2021-03-25 15:02:59,115 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2021-03-25 15:02:59,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2021-03-25 15:02:59,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:02:59,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2021-03-25 15:02:59,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:59,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:59,119 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:59,119 INFO L185 Difference]: Start difference. First operand has 56 places, 55 transitions, 402 flow. Second operand 5 states and 669 transitions. [2021-03-25 15:02:59,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 710 flow [2021-03-25 15:02:59,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 78 transitions, 689 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-03-25 15:02:59,126 INFO L241 Difference]: Finished difference. Result has 59 places, 69 transitions, 607 flow [2021-03-25 15:02:59,126 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=607, PETRI_PLACES=59, PETRI_TRANSITIONS=69} [2021-03-25 15:02:59,127 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 12 predicate places. [2021-03-25 15:02:59,127 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:02:59,127 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 69 transitions, 607 flow [2021-03-25 15:02:59,127 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 69 transitions, 607 flow [2021-03-25 15:02:59,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 69 transitions, 607 flow [2021-03-25 15:02:59,194 INFO L129 PetriNetUnfolder]: 169/450 cut-off events. [2021-03-25 15:02:59,194 INFO L130 PetriNetUnfolder]: For 1982/2036 co-relation queries the response was YES. [2021-03-25 15:02:59,196 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1993 conditions, 450 events. 169/450 cut-off events. For 1982/2036 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2929 event pairs, 16 based on Foata normal form. 5/443 useless extension candidates. Maximal degree in co-relation 1967. Up to 177 conditions per place. [2021-03-25 15:02:59,200 INFO L142 LiptonReduction]: Number of co-enabled transitions 496 [2021-03-25 15:02:59,251 INFO L154 LiptonReduction]: Checked pairs total: 550 [2021-03-25 15:02:59,251 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:02:59,252 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 125 [2021-03-25 15:02:59,254 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 69 transitions, 607 flow [2021-03-25 15:02:59,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:59,254 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:02:59,254 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:02:59,255 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 15:02:59,255 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:02:59,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:02:59,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1660776053, now seen corresponding path program 4 times [2021-03-25 15:02:59,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:02:59,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053272284] [2021-03-25 15:02:59,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:02:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:02:59,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:59,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 15:02:59,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:59,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 15:02:59,374 INFO L142 QuantifierPusher]: treesize reduction 21, result has 68.2 percent of original size [2021-03-25 15:02:59,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 15:02:59,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:59,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 15:02:59,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:02:59,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053272284] [2021-03-25 15:02:59,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:02:59,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 15:02:59,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355627747] [2021-03-25 15:02:59,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 15:02:59,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:02:59,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 15:02:59,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 15:02:59,413 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 176 [2021-03-25 15:02:59,413 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 69 transitions, 607 flow. Second operand has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:59,413 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:02:59,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 176 [2021-03-25 15:02:59,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:02:59,610 INFO L129 PetriNetUnfolder]: 205/516 cut-off events. [2021-03-25 15:02:59,610 INFO L130 PetriNetUnfolder]: For 2751/2816 co-relation queries the response was YES. [2021-03-25 15:02:59,612 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2614 conditions, 516 events. 205/516 cut-off events. For 2751/2816 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3386 event pairs, 25 based on Foata normal form. 16/526 useless extension candidates. Maximal degree in co-relation 2586. Up to 262 conditions per place. [2021-03-25 15:02:59,615 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 47 selfloop transitions, 23 changer transitions 3/86 dead transitions. [2021-03-25 15:02:59,615 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 86 transitions, 935 flow [2021-03-25 15:02:59,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 15:02:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 15:02:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions. [2021-03-25 15:02:59,617 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7571022727272727 [2021-03-25 15:02:59,617 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 533 transitions. [2021-03-25 15:02:59,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions. [2021-03-25 15:02:59,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:02:59,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions. [2021-03-25 15:02:59,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:59,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:59,620 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:59,620 INFO L185 Difference]: Start difference. First operand has 59 places, 69 transitions, 607 flow. Second operand 4 states and 533 transitions. [2021-03-25 15:02:59,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 86 transitions, 935 flow [2021-03-25 15:02:59,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 86 transitions, 930 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 15:02:59,627 INFO L241 Difference]: Finished difference. Result has 62 places, 76 transitions, 782 flow [2021-03-25 15:02:59,627 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=782, PETRI_PLACES=62, PETRI_TRANSITIONS=76} [2021-03-25 15:02:59,628 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 15 predicate places. [2021-03-25 15:02:59,628 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:02:59,628 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 76 transitions, 782 flow [2021-03-25 15:02:59,628 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 76 transitions, 782 flow [2021-03-25 15:02:59,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 76 transitions, 782 flow [2021-03-25 15:02:59,695 INFO L129 PetriNetUnfolder]: 156/446 cut-off events. [2021-03-25 15:02:59,695 INFO L130 PetriNetUnfolder]: For 2247/2310 co-relation queries the response was YES. [2021-03-25 15:02:59,697 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2095 conditions, 446 events. 156/446 cut-off events. For 2247/2310 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2972 event pairs, 14 based on Foata normal form. 5/441 useless extension candidates. Maximal degree in co-relation 2067. Up to 180 conditions per place. [2021-03-25 15:02:59,701 INFO L142 LiptonReduction]: Number of co-enabled transitions 510 [2021-03-25 15:02:59,723 INFO L154 LiptonReduction]: Checked pairs total: 692 [2021-03-25 15:02:59,723 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:02:59,723 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 95 [2021-03-25 15:02:59,724 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 76 transitions, 782 flow [2021-03-25 15:02:59,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:59,724 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:02:59,725 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:02:59,725 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 15:02:59,725 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:02:59,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:02:59,726 INFO L82 PathProgramCache]: Analyzing trace with hash 527596475, now seen corresponding path program 1 times [2021-03-25 15:02:59,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:02:59,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718900674] [2021-03-25 15:02:59,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:02:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:02:59,886 INFO L142 QuantifierPusher]: treesize reduction 30, result has 41.2 percent of original size [2021-03-25 15:02:59,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 15:02:59,902 INFO L142 QuantifierPusher]: treesize reduction 66, result has 47.6 percent of original size [2021-03-25 15:02:59,907 INFO L147 QuantifierPusher]: treesize reduction 5, result has 91.7 percent of original size 55 [2021-03-25 15:02:59,955 INFO L142 QuantifierPusher]: treesize reduction 26, result has 45.8 percent of original size [2021-03-25 15:02:59,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 15:02:59,971 INFO L142 QuantifierPusher]: treesize reduction 18, result has 60.0 percent of original size [2021-03-25 15:02:59,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 15:03:00,008 INFO L142 QuantifierPusher]: treesize reduction 17, result has 72.1 percent of original size [2021-03-25 15:03:00,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 15:03:00,055 INFO L142 QuantifierPusher]: treesize reduction 13, result has 67.5 percent of original size [2021-03-25 15:03:00,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 15:03:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:03:00,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718900674] [2021-03-25 15:03:00,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:03:00,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 15:03:00,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081412960] [2021-03-25 15:03:00,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 15:03:00,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:03:00,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 15:03:00,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-03-25 15:03:00,090 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 176 [2021-03-25 15:03:00,091 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 76 transitions, 782 flow. Second operand has 8 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:00,091 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:03:00,091 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 176 [2021-03-25 15:03:00,091 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:03:00,406 INFO L129 PetriNetUnfolder]: 226/574 cut-off events. [2021-03-25 15:03:00,407 INFO L130 PetriNetUnfolder]: For 3594/3673 co-relation queries the response was YES. [2021-03-25 15:03:00,409 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3115 conditions, 574 events. 226/574 cut-off events. For 3594/3673 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3906 event pairs, 7 based on Foata normal form. 22/590 useless extension candidates. Maximal degree in co-relation 3085. Up to 310 conditions per place. [2021-03-25 15:03:00,413 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 41 selfloop transitions, 56 changer transitions 1/111 dead transitions. [2021-03-25 15:03:00,413 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 111 transitions, 1400 flow [2021-03-25 15:03:00,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 15:03:00,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 15:03:00,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 641 transitions. [2021-03-25 15:03:00,415 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7284090909090909 [2021-03-25 15:03:00,415 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 641 transitions. [2021-03-25 15:03:00,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 641 transitions. [2021-03-25 15:03:00,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:03:00,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 641 transitions. [2021-03-25 15:03:00,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:00,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:00,420 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:00,420 INFO L185 Difference]: Start difference. First operand has 62 places, 76 transitions, 782 flow. Second operand 5 states and 641 transitions. [2021-03-25 15:03:00,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 111 transitions, 1400 flow [2021-03-25 15:03:00,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 111 transitions, 1365 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 15:03:00,430 INFO L241 Difference]: Finished difference. Result has 67 places, 102 transitions, 1301 flow [2021-03-25 15:03:00,430 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1301, PETRI_PLACES=67, PETRI_TRANSITIONS=102} [2021-03-25 15:03:00,430 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2021-03-25 15:03:00,430 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:03:00,430 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 102 transitions, 1301 flow [2021-03-25 15:03:00,431 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 102 transitions, 1301 flow [2021-03-25 15:03:00,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 102 transitions, 1301 flow [2021-03-25 15:03:00,518 INFO L129 PetriNetUnfolder]: 203/544 cut-off events. [2021-03-25 15:03:00,518 INFO L130 PetriNetUnfolder]: For 4044/4154 co-relation queries the response was YES. [2021-03-25 15:03:00,521 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2986 conditions, 544 events. 203/544 cut-off events. For 4044/4154 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3778 event pairs, 11 based on Foata normal form. 37/569 useless extension candidates. Maximal degree in co-relation 2954. Up to 232 conditions per place. [2021-03-25 15:03:00,526 INFO L142 LiptonReduction]: Number of co-enabled transitions 620 [2021-03-25 15:03:00,573 INFO L154 LiptonReduction]: Checked pairs total: 1575 [2021-03-25 15:03:00,573 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:03:00,573 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 143 [2021-03-25 15:03:00,574 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 102 transitions, 1301 flow [2021-03-25 15:03:00,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:00,574 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:03:00,574 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:03:00,575 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 15:03:00,575 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:03:00,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:03:00,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1299971733, now seen corresponding path program 1 times [2021-03-25 15:03:00,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:03:00,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368722514] [2021-03-25 15:03:00,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:03:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:03:00,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:00,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:03:00,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:00,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:03:00,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:03:00,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368722514] [2021-03-25 15:03:00,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:03:00,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 15:03:00,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159508486] [2021-03-25 15:03:00,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 15:03:00,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:03:00,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 15:03:00,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 15:03:00,622 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 176 [2021-03-25 15:03:00,623 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 102 transitions, 1301 flow. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:00,623 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:03:00,623 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 176 [2021-03-25 15:03:00,624 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:03:00,791 INFO L129 PetriNetUnfolder]: 248/683 cut-off events. [2021-03-25 15:03:00,791 INFO L130 PetriNetUnfolder]: For 5670/5821 co-relation queries the response was YES. [2021-03-25 15:03:00,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3916 conditions, 683 events. 248/683 cut-off events. For 5670/5821 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5051 event pairs, 41 based on Foata normal form. 24/677 useless extension candidates. Maximal degree in co-relation 3882. Up to 319 conditions per place. [2021-03-25 15:03:00,797 INFO L132 encePairwiseOnDemand]: 173/176 looper letters, 3 selfloop transitions, 3 changer transitions 26/102 dead transitions. [2021-03-25 15:03:00,797 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 102 transitions, 1313 flow [2021-03-25 15:03:00,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 15:03:00,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 15:03:00,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2021-03-25 15:03:00,799 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8693181818181818 [2021-03-25 15:03:00,799 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2021-03-25 15:03:00,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2021-03-25 15:03:00,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:03:00,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2021-03-25 15:03:00,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:00,802 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-25 15:03:00,802 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-25 15:03:00,802 INFO L185 Difference]: Start difference. First operand has 67 places, 102 transitions, 1301 flow. Second operand 3 states and 459 transitions. [2021-03-25 15:03:00,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 102 transitions, 1313 flow [2021-03-25 15:03:00,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 102 transitions, 1291 flow, removed 11 selfloop flow, removed 0 redundant places. [2021-03-25 15:03:00,817 INFO L241 Difference]: Finished difference. Result has 70 places, 76 transitions, 900 flow [2021-03-25 15:03:00,817 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=1279, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=900, PETRI_PLACES=70, PETRI_TRANSITIONS=76} [2021-03-25 15:03:00,817 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2021-03-25 15:03:00,817 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:03:00,818 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 76 transitions, 900 flow [2021-03-25 15:03:00,818 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 76 transitions, 900 flow [2021-03-25 15:03:00,818 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 76 transitions, 900 flow [2021-03-25 15:03:00,911 INFO L129 PetriNetUnfolder]: 192/571 cut-off events. [2021-03-25 15:03:00,911 INFO L130 PetriNetUnfolder]: For 4115/4150 co-relation queries the response was YES. [2021-03-25 15:03:00,914 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3153 conditions, 571 events. 192/571 cut-off events. For 4115/4150 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4266 event pairs, 8 based on Foata normal form. 19/582 useless extension candidates. Maximal degree in co-relation 3119. Up to 259 conditions per place. [2021-03-25 15:03:00,919 INFO L142 LiptonReduction]: Number of co-enabled transitions 458 [2021-03-25 15:03:01,032 INFO L154 LiptonReduction]: Checked pairs total: 699 [2021-03-25 15:03:01,032 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:03:01,032 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 215 [2021-03-25 15:03:01,033 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 76 transitions, 900 flow [2021-03-25 15:03:01,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:01,033 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:03:01,033 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:03:01,034 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 15:03:01,034 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:03:01,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:03:01,034 INFO L82 PathProgramCache]: Analyzing trace with hash 323466401, now seen corresponding path program 1 times [2021-03-25 15:03:01,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:03:01,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609176554] [2021-03-25 15:03:01,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:03:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:03:01,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:01,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 15:03:01,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:01,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 15:03:01,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:01,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 15:03:01,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:01,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 15:03:01,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:03:01,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609176554] [2021-03-25 15:03:01,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:03:01,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 15:03:01,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532252713] [2021-03-25 15:03:01,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 15:03:01,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:03:01,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 15:03:01,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 15:03:01,193 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 176 [2021-03-25 15:03:01,194 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 76 transitions, 900 flow. Second operand has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:01,194 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:03:01,194 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 176 [2021-03-25 15:03:01,194 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:03:01,557 INFO L129 PetriNetUnfolder]: 253/717 cut-off events. [2021-03-25 15:03:01,557 INFO L130 PetriNetUnfolder]: For 5564/5639 co-relation queries the response was YES. [2021-03-25 15:03:01,560 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4510 conditions, 717 events. 253/717 cut-off events. For 5564/5639 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 5470 event pairs, 1 based on Foata normal form. 49/754 useless extension candidates. Maximal degree in co-relation 4474. Up to 360 conditions per place. [2021-03-25 15:03:01,563 INFO L132 encePairwiseOnDemand]: 166/176 looper letters, 44 selfloop transitions, 43 changer transitions 20/120 dead transitions. [2021-03-25 15:03:01,563 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 120 transitions, 1721 flow [2021-03-25 15:03:01,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 15:03:01,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 15:03:01,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1166 transitions. [2021-03-25 15:03:01,566 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7361111111111112 [2021-03-25 15:03:01,566 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1166 transitions. [2021-03-25 15:03:01,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1166 transitions. [2021-03-25 15:03:01,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:03:01,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1166 transitions. [2021-03-25 15:03:01,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 129.55555555555554) internal successors, (1166), 9 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:01,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 176.0) internal successors, (1760), 10 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:01,573 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 176.0) internal successors, (1760), 10 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:01,573 INFO L185 Difference]: Start difference. First operand has 70 places, 76 transitions, 900 flow. Second operand 9 states and 1166 transitions. [2021-03-25 15:03:01,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 120 transitions, 1721 flow [2021-03-25 15:03:01,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 120 transitions, 1673 flow, removed 18 selfloop flow, removed 3 redundant places. [2021-03-25 15:03:01,586 INFO L241 Difference]: Finished difference. Result has 79 places, 96 transitions, 1321 flow [2021-03-25 15:03:01,586 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1321, PETRI_PLACES=79, PETRI_TRANSITIONS=96} [2021-03-25 15:03:01,587 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 32 predicate places. [2021-03-25 15:03:01,587 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:03:01,587 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 96 transitions, 1321 flow [2021-03-25 15:03:01,587 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 96 transitions, 1321 flow [2021-03-25 15:03:01,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 96 transitions, 1321 flow [2021-03-25 15:03:01,686 INFO L129 PetriNetUnfolder]: 192/580 cut-off events. [2021-03-25 15:03:01,686 INFO L130 PetriNetUnfolder]: For 4973/5064 co-relation queries the response was YES. [2021-03-25 15:03:01,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3678 conditions, 580 events. 192/580 cut-off events. For 4973/5064 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4353 event pairs, 8 based on Foata normal form. 38/608 useless extension candidates. Maximal degree in co-relation 3641. Up to 275 conditions per place. [2021-03-25 15:03:01,698 INFO L142 LiptonReduction]: Number of co-enabled transitions 554 [2021-03-25 15:03:03,390 WARN L205 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 271 DAG size of output: 212 [2021-03-25 15:03:03,823 WARN L205 SmtUtils]: Spent 429.00 ms on a formula simplification that was a NOOP. DAG size: 205 [2021-03-25 15:03:06,168 WARN L205 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 377 DAG size of output: 320 [2021-03-25 15:03:07,179 WARN L205 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 309 [2021-03-25 15:03:07,240 INFO L154 LiptonReduction]: Checked pairs total: 2090 [2021-03-25 15:03:07,240 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 15:03:07,240 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5653 [2021-03-25 15:03:07,241 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 96 transitions, 1330 flow [2021-03-25 15:03:07,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:07,241 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:03:07,241 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:03:07,241 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 15:03:07,241 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:03:07,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:03:07,242 INFO L82 PathProgramCache]: Analyzing trace with hash -604513205, now seen corresponding path program 2 times [2021-03-25 15:03:07,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:03:07,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483174606] [2021-03-25 15:03:07,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:03:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:03:07,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:07,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 15:03:07,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:07,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 15:03:07,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:07,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 15:03:07,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:07,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 15:03:07,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:07,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 15:03:07,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:03:07,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483174606] [2021-03-25 15:03:07,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:03:07,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 15:03:07,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136291639] [2021-03-25 15:03:07,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 15:03:07,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:03:07,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 15:03:07,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 15:03:07,434 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 177 [2021-03-25 15:03:07,435 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 96 transitions, 1330 flow. Second operand has 7 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:07,435 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:03:07,435 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 177 [2021-03-25 15:03:07,435 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:03:07,841 INFO L129 PetriNetUnfolder]: 198/621 cut-off events. [2021-03-25 15:03:07,841 INFO L130 PetriNetUnfolder]: For 6030/6149 co-relation queries the response was YES. [2021-03-25 15:03:07,844 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4368 conditions, 621 events. 198/621 cut-off events. For 6030/6149 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 4764 event pairs, 2 based on Foata normal form. 68/682 useless extension candidates. Maximal degree in co-relation 4329. Up to 294 conditions per place. [2021-03-25 15:03:07,847 INFO L132 encePairwiseOnDemand]: 168/177 looper letters, 41 selfloop transitions, 46 changer transitions 17/117 dead transitions. [2021-03-25 15:03:07,847 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 117 transitions, 1878 flow [2021-03-25 15:03:07,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 15:03:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 15:03:07,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1126 transitions. [2021-03-25 15:03:07,851 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.706842435655995 [2021-03-25 15:03:07,851 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1126 transitions. [2021-03-25 15:03:07,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1126 transitions. [2021-03-25 15:03:07,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:03:07,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1126 transitions. [2021-03-25 15:03:07,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.11111111111111) internal successors, (1126), 9 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:07,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 177.0) internal successors, (1770), 10 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:07,856 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 177.0) internal successors, (1770), 10 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:07,856 INFO L185 Difference]: Start difference. First operand has 79 places, 96 transitions, 1330 flow. Second operand 9 states and 1126 transitions. [2021-03-25 15:03:07,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 117 transitions, 1878 flow [2021-03-25 15:03:07,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 117 transitions, 1794 flow, removed 35 selfloop flow, removed 3 redundant places. [2021-03-25 15:03:07,873 INFO L241 Difference]: Finished difference. Result has 87 places, 97 transitions, 1431 flow [2021-03-25 15:03:07,873 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1431, PETRI_PLACES=87, PETRI_TRANSITIONS=97} [2021-03-25 15:03:07,874 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 40 predicate places. [2021-03-25 15:03:07,874 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:03:07,874 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 97 transitions, 1431 flow [2021-03-25 15:03:07,874 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 97 transitions, 1431 flow [2021-03-25 15:03:07,875 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 97 transitions, 1431 flow [2021-03-25 15:03:07,947 INFO L129 PetriNetUnfolder]: 129/437 cut-off events. [2021-03-25 15:03:07,948 INFO L130 PetriNetUnfolder]: For 4500/4585 co-relation queries the response was YES. [2021-03-25 15:03:07,950 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2819 conditions, 437 events. 129/437 cut-off events. For 4500/4585 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3146 event pairs, 2 based on Foata normal form. 54/484 useless extension candidates. Maximal degree in co-relation 2779. Up to 151 conditions per place. [2021-03-25 15:03:07,954 INFO L142 LiptonReduction]: Number of co-enabled transitions 524 [2021-03-25 15:03:07,980 INFO L154 LiptonReduction]: Checked pairs total: 1115 [2021-03-25 15:03:07,980 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:03:07,980 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 106 [2021-03-25 15:03:07,982 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 97 transitions, 1431 flow [2021-03-25 15:03:07,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:07,982 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:03:07,982 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:03:07,982 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 15:03:07,983 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:03:07,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:03:07,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1791893303, now seen corresponding path program 3 times [2021-03-25 15:03:07,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:03:07,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230625683] [2021-03-25 15:03:07,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:03:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:03:08,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:08,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 15:03:08,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:08,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 15:03:08,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:08,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 15:03:08,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:08,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 15:03:08,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:08,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 15:03:08,156 INFO L142 QuantifierPusher]: treesize reduction 3, result has 86.4 percent of original size [2021-03-25 15:03:08,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 15:03:08,177 INFO L142 QuantifierPusher]: treesize reduction 3, result has 80.0 percent of original size [2021-03-25 15:03:08,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 15:03:08,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:03:08,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230625683] [2021-03-25 15:03:08,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:03:08,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 15:03:08,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275715787] [2021-03-25 15:03:08,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 15:03:08,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:03:08,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 15:03:08,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-25 15:03:08,192 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 177 [2021-03-25 15:03:08,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 97 transitions, 1431 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-25 15:03:08,193 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:03:08,193 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 177 [2021-03-25 15:03:08,193 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:03:08,833 INFO L129 PetriNetUnfolder]: 154/518 cut-off events. [2021-03-25 15:03:08,833 INFO L130 PetriNetUnfolder]: For 5550/5660 co-relation queries the response was YES. [2021-03-25 15:03:08,836 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3701 conditions, 518 events. 154/518 cut-off events. For 5550/5660 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3836 event pairs, 0 based on Foata normal form. 73/583 useless extension candidates. Maximal degree in co-relation 3659. Up to 252 conditions per place. [2021-03-25 15:03:08,838 INFO L132 encePairwiseOnDemand]: 167/177 looper letters, 53 selfloop transitions, 49 changer transitions 7/122 dead transitions. [2021-03-25 15:03:08,838 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 122 transitions, 2079 flow [2021-03-25 15:03:08,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-25 15:03:08,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-25 15:03:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1490 transitions. [2021-03-25 15:03:08,843 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7015065913370998 [2021-03-25 15:03:08,843 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1490 transitions. [2021-03-25 15:03:08,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1490 transitions. [2021-03-25 15:03:08,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:03:08,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1490 transitions. [2021-03-25 15:03:08,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 124.16666666666667) internal successors, (1490), 12 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:08,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 177.0) internal successors, (2301), 13 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:08,849 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 177.0) internal successors, (2301), 13 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:08,850 INFO L185 Difference]: Start difference. First operand has 87 places, 97 transitions, 1431 flow. Second operand 12 states and 1490 transitions. [2021-03-25 15:03:08,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 122 transitions, 2079 flow [2021-03-25 15:03:08,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 122 transitions, 1997 flow, removed 34 selfloop flow, removed 3 redundant places. [2021-03-25 15:03:08,869 INFO L241 Difference]: Finished difference. Result has 99 places, 111 transitions, 1776 flow [2021-03-25 15:03:08,869 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1357, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1776, PETRI_PLACES=99, PETRI_TRANSITIONS=111} [2021-03-25 15:03:08,869 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 52 predicate places. [2021-03-25 15:03:08,869 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:03:08,870 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 111 transitions, 1776 flow [2021-03-25 15:03:08,870 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 111 transitions, 1776 flow [2021-03-25 15:03:08,871 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 99 places, 111 transitions, 1776 flow [2021-03-25 15:03:08,953 INFO L129 PetriNetUnfolder]: 143/491 cut-off events. [2021-03-25 15:03:08,954 INFO L130 PetriNetUnfolder]: For 5107/5169 co-relation queries the response was YES. [2021-03-25 15:03:08,956 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3297 conditions, 491 events. 143/491 cut-off events. For 5107/5169 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3648 event pairs, 0 based on Foata normal form. 41/525 useless extension candidates. Maximal degree in co-relation 3253. Up to 174 conditions per place. [2021-03-25 15:03:08,961 INFO L142 LiptonReduction]: Number of co-enabled transitions 592 [2021-03-25 15:03:09,179 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-03-25 15:03:09,608 WARN L205 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2021-03-25 15:03:09,776 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-03-25 15:03:09,975 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-03-25 15:03:10,368 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 86 [2021-03-25 15:03:10,494 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-25 15:03:10,554 INFO L154 LiptonReduction]: Checked pairs total: 2795 [2021-03-25 15:03:10,554 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 15:03:10,554 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1685 [2021-03-25 15:03:10,555 INFO L480 AbstractCegarLoop]: Abstraction has has 99 places, 111 transitions, 1793 flow [2021-03-25 15:03:10,555 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-25 15:03:10,555 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:03:10,555 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:03:10,556 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 15:03:10,556 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:03:10,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:03:10,556 INFO L82 PathProgramCache]: Analyzing trace with hash -824333263, now seen corresponding path program 4 times [2021-03-25 15:03:10,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:03:10,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213962549] [2021-03-25 15:03:10,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:03:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:03:10,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:10,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 15:03:10,633 INFO L142 QuantifierPusher]: treesize reduction 17, result has 74.2 percent of original size [2021-03-25 15:03:10,634 INFO L147 QuantifierPusher]: treesize reduction 9, result has 81.6 percent of original size 40 [2021-03-25 15:03:10,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:10,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 15:03:10,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:10,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 15:03:10,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:10,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:03:10,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:03:10,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213962549] [2021-03-25 15:03:10,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:03:10,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 15:03:10,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643628868] [2021-03-25 15:03:10,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 15:03:10,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:03:10,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 15:03:10,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 15:03:10,722 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 179 [2021-03-25 15:03:10,723 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 111 transitions, 1793 flow. Second operand has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:10,723 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:03:10,723 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 179 [2021-03-25 15:03:10,723 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:03:11,095 INFO L129 PetriNetUnfolder]: 149/500 cut-off events. [2021-03-25 15:03:11,095 INFO L130 PetriNetUnfolder]: For 6273/6447 co-relation queries the response was YES. [2021-03-25 15:03:11,099 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3698 conditions, 500 events. 149/500 cut-off events. For 6273/6447 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3696 event pairs, 4 based on Foata normal form. 105/601 useless extension candidates. Maximal degree in co-relation 3652. Up to 264 conditions per place. [2021-03-25 15:03:11,102 INFO L132 encePairwiseOnDemand]: 169/179 looper letters, 62 selfloop transitions, 42 changer transitions 12/129 dead transitions. [2021-03-25 15:03:11,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 129 transitions, 2343 flow [2021-03-25 15:03:11,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 15:03:11,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 15:03:11,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1158 transitions. [2021-03-25 15:03:11,106 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7188081936685289 [2021-03-25 15:03:11,106 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1158 transitions. [2021-03-25 15:03:11,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1158 transitions. [2021-03-25 15:03:11,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:03:11,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1158 transitions. [2021-03-25 15:03:11,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 128.66666666666666) internal successors, (1158), 9 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:11,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 179.0) internal successors, (1790), 10 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:11,111 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 179.0) internal successors, (1790), 10 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:11,111 INFO L185 Difference]: Start difference. First operand has 99 places, 111 transitions, 1793 flow. Second operand 9 states and 1158 transitions. [2021-03-25 15:03:11,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 129 transitions, 2343 flow [2021-03-25 15:03:11,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 129 transitions, 2211 flow, removed 21 selfloop flow, removed 10 redundant places. [2021-03-25 15:03:11,132 INFO L241 Difference]: Finished difference. Result has 101 places, 112 transitions, 1855 flow [2021-03-25 15:03:11,132 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1670, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1855, PETRI_PLACES=101, PETRI_TRANSITIONS=112} [2021-03-25 15:03:11,132 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 54 predicate places. [2021-03-25 15:03:11,132 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:03:11,132 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 112 transitions, 1855 flow [2021-03-25 15:03:11,132 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 112 transitions, 1855 flow [2021-03-25 15:03:11,134 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 112 transitions, 1855 flow [2021-03-25 15:03:11,203 INFO L129 PetriNetUnfolder]: 125/400 cut-off events. [2021-03-25 15:03:11,203 INFO L130 PetriNetUnfolder]: For 5179/5313 co-relation queries the response was YES. [2021-03-25 15:03:11,205 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2849 conditions, 400 events. 125/400 cut-off events. For 5179/5313 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2787 event pairs, 14 based on Foata normal form. 46/431 useless extension candidates. Maximal degree in co-relation 2804. Up to 138 conditions per place. [2021-03-25 15:03:11,210 INFO L142 LiptonReduction]: Number of co-enabled transitions 578 [2021-03-25 15:03:11,228 INFO L154 LiptonReduction]: Checked pairs total: 1246 [2021-03-25 15:03:11,228 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:03:11,229 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 97 [2021-03-25 15:03:11,229 INFO L480 AbstractCegarLoop]: Abstraction has has 101 places, 112 transitions, 1855 flow [2021-03-25 15:03:11,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:11,230 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:03:11,230 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:03:11,230 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 15:03:11,230 INFO L428 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:03:11,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:03:11,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1024357136, now seen corresponding path program 1 times [2021-03-25 15:03:11,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:03:11,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308783192] [2021-03-25 15:03:11,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:03:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:03:11,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:11,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:03:11,300 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 15:03:11,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 15:03:11,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:11,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:03:11,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-25 15:03:11,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308783192] [2021-03-25 15:03:11,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:03:11,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 15:03:11,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751712439] [2021-03-25 15:03:11,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 15:03:11,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:03:11,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 15:03:11,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 15:03:11,313 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 179 [2021-03-25 15:03:11,313 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 112 transitions, 1855 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-25 15:03:11,314 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:03:11,314 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 179 [2021-03-25 15:03:11,314 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:03:11,448 INFO L129 PetriNetUnfolder]: 279/653 cut-off events. [2021-03-25 15:03:11,449 INFO L130 PetriNetUnfolder]: For 7234/7539 co-relation queries the response was YES. [2021-03-25 15:03:11,452 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3184 conditions, 653 events. 279/653 cut-off events. For 7234/7539 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 4388 event pairs, 93 based on Foata normal form. 197/813 useless extension candidates. Maximal degree in co-relation 3137. Up to 365 conditions per place. [2021-03-25 15:03:11,455 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 10 selfloop transitions, 8 changer transitions 0/77 dead transitions. [2021-03-25 15:03:11,455 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 77 transitions, 1080 flow [2021-03-25 15:03:11,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 15:03:11,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 15:03:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 768 transitions. [2021-03-25 15:03:11,457 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8581005586592179 [2021-03-25 15:03:11,457 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 768 transitions. [2021-03-25 15:03:11,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 768 transitions. [2021-03-25 15:03:11,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:03:11,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 768 transitions. [2021-03-25 15:03:11,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.6) internal successors, (768), 5 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:11,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:11,473 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:11,473 INFO L185 Difference]: Start difference. First operand has 101 places, 112 transitions, 1855 flow. Second operand 5 states and 768 transitions. [2021-03-25 15:03:11,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 77 transitions, 1080 flow [2021-03-25 15:03:11,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 77 transitions, 900 flow, removed 20 selfloop flow, removed 24 redundant places. [2021-03-25 15:03:11,490 INFO L241 Difference]: Finished difference. Result has 83 places, 74 transitions, 912 flow [2021-03-25 15:03:11,490 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=912, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2021-03-25 15:03:11,490 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 36 predicate places. [2021-03-25 15:03:11,490 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:03:11,490 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 74 transitions, 912 flow [2021-03-25 15:03:11,490 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 74 transitions, 912 flow [2021-03-25 15:03:11,491 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 74 transitions, 912 flow [2021-03-25 15:03:11,564 INFO L129 PetriNetUnfolder]: 278/651 cut-off events. [2021-03-25 15:03:11,564 INFO L130 PetriNetUnfolder]: For 5151/5439 co-relation queries the response was YES. [2021-03-25 15:03:11,568 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3342 conditions, 651 events. 278/651 cut-off events. For 5151/5439 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 4455 event pairs, 87 based on Foata normal form. 56/649 useless extension candidates. Maximal degree in co-relation 3305. Up to 369 conditions per place. [2021-03-25 15:03:11,573 INFO L142 LiptonReduction]: Number of co-enabled transitions 494 [2021-03-25 15:03:12,322 WARN L205 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 260 DAG size of output: 165 [2021-03-25 15:03:12,538 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2021-03-25 15:03:14,197 WARN L205 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 365 DAG size of output: 243 [2021-03-25 15:03:14,740 WARN L205 SmtUtils]: Spent 526.00 ms on a formula simplification that was a NOOP. DAG size: 226 [2021-03-25 15:03:15,407 WARN L205 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 162 [2021-03-25 15:03:15,650 WARN L205 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2021-03-25 15:03:17,436 WARN L205 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 320 DAG size of output: 258 [2021-03-25 15:03:18,096 WARN L205 SmtUtils]: Spent 657.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2021-03-25 15:03:18,105 INFO L154 LiptonReduction]: Checked pairs total: 8 [2021-03-25 15:03:18,106 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 15:03:18,106 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6616 [2021-03-25 15:03:18,106 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 932 flow [2021-03-25 15:03:18,106 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-25 15:03:18,107 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:03:18,107 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:03:18,107 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 15:03:18,107 INFO L428 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:03:18,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:03:18,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1464841310, now seen corresponding path program 1 times [2021-03-25 15:03:18,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:03:18,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205711853] [2021-03-25 15:03:18,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:03:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:03:18,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:18,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:03:18,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:18,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:03:18,184 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 15:03:18,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 15:03:18,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:18,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:03:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:03:18,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205711853] [2021-03-25 15:03:18,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:03:18,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 15:03:18,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012674381] [2021-03-25 15:03:18,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 15:03:18,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:03:18,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 15:03:18,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 15:03:18,199 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 181 [2021-03-25 15:03:18,199 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 932 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-25 15:03:18,199 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:03:18,199 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 181 [2021-03-25 15:03:18,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:03:18,321 INFO L129 PetriNetUnfolder]: 154/463 cut-off events. [2021-03-25 15:03:18,322 INFO L130 PetriNetUnfolder]: For 5803/6694 co-relation queries the response was YES. [2021-03-25 15:03:18,324 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2416 conditions, 463 events. 154/463 cut-off events. For 5803/6694 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 3299 event pairs, 10 based on Foata normal form. 363/801 useless extension candidates. Maximal degree in co-relation 2377. Up to 287 conditions per place. [2021-03-25 15:03:18,326 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 5 selfloop transitions, 15 changer transitions 3/73 dead transitions. [2021-03-25 15:03:18,326 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 73 transitions, 880 flow [2021-03-25 15:03:18,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 15:03:18,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 15:03:18,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1089 transitions. [2021-03-25 15:03:18,329 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8595106550907656 [2021-03-25 15:03:18,329 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1089 transitions. [2021-03-25 15:03:18,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1089 transitions. [2021-03-25 15:03:18,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:03:18,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1089 transitions. [2021-03-25 15:03:18,331 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-25 15:03:18,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:18,333 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:18,333 INFO L185 Difference]: Start difference. First operand has 83 places, 74 transitions, 932 flow. Second operand 7 states and 1089 transitions. [2021-03-25 15:03:18,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 73 transitions, 880 flow [2021-03-25 15:03:18,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 73 transitions, 805 flow, removed 15 selfloop flow, removed 8 redundant places. [2021-03-25 15:03:18,342 INFO L241 Difference]: Finished difference. Result has 84 places, 70 transitions, 800 flow [2021-03-25 15:03:18,342 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=800, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2021-03-25 15:03:18,342 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 37 predicate places. [2021-03-25 15:03:18,342 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:03:18,342 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 70 transitions, 800 flow [2021-03-25 15:03:18,343 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 70 transitions, 800 flow [2021-03-25 15:03:18,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 70 transitions, 800 flow [2021-03-25 15:03:18,390 INFO L129 PetriNetUnfolder]: 138/440 cut-off events. [2021-03-25 15:03:18,390 INFO L130 PetriNetUnfolder]: For 3697/4116 co-relation queries the response was YES. [2021-03-25 15:03:18,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2404 conditions, 440 events. 138/440 cut-off events. For 3697/4116 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 3213 event pairs, 10 based on Foata normal form. 40/455 useless extension candidates. Maximal degree in co-relation 2366. Up to 263 conditions per place. [2021-03-25 15:03:18,397 INFO L142 LiptonReduction]: Number of co-enabled transitions 518 [2021-03-25 15:03:18,406 INFO L154 LiptonReduction]: Checked pairs total: 67 [2021-03-25 15:03:18,406 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 15:03:18,407 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 65 [2021-03-25 15:03:18,407 INFO L480 AbstractCegarLoop]: Abstraction has has 84 places, 68 transitions, 784 flow [2021-03-25 15:03:18,408 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-25 15:03:18,408 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:03:18,408 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:03:18,408 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 15:03:18,408 INFO L428 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:03:18,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:03:18,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1042782162, now seen corresponding path program 1 times [2021-03-25 15:03:18,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:03:18,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507158896] [2021-03-25 15:03:18,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:03:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:03:18,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:18,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:03:18,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:18,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:03:18,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:18,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:03:18,478 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 15:03:18,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 15:03:18,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:18,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:03:18,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:03:18,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507158896] [2021-03-25 15:03:18,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:03:18,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 15:03:18,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029516440] [2021-03-25 15:03:18,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 15:03:18,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:03:18,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 15:03:18,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 15:03:18,494 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 181 [2021-03-25 15:03:18,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 68 transitions, 784 flow. Second operand has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:18,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:03:18,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 181 [2021-03-25 15:03:18,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:03:18,585 INFO L129 PetriNetUnfolder]: 66/233 cut-off events. [2021-03-25 15:03:18,586 INFO L130 PetriNetUnfolder]: For 2354/2467 co-relation queries the response was YES. [2021-03-25 15:03:18,587 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 233 events. 66/233 cut-off events. For 2354/2467 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1325 event pairs, 0 based on Foata normal form. 80/309 useless extension candidates. Maximal degree in co-relation 1339. Up to 127 conditions per place. [2021-03-25 15:03:18,588 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 2 selfloop transitions, 11 changer transitions 4/64 dead transitions. [2021-03-25 15:03:18,588 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 64 transitions, 767 flow [2021-03-25 15:03:18,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 15:03:18,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 15:03:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1082 transitions. [2021-03-25 15:03:18,593 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8539857932123125 [2021-03-25 15:03:18,593 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1082 transitions. [2021-03-25 15:03:18,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1082 transitions. [2021-03-25 15:03:18,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:03:18,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1082 transitions. [2021-03-25 15:03:18,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 154.57142857142858) internal successors, (1082), 7 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:18,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:18,599 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:18,599 INFO L185 Difference]: Start difference. First operand has 84 places, 68 transitions, 784 flow. Second operand 7 states and 1082 transitions. [2021-03-25 15:03:18,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 64 transitions, 767 flow [2021-03-25 15:03:18,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 64 transitions, 689 flow, removed 26 selfloop flow, removed 7 redundant places. [2021-03-25 15:03:18,606 INFO L241 Difference]: Finished difference. Result has 81 places, 60 transitions, 656 flow [2021-03-25 15:03:18,607 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=656, PETRI_PLACES=81, PETRI_TRANSITIONS=60} [2021-03-25 15:03:18,607 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 34 predicate places. [2021-03-25 15:03:18,607 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:03:18,608 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 60 transitions, 656 flow [2021-03-25 15:03:18,608 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 60 transitions, 656 flow [2021-03-25 15:03:18,609 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 60 transitions, 656 flow [2021-03-25 15:03:18,635 INFO L129 PetriNetUnfolder]: 56/216 cut-off events. [2021-03-25 15:03:18,635 INFO L130 PetriNetUnfolder]: For 1000/1025 co-relation queries the response was YES. [2021-03-25 15:03:18,636 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1171 conditions, 216 events. 56/216 cut-off events. For 1000/1025 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1248 event pairs, 0 based on Foata normal form. 12/224 useless extension candidates. Maximal degree in co-relation 1134. Up to 74 conditions per place. [2021-03-25 15:03:18,638 INFO L142 LiptonReduction]: Number of co-enabled transitions 262 [2021-03-25 15:03:19,418 WARN L205 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 184 [2021-03-25 15:03:19,681 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-25 15:03:21,338 WARN L205 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 339 DAG size of output: 262 [2021-03-25 15:03:22,021 WARN L205 SmtUtils]: Spent 681.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2021-03-25 15:03:22,323 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 15:03:22,625 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 15:03:23,350 WARN L205 SmtUtils]: Spent 723.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 15:03:24,092 WARN L205 SmtUtils]: Spent 740.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 15:03:24,098 INFO L154 LiptonReduction]: Checked pairs total: 9 [2021-03-25 15:03:24,098 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 15:03:24,098 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5491 [2021-03-25 15:03:24,098 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 57 transitions, 642 flow [2021-03-25 15:03:24,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:24,099 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:03:24,099 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:03:24,099 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 15:03:24,099 INFO L428 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:03:24,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:03:24,099 INFO L82 PathProgramCache]: Analyzing trace with hash -192654513, now seen corresponding path program 1 times [2021-03-25 15:03:24,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:03:24,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520879524] [2021-03-25 15:03:24,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:03:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:03:24,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:24,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:03:24,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:24,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 15:03:24,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:24,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 15:03:24,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:24,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 15:03:24,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:03:24,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520879524] [2021-03-25 15:03:24,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:03:24,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 15:03:24,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395386339] [2021-03-25 15:03:24,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 15:03:24,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:03:24,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 15:03:24,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-25 15:03:24,178 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 183 [2021-03-25 15:03:24,178 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 57 transitions, 642 flow. Second operand has 6 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:24,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:03:24,179 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 183 [2021-03-25 15:03:24,179 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:03:24,402 INFO L129 PetriNetUnfolder]: 64/212 cut-off events. [2021-03-25 15:03:24,402 INFO L130 PetriNetUnfolder]: For 2208/2284 co-relation queries the response was YES. [2021-03-25 15:03:24,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 212 events. 64/212 cut-off events. For 2208/2284 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1188 event pairs, 0 based on Foata normal form. 42/247 useless extension candidates. Maximal degree in co-relation 1180. Up to 77 conditions per place. [2021-03-25 15:03:24,404 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 21 selfloop transitions, 15 changer transitions 6/60 dead transitions. [2021-03-25 15:03:24,404 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 60 transitions, 770 flow [2021-03-25 15:03:24,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 15:03:24,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 15:03:24,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1043 transitions. [2021-03-25 15:03:24,407 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.712431693989071 [2021-03-25 15:03:24,407 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1043 transitions. [2021-03-25 15:03:24,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1043 transitions. [2021-03-25 15:03:24,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:03:24,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1043 transitions. [2021-03-25 15:03:24,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.375) internal successors, (1043), 8 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:24,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:24,411 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:24,411 INFO L185 Difference]: Start difference. First operand has 77 places, 57 transitions, 642 flow. Second operand 8 states and 1043 transitions. [2021-03-25 15:03:24,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 60 transitions, 770 flow [2021-03-25 15:03:24,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 60 transitions, 688 flow, removed 24 selfloop flow, removed 10 redundant places. [2021-03-25 15:03:24,419 INFO L241 Difference]: Finished difference. Result has 77 places, 54 transitions, 580 flow [2021-03-25 15:03:24,419 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=580, PETRI_PLACES=77, PETRI_TRANSITIONS=54} [2021-03-25 15:03:24,419 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 30 predicate places. [2021-03-25 15:03:24,420 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:03:24,420 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 54 transitions, 580 flow [2021-03-25 15:03:24,420 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 54 transitions, 580 flow [2021-03-25 15:03:24,420 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 54 transitions, 580 flow [2021-03-25 15:03:24,443 INFO L129 PetriNetUnfolder]: 53/171 cut-off events. [2021-03-25 15:03:24,443 INFO L130 PetriNetUnfolder]: For 697/717 co-relation queries the response was YES. [2021-03-25 15:03:24,444 INFO L84 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 171 events. 53/171 cut-off events. For 697/717 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 893 event pairs, 0 based on Foata normal form. 13/180 useless extension candidates. Maximal degree in co-relation 785. Up to 46 conditions per place. [2021-03-25 15:03:24,445 INFO L142 LiptonReduction]: Number of co-enabled transitions 204 [2021-03-25 15:03:24,446 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 15:03:24,446 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:03:24,447 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 27 [2021-03-25 15:03:24,448 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 54 transitions, 580 flow [2021-03-25 15:03:24,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:24,448 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:03:24,448 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:03:24,448 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-25 15:03:24,449 INFO L428 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:03:24,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:03:24,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1484803533, now seen corresponding path program 1 times [2021-03-25 15:03:24,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:03:24,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053304522] [2021-03-25 15:03:24,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:03:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:03:24,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:24,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 15:03:24,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:24,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 15:03:24,532 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-25 15:03:24,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 15:03:24,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:24,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 15:03:24,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:24,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 15:03:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:03:24,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053304522] [2021-03-25 15:03:24,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:03:24,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 15:03:24,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042225943] [2021-03-25 15:03:24,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 15:03:24,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:03:24,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 15:03:24,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 15:03:24,601 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 183 [2021-03-25 15:03:24,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 54 transitions, 580 flow. Second operand has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:24,602 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:03:24,602 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 183 [2021-03-25 15:03:24,602 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:03:24,894 INFO L129 PetriNetUnfolder]: 68/217 cut-off events. [2021-03-25 15:03:24,894 INFO L130 PetriNetUnfolder]: For 1046/1088 co-relation queries the response was YES. [2021-03-25 15:03:24,895 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 217 events. 68/217 cut-off events. For 1046/1088 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1240 event pairs, 0 based on Foata normal form. 32/240 useless extension candidates. Maximal degree in co-relation 1048. Up to 62 conditions per place. [2021-03-25 15:03:24,896 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 18 selfloop transitions, 14 changer transitions 10/60 dead transitions. [2021-03-25 15:03:24,896 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 60 transitions, 748 flow [2021-03-25 15:03:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 15:03:24,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 15:03:24,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1228 transitions. [2021-03-25 15:03:24,902 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6710382513661202 [2021-03-25 15:03:24,902 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1228 transitions. [2021-03-25 15:03:24,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1228 transitions. [2021-03-25 15:03:24,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:03:24,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1228 transitions. [2021-03-25 15:03:24,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.8) internal successors, (1228), 10 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:24,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:24,910 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:24,910 INFO L185 Difference]: Start difference. First operand has 76 places, 54 transitions, 580 flow. Second operand 10 states and 1228 transitions. [2021-03-25 15:03:24,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 60 transitions, 748 flow [2021-03-25 15:03:24,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 60 transitions, 701 flow, removed 5 selfloop flow, removed 9 redundant places. [2021-03-25 15:03:24,917 INFO L241 Difference]: Finished difference. Result has 79 places, 50 transitions, 546 flow [2021-03-25 15:03:24,917 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=546, PETRI_PLACES=79, PETRI_TRANSITIONS=50} [2021-03-25 15:03:24,917 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 32 predicate places. [2021-03-25 15:03:24,917 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:03:24,918 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 50 transitions, 546 flow [2021-03-25 15:03:24,920 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 50 transitions, 546 flow [2021-03-25 15:03:24,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 50 transitions, 546 flow [2021-03-25 15:03:24,941 INFO L129 PetriNetUnfolder]: 50/163 cut-off events. [2021-03-25 15:03:24,941 INFO L130 PetriNetUnfolder]: For 668/686 co-relation queries the response was YES. [2021-03-25 15:03:24,942 INFO L84 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 163 events. 50/163 cut-off events. For 668/686 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 855 event pairs, 0 based on Foata normal form. 11/168 useless extension candidates. Maximal degree in co-relation 767. Up to 46 conditions per place. [2021-03-25 15:03:24,943 INFO L142 LiptonReduction]: Number of co-enabled transitions 186 [2021-03-25 15:03:24,944 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 15:03:24,945 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:03:24,945 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28 [2021-03-25 15:03:24,946 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 50 transitions, 546 flow [2021-03-25 15:03:24,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:24,946 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:03:24,946 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:03:24,947 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-25 15:03:24,947 INFO L428 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:03:24,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:03:24,947 INFO L82 PathProgramCache]: Analyzing trace with hash -3241456, now seen corresponding path program 1 times [2021-03-25 15:03:24,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:03:24,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779558195] [2021-03-25 15:03:24,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:03:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:03:24,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:24,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 15:03:25,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:25,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 15:03:25,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:25,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 15:03:25,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:25,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 15:03:25,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:25,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 15:03:25,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:25,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 15:03:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:03:25,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779558195] [2021-03-25 15:03:25,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:03:25,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 15:03:25,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156555112] [2021-03-25 15:03:25,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 15:03:25,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:03:25,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 15:03:25,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 15:03:25,083 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 183 [2021-03-25 15:03:25,083 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 50 transitions, 546 flow. Second operand has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:25,083 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:03:25,083 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 183 [2021-03-25 15:03:25,084 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:03:25,496 INFO L129 PetriNetUnfolder]: 65/207 cut-off events. [2021-03-25 15:03:25,496 INFO L130 PetriNetUnfolder]: For 1018/1056 co-relation queries the response was YES. [2021-03-25 15:03:25,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 207 events. 65/207 cut-off events. For 1018/1056 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1129 event pairs, 0 based on Foata normal form. 23/219 useless extension candidates. Maximal degree in co-relation 971. Up to 67 conditions per place. [2021-03-25 15:03:25,498 INFO L132 encePairwiseOnDemand]: 175/183 looper letters, 12 selfloop transitions, 12 changer transitions 12/54 dead transitions. [2021-03-25 15:03:25,498 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 54 transitions, 678 flow [2021-03-25 15:03:25,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 15:03:25,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 15:03:25,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 872 transitions. [2021-03-25 15:03:25,501 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6807181889149102 [2021-03-25 15:03:25,501 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 872 transitions. [2021-03-25 15:03:25,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 872 transitions. [2021-03-25 15:03:25,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:03:25,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 872 transitions. [2021-03-25 15:03:25,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:25,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:25,504 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:25,504 INFO L185 Difference]: Start difference. First operand has 74 places, 50 transitions, 546 flow. Second operand 7 states and 872 transitions. [2021-03-25 15:03:25,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 54 transitions, 678 flow [2021-03-25 15:03:25,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 54 transitions, 573 flow, removed 27 selfloop flow, removed 11 redundant places. [2021-03-25 15:03:25,511 INFO L241 Difference]: Finished difference. Result has 71 places, 42 transitions, 395 flow [2021-03-25 15:03:25,511 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=63, 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=7, PETRI_FLOW=395, PETRI_PLACES=71, PETRI_TRANSITIONS=42} [2021-03-25 15:03:25,511 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 24 predicate places. [2021-03-25 15:03:25,511 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:03:25,511 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 42 transitions, 395 flow [2021-03-25 15:03:25,511 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 42 transitions, 395 flow [2021-03-25 15:03:25,512 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 42 transitions, 395 flow [2021-03-25 15:03:25,527 INFO L129 PetriNetUnfolder]: 43/143 cut-off events. [2021-03-25 15:03:25,527 INFO L130 PetriNetUnfolder]: For 493/505 co-relation queries the response was YES. [2021-03-25 15:03:25,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 143 events. 43/143 cut-off events. For 493/505 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 682 event pairs, 0 based on Foata normal form. 8/146 useless extension candidates. Maximal degree in co-relation 542. Up to 47 conditions per place. [2021-03-25 15:03:25,529 INFO L142 LiptonReduction]: Number of co-enabled transitions 154 [2021-03-25 15:03:25,530 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 15:03:25,530 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:03:25,530 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-03-25 15:03:25,531 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 42 transitions, 395 flow [2021-03-25 15:03:25,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:25,531 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:03:25,531 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:03:25,531 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-25 15:03:25,531 INFO L428 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:03:25,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:03:25,532 INFO L82 PathProgramCache]: Analyzing trace with hash -360898918, now seen corresponding path program 1 times [2021-03-25 15:03:25,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:03:25,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018281473] [2021-03-25 15:03:25,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:03:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:03:25,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:25,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 15:03:25,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:25,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 15:03:25,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:25,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 15:03:25,633 INFO L142 QuantifierPusher]: treesize reduction 4, result has 89.7 percent of original size [2021-03-25 15:03:25,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 15:03:25,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:25,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 15:03:25,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:25,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 15:03:25,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:03:25,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018281473] [2021-03-25 15:03:25,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:03:25,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 15:03:25,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107664662] [2021-03-25 15:03:25,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 15:03:25,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:03:25,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 15:03:25,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 15:03:25,717 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 183 [2021-03-25 15:03:25,718 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 42 transitions, 395 flow. Second operand has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:25,718 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:03:25,718 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 183 [2021-03-25 15:03:25,718 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:03:26,013 INFO L129 PetriNetUnfolder]: 49/159 cut-off events. [2021-03-25 15:03:26,014 INFO L130 PetriNetUnfolder]: For 599/618 co-relation queries the response was YES. [2021-03-25 15:03:26,014 INFO L84 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 159 events. 49/159 cut-off events. For 599/618 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 798 event pairs, 0 based on Foata normal form. 12/162 useless extension candidates. Maximal degree in co-relation 628. Up to 55 conditions per place. [2021-03-25 15:03:26,015 INFO L132 encePairwiseOnDemand]: 177/183 looper letters, 11 selfloop transitions, 11 changer transitions 2/42 dead transitions. [2021-03-25 15:03:26,015 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 42 transitions, 443 flow [2021-03-25 15:03:26,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 15:03:26,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 15:03:26,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 983 transitions. [2021-03-25 15:03:26,016 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.671448087431694 [2021-03-25 15:03:26,016 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 983 transitions. [2021-03-25 15:03:26,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 983 transitions. [2021-03-25 15:03:26,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:03:26,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 983 transitions. [2021-03-25 15:03:26,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.875) internal successors, (983), 8 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:26,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:26,019 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:26,020 INFO L185 Difference]: Start difference. First operand has 69 places, 42 transitions, 395 flow. Second operand 8 states and 983 transitions. [2021-03-25 15:03:26,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 42 transitions, 443 flow [2021-03-25 15:03:26,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 42 transitions, 380 flow, removed 9 selfloop flow, removed 9 redundant places. [2021-03-25 15:03:26,025 INFO L241 Difference]: Finished difference. Result has 67 places, 40 transitions, 328 flow [2021-03-25 15:03:26,025 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=328, PETRI_PLACES=67, PETRI_TRANSITIONS=40} [2021-03-25 15:03:26,025 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2021-03-25 15:03:26,025 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:03:26,025 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 40 transitions, 328 flow [2021-03-25 15:03:26,026 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 40 transitions, 328 flow [2021-03-25 15:03:26,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 40 transitions, 328 flow [2021-03-25 15:03:26,039 INFO L129 PetriNetUnfolder]: 39/130 cut-off events. [2021-03-25 15:03:26,039 INFO L130 PetriNetUnfolder]: For 345/352 co-relation queries the response was YES. [2021-03-25 15:03:26,039 INFO L84 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 130 events. 39/130 cut-off events. For 345/352 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 590 event pairs, 0 based on Foata normal form. 6/131 useless extension candidates. Maximal degree in co-relation 460. Up to 43 conditions per place. [2021-03-25 15:03:26,040 INFO L142 LiptonReduction]: Number of co-enabled transitions 142 [2021-03-25 15:03:26,041 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 15:03:26,041 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:03:26,041 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-03-25 15:03:26,042 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 40 transitions, 328 flow [2021-03-25 15:03:26,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:26,042 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:03:26,042 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:03:26,042 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-25 15:03:26,042 INFO L428 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:03:26,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:03:26,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1064403778, now seen corresponding path program 2 times [2021-03-25 15:03:26,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:03:26,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102793236] [2021-03-25 15:03:26,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:03:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:03:26,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:26,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 15:03:26,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:26,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 15:03:26,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:26,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 15:03:26,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:26,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 15:03:26,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:26,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 15:03:26,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:03:26,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 15:03:26,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:03:26,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102793236] [2021-03-25 15:03:26,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:03:26,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 15:03:26,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338169109] [2021-03-25 15:03:26,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 15:03:26,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:03:26,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 15:03:26,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-25 15:03:26,366 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 183 [2021-03-25 15:03:26,366 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 40 transitions, 328 flow. Second operand has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:26,367 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:03:26,367 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 183 [2021-03-25 15:03:26,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:03:26,767 INFO L129 PetriNetUnfolder]: 38/133 cut-off events. [2021-03-25 15:03:26,767 INFO L130 PetriNetUnfolder]: For 406/420 co-relation queries the response was YES. [2021-03-25 15:03:26,768 INFO L84 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 133 events. 38/133 cut-off events. For 406/420 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 613 event pairs, 0 based on Foata normal form. 11/138 useless extension candidates. Maximal degree in co-relation 501. Up to 42 conditions per place. [2021-03-25 15:03:26,769 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 2 selfloop transitions, 9 changer transitions 14/41 dead transitions. [2021-03-25 15:03:26,769 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 41 transitions, 373 flow [2021-03-25 15:03:26,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 15:03:26,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 15:03:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1199 transitions. [2021-03-25 15:03:26,772 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6551912568306011 [2021-03-25 15:03:26,772 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1199 transitions. [2021-03-25 15:03:26,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1199 transitions. [2021-03-25 15:03:26,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:03:26,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1199 transitions. [2021-03-25 15:03:26,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.9) internal successors, (1199), 10 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:26,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:26,777 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:26,777 INFO L185 Difference]: Start difference. First operand has 65 places, 40 transitions, 328 flow. Second operand 10 states and 1199 transitions. [2021-03-25 15:03:26,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 41 transitions, 373 flow [2021-03-25 15:03:26,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 41 transitions, 344 flow, removed 2 selfloop flow, removed 5 redundant places. [2021-03-25 15:03:26,781 INFO L241 Difference]: Finished difference. Result has 69 places, 27 transitions, 196 flow [2021-03-25 15:03:26,782 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=196, PETRI_PLACES=69, PETRI_TRANSITIONS=27} [2021-03-25 15:03:26,782 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 22 predicate places. [2021-03-25 15:03:26,782 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:03:26,782 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 27 transitions, 196 flow [2021-03-25 15:03:26,784 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 27 transitions, 196 flow [2021-03-25 15:03:26,784 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 27 transitions, 196 flow [2021-03-25 15:03:26,790 INFO L129 PetriNetUnfolder]: 7/33 cut-off events. [2021-03-25 15:03:26,790 INFO L130 PetriNetUnfolder]: For 93/94 co-relation queries the response was YES. [2021-03-25 15:03:26,790 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 33 events. 7/33 cut-off events. For 93/94 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 46 event pairs, 0 based on Foata normal form. 1/34 useless extension candidates. Maximal degree in co-relation 114. Up to 10 conditions per place. [2021-03-25 15:03:26,791 INFO L142 LiptonReduction]: Number of co-enabled transitions 26 [2021-03-25 15:03:27,917 WARN L205 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 269 DAG size of output: 160 [2021-03-25 15:03:28,208 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2021-03-25 15:03:30,508 WARN L205 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 377 DAG size of output: 236 [2021-03-25 15:03:31,174 WARN L205 SmtUtils]: Spent 663.00 ms on a formula simplification that was a NOOP. DAG size: 218 [2021-03-25 15:03:32,283 WARN L205 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 15:03:32,786 WARN L205 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 15:03:34,998 WARN L205 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 15:03:35,992 WARN L205 SmtUtils]: Spent 992.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 15:03:36,520 WARN L205 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2021-03-25 15:03:36,891 WARN L205 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2021-03-25 15:03:37,695 WARN L205 SmtUtils]: Spent 802.00 ms on a formula simplification that was a NOOP. DAG size: 226 [2021-03-25 15:03:38,454 WARN L205 SmtUtils]: Spent 758.00 ms on a formula simplification that was a NOOP. DAG size: 224 [2021-03-25 15:03:39,033 WARN L205 SmtUtils]: Spent 575.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-25 15:03:39,590 WARN L205 SmtUtils]: Spent 555.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-25 15:03:40,678 WARN L205 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 264 [2021-03-25 15:03:41,763 WARN L205 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 264 [2021-03-25 15:03:41,766 INFO L154 LiptonReduction]: Checked pairs total: 8 [2021-03-25 15:03:41,766 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 15:03:41,766 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14984 [2021-03-25 15:03:41,766 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 23 transitions, 192 flow [2021-03-25 15:03:41,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:03:41,767 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:03:41,767 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:03:41,768 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-25 15:03:41,768 INFO L428 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:03:41,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:03:41,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1131383710, now seen corresponding path program 1 times [2021-03-25 15:03:41,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:03:41,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857624503] [2021-03-25 15:03:41,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:03:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 15:03:41,829 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 15:03:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 15:03:41,915 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 15:03:41,961 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 15:03:41,962 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 15:03:41,963 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-25 15:03:42,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 03:03:42 BasicIcfg [2021-03-25 15:03:42,074 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 15:03:42,079 INFO L168 Benchmark]: Toolchain (without parser) took 62583.95 ms. Allocated memory was 358.6 MB in the beginning and 1.0 GB in the end (delta: 652.2 MB). Free memory was 321.5 MB in the beginning and 799.6 MB in the end (delta: -478.1 MB). Peak memory consumption was 175.3 MB. Max. memory is 16.0 GB. [2021-03-25 15:03:42,079 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 358.6 MB. Free memory was 340.1 MB in the beginning and 340.1 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 15:03:42,079 INFO L168 Benchmark]: CACSL2BoogieTranslator took 602.65 ms. Allocated memory is still 358.6 MB. Free memory was 321.3 MB in the beginning and 316.0 MB in the end (delta: 5.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. [2021-03-25 15:03:42,079 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.42 ms. Allocated memory is still 358.6 MB. Free memory was 316.0 MB in the beginning and 312.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 15:03:42,080 INFO L168 Benchmark]: Boogie Preprocessor took 30.89 ms. Allocated memory is still 358.6 MB. Free memory was 312.8 MB in the beginning and 309.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 15:03:42,080 INFO L168 Benchmark]: RCFGBuilder took 2731.21 ms. Allocated memory was 358.6 MB in the beginning and 432.0 MB in the end (delta: 73.4 MB). Free memory was 309.7 MB in the beginning and 323.2 MB in the end (delta: -13.6 MB). Peak memory consumption was 174.1 MB. Max. memory is 16.0 GB. [2021-03-25 15:03:42,080 INFO L168 Benchmark]: TraceAbstraction took 59136.72 ms. Allocated memory was 432.0 MB in the beginning and 1.0 GB in the end (delta: 578.8 MB). Free memory was 323.2 MB in the beginning and 799.6 MB in the end (delta: -476.3 MB). Peak memory consumption was 102.5 MB. Max. memory is 16.0 GB. [2021-03-25 15:03:42,082 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 358.6 MB. Free memory was 340.1 MB in the beginning and 340.1 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 602.65 ms. Allocated memory is still 358.6 MB. Free memory was 321.3 MB in the beginning and 316.0 MB in the end (delta: 5.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 77.42 ms. Allocated memory is still 358.6 MB. Free memory was 316.0 MB in the beginning and 312.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 30.89 ms. Allocated memory is still 358.6 MB. Free memory was 312.8 MB in the beginning and 309.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2731.21 ms. Allocated memory was 358.6 MB in the beginning and 432.0 MB in the end (delta: 73.4 MB). Free memory was 309.7 MB in the beginning and 323.2 MB in the end (delta: -13.6 MB). Peak memory consumption was 174.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 59136.72 ms. Allocated memory was 432.0 MB in the beginning and 1.0 GB in the end (delta: 578.8 MB). Free memory was 323.2 MB in the beginning and 799.6 MB in the end (delta: -476.3 MB). Peak memory consumption was 102.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6313.5ms, 102 PlacesBefore, 47 PlacesAfterwards, 94 TransitionsBefore, 38 TransitionsAfterwards, 1668 CoEnabledTransitionPairs, 6 FixpointIterations, 25 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 65 TotalNumberOfCompositions, 3146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1442, positive: 1353, positive conditional: 0, positive unconditional: 1353, negative: 89, negative conditional: 0, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1037, positive: 1000, positive conditional: 0, positive unconditional: 1000, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1037, positive: 1000, positive conditional: 0, positive unconditional: 1000, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1037, positive: 996, positive conditional: 0, positive unconditional: 996, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 826, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 814, negative conditional: 0, negative unconditional: 814, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1442, positive: 353, positive conditional: 0, positive unconditional: 353, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 1037, unknown conditional: 0, unknown unconditional: 1037] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 89, Positive conditional cache size: 0, Positive unconditional cache size: 89, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5643.7ms, 44 PlacesBefore, 33 PlacesAfterwards, 35 TransitionsBefore, 24 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1174 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 444, positive: 361, positive conditional: 0, positive unconditional: 361, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 72, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 72, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 163, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 102, negative conditional: 0, negative unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 444, positive: 296, positive conditional: 0, positive unconditional: 296, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 72, unknown conditional: 0, unknown unconditional: 72] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1275.9ms, 37 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 23 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 753 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 225, positive: 171, positive conditional: 0, positive unconditional: 171, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 225, positive: 171, positive conditional: 0, positive unconditional: 171, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.6ms, 33 PlacesBefore, 33 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 233 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 78, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 85.0ms, 35 PlacesBefore, 35 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 178 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 63, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 70, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 108.7ms, 48 PlacesBefore, 48 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 410 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 208 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 100, positive: 93, positive conditional: 0, positive unconditional: 93, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 100, positive: 93, positive conditional: 0, positive unconditional: 93, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 91.9ms, 59 PlacesBefore, 56 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 424 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 214 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 72, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 124.5ms, 59 PlacesBefore, 59 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 496 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 550 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 355, positive: 341, positive conditional: 0, positive unconditional: 341, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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: 355, positive: 340, positive conditional: 0, positive unconditional: 340, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 95.0ms, 62 PlacesBefore, 62 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 692 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 469, positive: 451, positive conditional: 0, positive unconditional: 451, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 469, positive: 451, positive conditional: 0, positive unconditional: 451, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 142.7ms, 67 PlacesBefore, 67 PlacesAfterwards, 102 TransitionsBefore, 102 TransitionsAfterwards, 620 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1575 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1282, positive: 1249, positive conditional: 0, positive unconditional: 1249, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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: 1282, positive: 1248, positive conditional: 0, positive unconditional: 1248, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 92, Positive conditional cache size: 0, Positive unconditional cache size: 92, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 214.4ms, 70 PlacesBefore, 70 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 699 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 402, positive: 378, positive conditional: 0, positive unconditional: 378, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 67, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 402, positive: 378, positive conditional: 0, positive unconditional: 378, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 92, Positive conditional cache size: 0, Positive unconditional cache size: 92, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5653.1ms, 79 PlacesBefore, 79 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 554 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 2090 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1473, positive: 1412, positive conditional: 0, positive unconditional: 1412, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1473, positive: 1409, positive conditional: 0, positive unconditional: 1409, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 95, Positive conditional cache size: 0, Positive unconditional cache size: 95, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 106.0ms, 87 PlacesBefore, 87 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 524 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1115 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 834, positive: 800, positive conditional: 0, positive unconditional: 800, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 834, positive: 798, positive conditional: 0, positive unconditional: 798, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1684.5ms, 99 PlacesBefore, 99 PlacesAfterwards, 111 TransitionsBefore, 111 TransitionsAfterwards, 592 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 2795 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2181, positive: 2105, positive conditional: 0, positive unconditional: 2105, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2181, positive: 2102, positive conditional: 0, positive unconditional: 2102, negative: 75, negative conditional: 0, negative unconditional: 75, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 96.0ms, 101 PlacesBefore, 101 PlacesAfterwards, 112 TransitionsBefore, 112 TransitionsAfterwards, 578 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1246 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 945, positive: 907, positive conditional: 0, positive unconditional: 907, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 945, positive: 907, positive conditional: 0, positive unconditional: 907, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6615.3ms, 83 PlacesBefore, 83 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 494 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 8 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 8, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 92, Positive conditional cache size: 0, Positive unconditional cache size: 92, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 63.9ms, 84 PlacesBefore, 84 PlacesAfterwards, 70 TransitionsBefore, 68 TransitionsAfterwards, 518 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 67 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 67, positive: 67, positive conditional: 0, positive unconditional: 67, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 67, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 86, Positive conditional cache size: 0, Positive unconditional cache size: 86, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5489.6ms, 81 PlacesBefore, 77 PlacesAfterwards, 60 TransitionsBefore, 57 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 9 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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] , ConditionTransformingIndependenceRelation.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: 9, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26.6ms, 77 PlacesBefore, 76 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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): 82, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.5ms, 79 PlacesBefore, 74 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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): 82, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.9ms, 71 PlacesBefore, 69 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 154 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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): 82, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.7ms, 67 PlacesBefore, 65 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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): 82, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14982.4ms, 69 PlacesBefore, 60 PlacesAfterwards, 27 TransitionsBefore, 23 TransitionsAfterwards, 26 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 8 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 8, positive: 6, positive conditional: 0, positive unconditional: 6, 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): 29, Positive cache size: 29, Positive conditional cache size: 0, Positive unconditional cache size: 29, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2549; [L850] FCALL, FORK 0 pthread_create(&t2549, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2550; [L852] FCALL, FORK 0 pthread_create(&t2550, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2551; [L854] FCALL, FORK 0 pthread_create(&t2551, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 3 !(!expression) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=54, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L772] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=54, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=57, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 58855.4ms, OverallIterations: 23, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 6066.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6409.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 92 SDtfs, 130 SDslu, 49 SDs, 0 SdLazy, 943 SolverSat, 402 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1734.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 2729.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1855occurred in iteration=14, InterpolantAutomatonStates: 149, 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: 86.8ms SsaConstructionTime, 828.3ms SatisfiabilityAnalysisTime, 2471.6ms InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 326 ConstructedInterpolants, 0 QuantifiedInterpolants, 3060 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...