/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/safe012_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:53:04,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:53:04,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:53:04,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:53:04,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:53:04,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:53:04,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:53:04,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:53:04,519 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:53:04,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:53:04,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:53:04,527 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:53:04,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:53:04,529 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:53:04,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:53:04,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:53:04,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:53:04,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:53:04,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:53:04,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:53:04,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:53:04,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:53:04,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:53:04,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:53:04,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:53:04,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:53:04,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:53:04,558 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:53:04,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:53:04,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:53:04,559 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:53:04,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:53:04,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:53:04,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:53:04,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:53:04,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:53:04,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:53:04,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:53:04,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:53:04,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:53:04,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:53:04,570 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-03-25 14:53:04,603 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:53:04,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:53:04,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:53:04,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:53:04,607 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:53:04,607 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:53:04,607 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:53:04,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:53:04,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:53:04,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:53:04,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:53:04,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:53:04,609 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:53:04,609 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:53:04,609 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:53:04,609 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:53:04,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:53:04,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:53:04,610 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:53:04,610 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:53:04,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:53:04,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:53:04,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:53:04,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:53:04,610 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:53:04,610 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:53:04,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:53:04,611 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:53:04,611 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:53:04,611 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 14:53:04,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:53:04,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:53:04,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:53:04,949 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:53:04,950 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:53:04,951 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc.i [2021-03-25 14:53:05,017 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a50c9bd0/664851946c564453b5159e7293cae398/FLAGaad3ecc28 [2021-03-25 14:53:05,574 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:53:05,575 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc.i [2021-03-25 14:53:05,589 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a50c9bd0/664851946c564453b5159e7293cae398/FLAGaad3ecc28 [2021-03-25 14:53:06,026 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a50c9bd0/664851946c564453b5159e7293cae398 [2021-03-25 14:53:06,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:53:06,029 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:53:06,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:53:06,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:53:06,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:53:06,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:53:06" (1/1) ... [2021-03-25 14:53:06,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1908953f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:53:06, skipping insertion in model container [2021-03-25 14:53:06,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:53:06" (1/1) ... [2021-03-25 14:53:06,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:53:06,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:53:06,209 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/safe012_pso.oepc.i[993,1006] [2021-03-25 14:53:06,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:53:06,400 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:53:06,410 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/safe012_pso.oepc.i[993,1006] [2021-03-25 14:53:06,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:53:06,518 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:53:06,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:53:06 WrapperNode [2021-03-25 14:53:06,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:53:06,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:53:06,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:53:06,520 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:53:06,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:53:06" (1/1) ... [2021-03-25 14:53:06,544 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:53:06" (1/1) ... [2021-03-25 14:53:06,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:53:06,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:53:06,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:53:06,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:53:06,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:53:06" (1/1) ... [2021-03-25 14:53:06,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:53:06" (1/1) ... [2021-03-25 14:53:06,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:53:06" (1/1) ... [2021-03-25 14:53:06,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:53:06" (1/1) ... [2021-03-25 14:53:06,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:53:06" (1/1) ... [2021-03-25 14:53:06,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:53:06" (1/1) ... [2021-03-25 14:53:06,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:53:06" (1/1) ... [2021-03-25 14:53:06,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:53:06,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:53:06,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:53:06,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:53:06,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:53:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:53:06,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:53:06,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:53:06,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:53:06,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:53:06,672 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:53:06,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:53:06,673 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:53:06,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:53:06,674 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:53:06,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:53:06,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:53:06,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:53:06,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:53:06,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:53:06,676 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:53:08,377 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:53:08,377 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:53:08,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:53:08 BoogieIcfgContainer [2021-03-25 14:53:08,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:53:08,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:53:08,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:53:08,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:53:08,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:53:06" (1/3) ... [2021-03-25 14:53:08,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6caf1cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:53:08, skipping insertion in model container [2021-03-25 14:53:08,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:53:06" (2/3) ... [2021-03-25 14:53:08,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6caf1cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:53:08, skipping insertion in model container [2021-03-25 14:53:08,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:53:08" (3/3) ... [2021-03-25 14:53:08,387 INFO L111 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc.i [2021-03-25 14:53:08,391 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:53:08,395 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:53:08,396 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:53:08,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,435 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,435 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,436 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,436 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,451 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,452 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,452 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,452 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,452 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,453 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,456 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,457 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,468 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,468 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,468 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,468 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,473 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,474 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,477 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,477 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,477 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,480 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,481 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:53:08,482 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:53:08,498 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 14:53:08,528 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:53:08,528 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:53:08,528 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:53:08,529 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:53:08,529 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:53:08,529 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:53:08,529 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:53:08,529 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:53:08,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2021-03-25 14:53:08,584 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-25 14:53:08,584 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:53:08,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-25 14:53:08,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 98 transitions, 211 flow [2021-03-25 14:53:08,601 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 95 transitions, 199 flow [2021-03-25 14:53:08,603 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:53:08,613 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-25 14:53:08,615 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-25 14:53:08,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 199 flow [2021-03-25 14:53:08,647 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-25 14:53:08,647 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:53:08,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-25 14:53:08,653 INFO L142 LiptonReduction]: Number of co-enabled transitions 1586 [2021-03-25 14:53:09,692 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:53:10,135 WARN L205 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:53:10,255 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:53:11,582 INFO L154 LiptonReduction]: Checked pairs total: 2392 [2021-03-25 14:53:11,583 INFO L156 LiptonReduction]: Total number of compositions: 64 [2021-03-25 14:53:11,585 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2983 [2021-03-25 14:53:11,593 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-25 14:53:11,593 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:53:11,593 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:53:11,594 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:53:11,594 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:53:11,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:53:11,599 INFO L82 PathProgramCache]: Analyzing trace with hash 465480681, now seen corresponding path program 1 times [2021-03-25 14:53:11,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:53:11,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842340368] [2021-03-25 14:53:11,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:53:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:53:11,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:11,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:53:11,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:11,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:53:11,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842340368] [2021-03-25 14:53:11,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:53:11,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:53:11,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886305400] [2021-03-25 14:53:11,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:53:11,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:53:11,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:53:11,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:53:11,854 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 162 [2021-03-25 14:53:11,859 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:11,859 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:53:11,859 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 162 [2021-03-25 14:53:11,860 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:53:11,945 INFO L129 PetriNetUnfolder]: 29/109 cut-off events. [2021-03-25 14:53:11,946 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:53:11,946 INFO L84 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 109 events. 29/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 412 event pairs, 5 based on Foata normal form. 9/107 useless extension candidates. Maximal degree in co-relation 155. Up to 41 conditions per place. [2021-03-25 14:53:11,948 INFO L132 encePairwiseOnDemand]: 158/162 looper letters, 7 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2021-03-25 14:53:11,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 101 flow [2021-03-25 14:53:11,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:53:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:53:11,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2021-03-25 14:53:11,966 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9135802469135802 [2021-03-25 14:53:11,967 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2021-03-25 14:53:11,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2021-03-25 14:53:11,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:53:11,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2021-03-25 14:53:11,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:11,991 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 14:53:11,991 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 14:53:11,993 INFO L185 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 444 transitions. [2021-03-25 14:53:11,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 101 flow [2021-03-25 14:53:11,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 14:53:11,997 INFO L241 Difference]: Finished difference. Result has 43 places, 34 transitions, 78 flow [2021-03-25 14:53:11,999 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2021-03-25 14:53:12,000 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2021-03-25 14:53:12,000 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:53:12,000 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 34 transitions, 78 flow [2021-03-25 14:53:12,001 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 78 flow [2021-03-25 14:53:12,001 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 78 flow [2021-03-25 14:53:12,006 INFO L129 PetriNetUnfolder]: 0/34 cut-off events. [2021-03-25 14:53:12,006 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:53:12,007 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:53:12,008 INFO L142 LiptonReduction]: Number of co-enabled transitions 318 [2021-03-25 14:53:13,219 INFO L154 LiptonReduction]: Checked pairs total: 1163 [2021-03-25 14:53:13,219 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-25 14:53:13,219 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1219 [2021-03-25 14:53:13,221 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-25 14:53:13,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:13,221 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:53:13,221 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 14:53:13,222 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:53:13,222 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:53:13,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:53:13,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1239234005, now seen corresponding path program 1 times [2021-03-25 14:53:13,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:53:13,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727879361] [2021-03-25 14:53:13,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:53:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:53:13,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:13,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:53:13,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:13,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:13,344 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:53:13,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:53:13,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:53:13,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727879361] [2021-03-25 14:53:13,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:53:13,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:53:13,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443469328] [2021-03-25 14:53:13,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:53:13,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:53:13,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:53:13,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:53:13,351 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 173 [2021-03-25 14:53:13,351 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 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 14:53:13,352 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:53:13,352 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 173 [2021-03-25 14:53:13,352 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:53:13,374 INFO L129 PetriNetUnfolder]: 1/27 cut-off events. [2021-03-25 14:53:13,374 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:53:13,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 27 events. 1/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 34. Up to 3 conditions per place. [2021-03-25 14:53:13,375 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 1 selfloop transitions, 2 changer transitions 5/26 dead transitions. [2021-03-25 14:53:13,375 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 74 flow [2021-03-25 14:53:13,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:53:13,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:53:13,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 757 transitions. [2021-03-25 14:53:13,377 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8751445086705202 [2021-03-25 14:53:13,377 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 757 transitions. [2021-03-25 14:53:13,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 757 transitions. [2021-03-25 14:53:13,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:53:13,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 757 transitions. [2021-03-25 14:53:13,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.4) internal successors, (757), 5 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:13,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:13,381 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:13,381 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 5 states and 757 transitions. [2021-03-25 14:53:13,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 74 flow [2021-03-25 14:53:13,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 26 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:53:13,382 INFO L241 Difference]: Finished difference. Result has 36 places, 21 transitions, 56 flow [2021-03-25 14:53:13,383 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=56, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2021-03-25 14:53:13,383 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -10 predicate places. [2021-03-25 14:53:13,383 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:53:13,383 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 21 transitions, 56 flow [2021-03-25 14:53:13,384 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 21 transitions, 56 flow [2021-03-25 14:53:13,384 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 56 flow [2021-03-25 14:53:13,392 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-25 14:53:13,392 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:53:13,392 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:53:13,392 INFO L142 LiptonReduction]: Number of co-enabled transitions 184 [2021-03-25 14:53:13,740 WARN L205 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-25 14:53:13,904 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-25 14:53:14,230 WARN L205 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-25 14:53:14,373 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-25 14:53:14,376 INFO L154 LiptonReduction]: Checked pairs total: 420 [2021-03-25 14:53:14,376 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:53:14,376 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 993 [2021-03-25 14:53:14,377 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2021-03-25 14:53:14,377 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 14:53:14,377 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:53:14,377 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:53:14,378 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:53:14,378 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:53:14,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:53:14,378 INFO L82 PathProgramCache]: Analyzing trace with hash 253841940, now seen corresponding path program 1 times [2021-03-25 14:53:14,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:53:14,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597475275] [2021-03-25 14:53:14,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:53:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:53:14,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:14,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:53:14,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:14,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:14,474 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-03-25 14:53:14,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:53:14,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:53:14,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597475275] [2021-03-25 14:53:14,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:53:14,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:53:14,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359668171] [2021-03-25 14:53:14,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:53:14,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:53:14,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:53:14,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:53:14,489 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 174 [2021-03-25 14:53:14,490 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:14,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:53:14,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 174 [2021-03-25 14:53:14,490 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:53:14,527 INFO L129 PetriNetUnfolder]: 10/50 cut-off events. [2021-03-25 14:53:14,527 INFO L130 PetriNetUnfolder]: For 11/21 co-relation queries the response was YES. [2021-03-25 14:53:14,527 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 50 events. 10/50 cut-off events. For 11/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 1 based on Foata normal form. 3/51 useless extension candidates. Maximal degree in co-relation 88. Up to 12 conditions per place. [2021-03-25 14:53:14,528 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 7 selfloop transitions, 7 changer transitions 0/28 dead transitions. [2021-03-25 14:53:14,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 106 flow [2021-03-25 14:53:14,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:53:14,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:53:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 726 transitions. [2021-03-25 14:53:14,530 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8344827586206897 [2021-03-25 14:53:14,530 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 726 transitions. [2021-03-25 14:53:14,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 726 transitions. [2021-03-25 14:53:14,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:53:14,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 726 transitions. [2021-03-25 14:53:14,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.2) internal successors, (726), 5 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:14,533 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 14:53:14,534 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 14:53:14,534 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 5 states and 726 transitions. [2021-03-25 14:53:14,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 106 flow [2021-03-25 14:53:14,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 28 transitions, 98 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:53:14,535 INFO L241 Difference]: Finished difference. Result has 35 places, 25 transitions, 98 flow [2021-03-25 14:53:14,535 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2021-03-25 14:53:14,536 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -11 predicate places. [2021-03-25 14:53:14,536 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:53:14,536 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 98 flow [2021-03-25 14:53:14,536 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 25 transitions, 98 flow [2021-03-25 14:53:14,536 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 98 flow [2021-03-25 14:53:14,542 INFO L129 PetriNetUnfolder]: 9/42 cut-off events. [2021-03-25 14:53:14,542 INFO L130 PetriNetUnfolder]: For 20/21 co-relation queries the response was YES. [2021-03-25 14:53:14,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 42 events. 9/42 cut-off events. For 20/21 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 115 event pairs, 2 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 96. Up to 17 conditions per place. [2021-03-25 14:53:14,543 INFO L142 LiptonReduction]: Number of co-enabled transitions 238 [2021-03-25 14:53:14,545 INFO L154 LiptonReduction]: Checked pairs total: 208 [2021-03-25 14:53:14,545 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:53:14,545 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-03-25 14:53:14,546 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 98 flow [2021-03-25 14:53:14,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:14,546 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:53:14,546 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:53:14,547 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:53:14,547 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:53:14,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:53:14,547 INFO L82 PathProgramCache]: Analyzing trace with hash 414076855, now seen corresponding path program 1 times [2021-03-25 14:53:14,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:53:14,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429435584] [2021-03-25 14:53:14,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:53:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:53:14,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:14,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:14,652 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-03-25 14:53:14,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:53:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:53:14,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429435584] [2021-03-25 14:53:14,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:53:14,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:53:14,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408895678] [2021-03-25 14:53:14,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:53:14,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:53:14,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:53:14,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:53:14,663 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 174 [2021-03-25 14:53:14,664 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:14,664 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:53:14,664 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 174 [2021-03-25 14:53:14,664 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:53:14,683 INFO L129 PetriNetUnfolder]: 5/38 cut-off events. [2021-03-25 14:53:14,683 INFO L130 PetriNetUnfolder]: For 29/52 co-relation queries the response was YES. [2021-03-25 14:53:14,683 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 38 events. 5/38 cut-off events. For 29/52 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 94 event pairs, 0 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 89. Up to 12 conditions per place. [2021-03-25 14:53:14,684 INFO L132 encePairwiseOnDemand]: 171/174 looper letters, 8 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2021-03-25 14:53:14,684 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 131 flow [2021-03-25 14:53:14,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:53:14,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:53:14,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2021-03-25 14:53:14,685 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8716475095785441 [2021-03-25 14:53:14,686 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2021-03-25 14:53:14,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2021-03-25 14:53:14,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:53:14,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2021-03-25 14:53:14,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:14,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:14,689 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:14,689 INFO L185 Difference]: Start difference. First operand has 35 places, 25 transitions, 98 flow. Second operand 3 states and 455 transitions. [2021-03-25 14:53:14,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 131 flow [2021-03-25 14:53:14,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:53:14,691 INFO L241 Difference]: Finished difference. Result has 37 places, 25 transitions, 106 flow [2021-03-25 14:53:14,691 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2021-03-25 14:53:14,691 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -9 predicate places. [2021-03-25 14:53:14,691 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:53:14,691 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 25 transitions, 106 flow [2021-03-25 14:53:14,691 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 25 transitions, 106 flow [2021-03-25 14:53:14,692 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 25 transitions, 106 flow [2021-03-25 14:53:14,697 INFO L129 PetriNetUnfolder]: 7/39 cut-off events. [2021-03-25 14:53:14,697 INFO L130 PetriNetUnfolder]: For 30/33 co-relation queries the response was YES. [2021-03-25 14:53:14,698 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 39 events. 7/39 cut-off events. For 30/33 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 99 event pairs, 1 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 93. Up to 15 conditions per place. [2021-03-25 14:53:14,699 INFO L142 LiptonReduction]: Number of co-enabled transitions 238 [2021-03-25 14:53:14,700 INFO L154 LiptonReduction]: Checked pairs total: 208 [2021-03-25 14:53:14,700 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:53:14,700 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-03-25 14:53:14,701 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 106 flow [2021-03-25 14:53:14,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:14,702 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:53:14,702 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:53:14,702 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:53:14,702 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:53:14,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:53:14,702 INFO L82 PathProgramCache]: Analyzing trace with hash -779628772, now seen corresponding path program 1 times [2021-03-25 14:53:14,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:53:14,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325835432] [2021-03-25 14:53:14,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:53:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:53:14,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:14,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:14,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:14,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:14,740 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-03-25 14:53:14,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:53:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:53:14,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325835432] [2021-03-25 14:53:14,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:53:14,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:53:14,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262816265] [2021-03-25 14:53:14,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:53:14,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:53:14,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:53:14,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:53:14,750 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 174 [2021-03-25 14:53:14,751 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:14,751 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:53:14,751 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 174 [2021-03-25 14:53:14,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:53:14,777 INFO L129 PetriNetUnfolder]: 5/41 cut-off events. [2021-03-25 14:53:14,778 INFO L130 PetriNetUnfolder]: For 71/97 co-relation queries the response was YES. [2021-03-25 14:53:14,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 41 events. 5/41 cut-off events. For 71/97 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 111 event pairs, 1 based on Foata normal form. 5/45 useless extension candidates. Maximal degree in co-relation 106. Up to 13 conditions per place. [2021-03-25 14:53:14,778 INFO L132 encePairwiseOnDemand]: 170/174 looper letters, 3 selfloop transitions, 3 changer transitions 8/28 dead transitions. [2021-03-25 14:53:14,778 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 28 transitions, 151 flow [2021-03-25 14:53:14,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:53:14,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:53:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2021-03-25 14:53:14,781 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8318965517241379 [2021-03-25 14:53:14,781 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2021-03-25 14:53:14,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2021-03-25 14:53:14,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:53:14,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2021-03-25 14:53:14,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:14,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:14,785 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:14,785 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 106 flow. Second operand 4 states and 579 transitions. [2021-03-25 14:53:14,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 28 transitions, 151 flow [2021-03-25 14:53:14,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 28 transitions, 145 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:53:14,786 INFO L241 Difference]: Finished difference. Result has 40 places, 20 transitions, 86 flow [2021-03-25 14:53:14,787 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=40, PETRI_TRANSITIONS=20} [2021-03-25 14:53:14,787 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -6 predicate places. [2021-03-25 14:53:14,787 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:53:14,787 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 20 transitions, 86 flow [2021-03-25 14:53:14,787 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 20 transitions, 86 flow [2021-03-25 14:53:14,787 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 20 transitions, 86 flow [2021-03-25 14:53:14,791 INFO L129 PetriNetUnfolder]: 1/23 cut-off events. [2021-03-25 14:53:14,791 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-03-25 14:53:14,791 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 23 events. 1/23 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 1 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 51. Up to 6 conditions per place. [2021-03-25 14:53:14,791 INFO L142 LiptonReduction]: Number of co-enabled transitions 142 [2021-03-25 14:53:14,823 INFO L154 LiptonReduction]: Checked pairs total: 263 [2021-03-25 14:53:14,823 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:53:14,823 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 36 [2021-03-25 14:53:14,824 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 19 transitions, 82 flow [2021-03-25 14:53:14,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:14,824 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:53:14,824 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:53:14,824 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:53:14,824 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:53:14,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:53:14,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1787805180, now seen corresponding path program 1 times [2021-03-25 14:53:14,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:53:14,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476940151] [2021-03-25 14:53:14,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:53:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:53:14,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:14,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:14,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:14,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:53:14,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476940151] [2021-03-25 14:53:14,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:53:14,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:53:14,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13783929] [2021-03-25 14:53:14,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:53:14,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:53:14,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:53:14,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:53:14,868 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 175 [2021-03-25 14:53:14,869 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 19 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:14,869 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:53:14,869 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 175 [2021-03-25 14:53:14,869 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:53:14,887 INFO L129 PetriNetUnfolder]: 1/30 cut-off events. [2021-03-25 14:53:14,887 INFO L130 PetriNetUnfolder]: For 124/127 co-relation queries the response was YES. [2021-03-25 14:53:14,887 INFO L84 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 30 events. 1/30 cut-off events. For 124/127 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 1 based on Foata normal form. 5/35 useless extension candidates. Maximal degree in co-relation 74. Up to 8 conditions per place. [2021-03-25 14:53:14,887 INFO L132 encePairwiseOnDemand]: 171/175 looper letters, 1 selfloop transitions, 3 changer transitions 1/20 dead transitions. [2021-03-25 14:53:14,887 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 20 transitions, 103 flow [2021-03-25 14:53:14,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:53:14,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:53:14,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 599 transitions. [2021-03-25 14:53:14,889 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8557142857142858 [2021-03-25 14:53:14,889 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 599 transitions. [2021-03-25 14:53:14,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 599 transitions. [2021-03-25 14:53:14,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:53:14,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 599 transitions. [2021-03-25 14:53:14,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:14,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:14,893 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:14,893 INFO L185 Difference]: Start difference. First operand has 37 places, 19 transitions, 82 flow. Second operand 4 states and 599 transitions. [2021-03-25 14:53:14,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 20 transitions, 103 flow [2021-03-25 14:53:14,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 20 transitions, 68 flow, removed 8 selfloop flow, removed 9 redundant places. [2021-03-25 14:53:14,894 INFO L241 Difference]: Finished difference. Result has 33 places, 19 transitions, 68 flow [2021-03-25 14:53:14,894 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=33, PETRI_TRANSITIONS=19} [2021-03-25 14:53:14,895 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -13 predicate places. [2021-03-25 14:53:14,895 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:53:14,895 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 19 transitions, 68 flow [2021-03-25 14:53:14,895 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 19 transitions, 68 flow [2021-03-25 14:53:14,895 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 19 transitions, 68 flow [2021-03-25 14:53:14,898 INFO L129 PetriNetUnfolder]: 1/22 cut-off events. [2021-03-25 14:53:14,899 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-03-25 14:53:14,899 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 22 events. 1/22 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 1 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 41. Up to 6 conditions per place. [2021-03-25 14:53:14,899 INFO L142 LiptonReduction]: Number of co-enabled transitions 102 [2021-03-25 14:53:15,095 INFO L154 LiptonReduction]: Checked pairs total: 168 [2021-03-25 14:53:15,096 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:53:15,096 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 201 [2021-03-25 14:53:15,099 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 18 transitions, 66 flow [2021-03-25 14:53:15,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:15,099 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:53:15,099 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:53:15,100 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:53:15,100 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:53:15,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:53:15,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1375971376, now seen corresponding path program 1 times [2021-03-25 14:53:15,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:53:15,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247850189] [2021-03-25 14:53:15,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:53:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:53:15,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:15,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:15,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:15,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:15,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:15,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:53:15,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:53:15,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247850189] [2021-03-25 14:53:15,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:53:15,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:53:15,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383192708] [2021-03-25 14:53:15,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:53:15,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:53:15,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:53:15,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:53:15,175 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 176 [2021-03-25 14:53:15,175 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 18 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:15,175 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:53:15,175 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 176 [2021-03-25 14:53:15,176 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:53:15,210 INFO L129 PetriNetUnfolder]: 34/85 cut-off events. [2021-03-25 14:53:15,211 INFO L130 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2021-03-25 14:53:15,211 INFO L84 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 85 events. 34/85 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 317 event pairs, 17 based on Foata normal form. 8/88 useless extension candidates. Maximal degree in co-relation 198. Up to 48 conditions per place. [2021-03-25 14:53:15,212 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 5 selfloop transitions, 4 changer transitions 7/28 dead transitions. [2021-03-25 14:53:15,212 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 28 transitions, 118 flow [2021-03-25 14:53:15,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:53:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:53:15,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 758 transitions. [2021-03-25 14:53:15,216 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8613636363636363 [2021-03-25 14:53:15,216 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 758 transitions. [2021-03-25 14:53:15,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 758 transitions. [2021-03-25 14:53:15,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:53:15,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 758 transitions. [2021-03-25 14:53:15,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.6) internal successors, (758), 5 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:15,220 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 14:53:15,221 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 14:53:15,221 INFO L185 Difference]: Start difference. First operand has 32 places, 18 transitions, 66 flow. Second operand 5 states and 758 transitions. [2021-03-25 14:53:15,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 28 transitions, 118 flow [2021-03-25 14:53:15,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 28 transitions, 106 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-25 14:53:15,224 INFO L241 Difference]: Finished difference. Result has 35 places, 21 transitions, 90 flow [2021-03-25 14:53:15,224 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=35, PETRI_TRANSITIONS=21} [2021-03-25 14:53:15,225 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -11 predicate places. [2021-03-25 14:53:15,225 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:53:15,225 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 21 transitions, 90 flow [2021-03-25 14:53:15,226 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 21 transitions, 90 flow [2021-03-25 14:53:15,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 21 transitions, 90 flow [2021-03-25 14:53:15,236 INFO L129 PetriNetUnfolder]: 28/71 cut-off events. [2021-03-25 14:53:15,236 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-03-25 14:53:15,237 INFO L84 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 71 events. 28/71 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 251 event pairs, 15 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 186. Up to 42 conditions per place. [2021-03-25 14:53:15,237 INFO L142 LiptonReduction]: Number of co-enabled transitions 88 [2021-03-25 14:53:15,319 INFO L154 LiptonReduction]: Checked pairs total: 54 [2021-03-25 14:53:15,319 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:53:15,320 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 95 [2021-03-25 14:53:15,320 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 90 flow [2021-03-25 14:53:15,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:15,321 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:53:15,321 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:53:15,321 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:53:15,321 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:53:15,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:53:15,321 INFO L82 PathProgramCache]: Analyzing trace with hash 921214990, now seen corresponding path program 1 times [2021-03-25 14:53:15,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:53:15,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167098890] [2021-03-25 14:53:15,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:53:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:53:15,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:15,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:15,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:15,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:15,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:15,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:15,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:15,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:53:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:53:15,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167098890] [2021-03-25 14:53:15,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:53:15,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:53:15,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255063530] [2021-03-25 14:53:15,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:53:15,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:53:15,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:53:15,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:53:15,405 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 176 [2021-03-25 14:53:15,406 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:15,406 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:53:15,406 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 176 [2021-03-25 14:53:15,406 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:53:15,448 INFO L129 PetriNetUnfolder]: 18/57 cut-off events. [2021-03-25 14:53:15,448 INFO L130 PetriNetUnfolder]: For 48/62 co-relation queries the response was YES. [2021-03-25 14:53:15,448 INFO L84 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 57 events. 18/57 cut-off events. For 48/62 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 147 event pairs, 4 based on Foata normal form. 12/67 useless extension candidates. Maximal degree in co-relation 185. Up to 36 conditions per place. [2021-03-25 14:53:15,449 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 5 selfloop transitions, 7 changer transitions 7/31 dead transitions. [2021-03-25 14:53:15,449 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 31 transitions, 186 flow [2021-03-25 14:53:15,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:53:15,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:53:15,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 909 transitions. [2021-03-25 14:53:15,452 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8607954545454546 [2021-03-25 14:53:15,452 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 909 transitions. [2021-03-25 14:53:15,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 909 transitions. [2021-03-25 14:53:15,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:53:15,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 909 transitions. [2021-03-25 14:53:15,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 151.5) internal successors, (909), 6 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:15,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:15,456 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:15,456 INFO L185 Difference]: Start difference. First operand has 33 places, 21 transitions, 90 flow. Second operand 6 states and 909 transitions. [2021-03-25 14:53:15,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 31 transitions, 186 flow [2021-03-25 14:53:15,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 180 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:53:15,458 INFO L241 Difference]: Finished difference. Result has 39 places, 24 transitions, 140 flow [2021-03-25 14:53:15,458 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2021-03-25 14:53:15,458 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -7 predicate places. [2021-03-25 14:53:15,458 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:53:15,458 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 24 transitions, 140 flow [2021-03-25 14:53:15,458 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 24 transitions, 140 flow [2021-03-25 14:53:15,459 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 24 transitions, 140 flow [2021-03-25 14:53:15,465 INFO L129 PetriNetUnfolder]: 13/45 cut-off events. [2021-03-25 14:53:15,466 INFO L130 PetriNetUnfolder]: For 63/65 co-relation queries the response was YES. [2021-03-25 14:53:15,466 INFO L84 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 45 events. 13/45 cut-off events. For 63/65 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 105 event pairs, 3 based on Foata normal form. 2/46 useless extension candidates. Maximal degree in co-relation 153. Up to 24 conditions per place. [2021-03-25 14:53:15,466 INFO L142 LiptonReduction]: Number of co-enabled transitions 84 [2021-03-25 14:53:15,468 INFO L154 LiptonReduction]: Checked pairs total: 72 [2021-03-25 14:53:15,468 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:53:15,468 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-03-25 14:53:15,469 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 140 flow [2021-03-25 14:53:15,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:15,469 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:53:15,469 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:53:15,469 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:53:15,469 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:53:15,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:53:15,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1530039255, now seen corresponding path program 1 times [2021-03-25 14:53:15,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:53:15,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183501374] [2021-03-25 14:53:15,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:53:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:53:15,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:15,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:15,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:15,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:15,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:15,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:15,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:15,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:15,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:15,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:53:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:53:15,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183501374] [2021-03-25 14:53:15,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:53:15,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:53:15,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414867521] [2021-03-25 14:53:15,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:53:15,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:53:15,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:53:15,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:53:15,576 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 176 [2021-03-25 14:53:15,576 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:15,576 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:53:15,576 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 176 [2021-03-25 14:53:15,576 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:53:15,626 INFO L129 PetriNetUnfolder]: 7/33 cut-off events. [2021-03-25 14:53:15,627 INFO L130 PetriNetUnfolder]: For 67/83 co-relation queries the response was YES. [2021-03-25 14:53:15,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 33 events. 7/33 cut-off events. For 67/83 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 12/44 useless extension candidates. Maximal degree in co-relation 127. Up to 20 conditions per place. [2021-03-25 14:53:15,627 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 2 selfloop transitions, 10 changer transitions 4/28 dead transitions. [2021-03-25 14:53:15,627 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 28 transitions, 208 flow [2021-03-25 14:53:15,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:53:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:53:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1054 transitions. [2021-03-25 14:53:15,630 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8555194805194806 [2021-03-25 14:53:15,630 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1054 transitions. [2021-03-25 14:53:15,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1054 transitions. [2021-03-25 14:53:15,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:53:15,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1054 transitions. [2021-03-25 14:53:15,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 150.57142857142858) internal successors, (1054), 7 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:15,636 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 14:53:15,637 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 14:53:15,637 INFO L185 Difference]: Start difference. First operand has 37 places, 24 transitions, 140 flow. Second operand 7 states and 1054 transitions. [2021-03-25 14:53:15,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 28 transitions, 208 flow [2021-03-25 14:53:15,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 28 transitions, 162 flow, removed 17 selfloop flow, removed 6 redundant places. [2021-03-25 14:53:15,639 INFO L241 Difference]: Finished difference. Result has 40 places, 24 transitions, 132 flow [2021-03-25 14:53:15,639 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=132, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2021-03-25 14:53:15,640 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -6 predicate places. [2021-03-25 14:53:15,640 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:53:15,640 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 24 transitions, 132 flow [2021-03-25 14:53:15,640 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 24 transitions, 132 flow [2021-03-25 14:53:15,640 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 24 transitions, 132 flow [2021-03-25 14:53:15,644 INFO L129 PetriNetUnfolder]: 5/27 cut-off events. [2021-03-25 14:53:15,644 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-03-25 14:53:15,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 27 events. 5/27 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 73. Up to 11 conditions per place. [2021-03-25 14:53:15,645 INFO L142 LiptonReduction]: Number of co-enabled transitions 58 [2021-03-25 14:53:16,326 WARN L205 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 14:53:16,951 WARN L205 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 175 [2021-03-25 14:53:18,262 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 14:53:18,850 WARN L205 SmtUtils]: Spent 586.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 14:53:19,153 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:53:19,276 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:53:19,455 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-03-25 14:53:19,687 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2021-03-25 14:53:19,833 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2021-03-25 14:53:19,887 INFO L154 LiptonReduction]: Checked pairs total: 193 [2021-03-25 14:53:19,887 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:53:19,887 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4247 [2021-03-25 14:53:19,888 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 126 flow [2021-03-25 14:53:19,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:19,888 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:53:19,888 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 14:53:19,888 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:53:19,889 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:53:19,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:53:19,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1566967193, now seen corresponding path program 1 times [2021-03-25 14:53:19,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:53:19,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480829747] [2021-03-25 14:53:19,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:53:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:53:19,959 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.8 percent of original size [2021-03-25 14:53:19,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 14:53:19,976 INFO L142 QuantifierPusher]: treesize reduction 5, result has 88.6 percent of original size [2021-03-25 14:53:19,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 14:53:20,003 INFO L142 QuantifierPusher]: treesize reduction 9, result has 62.5 percent of original size [2021-03-25 14:53:20,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 14:53:20,016 INFO L142 QuantifierPusher]: treesize reduction 17, result has 70.2 percent of original size [2021-03-25 14:53:20,017 INFO L147 QuantifierPusher]: treesize reduction 9, result has 77.5 percent of original size 31 [2021-03-25 14:53:20,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:20,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:53:20,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480829747] [2021-03-25 14:53:20,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:53:20,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:53:20,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849060583] [2021-03-25 14:53:20,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:53:20,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:53:20,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:53:20,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:53:20,046 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 179 [2021-03-25 14:53:20,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 126 flow. Second operand has 7 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:20,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:53:20,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 179 [2021-03-25 14:53:20,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:53:20,158 INFO L129 PetriNetUnfolder]: 20/65 cut-off events. [2021-03-25 14:53:20,158 INFO L130 PetriNetUnfolder]: For 172/186 co-relation queries the response was YES. [2021-03-25 14:53:20,158 INFO L84 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 65 events. 20/65 cut-off events. For 172/186 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 217 event pairs, 0 based on Foata normal form. 7/69 useless extension candidates. Maximal degree in co-relation 213. Up to 33 conditions per place. [2021-03-25 14:53:20,159 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 5 selfloop transitions, 5 changer transitions 2/27 dead transitions. [2021-03-25 14:53:20,159 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 27 transitions, 162 flow [2021-03-25 14:53:20,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:53:20,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:53:20,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 938 transitions. [2021-03-25 14:53:20,162 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7486033519553073 [2021-03-25 14:53:20,162 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 938 transitions. [2021-03-25 14:53:20,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 938 transitions. [2021-03-25 14:53:20,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:53:20,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 938 transitions. [2021-03-25 14:53:20,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.0) internal successors, (938), 7 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:20,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:20,168 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:20,168 INFO L185 Difference]: Start difference. First operand has 35 places, 21 transitions, 126 flow. Second operand 7 states and 938 transitions. [2021-03-25 14:53:20,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 27 transitions, 162 flow [2021-03-25 14:53:20,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 27 transitions, 124 flow, removed 12 selfloop flow, removed 6 redundant places. [2021-03-25 14:53:20,170 INFO L241 Difference]: Finished difference. Result has 39 places, 24 transitions, 123 flow [2021-03-25 14:53:20,171 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=123, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2021-03-25 14:53:20,171 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -7 predicate places. [2021-03-25 14:53:20,171 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:53:20,171 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 24 transitions, 123 flow [2021-03-25 14:53:20,171 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 24 transitions, 123 flow [2021-03-25 14:53:20,172 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 24 transitions, 123 flow [2021-03-25 14:53:20,176 INFO L129 PetriNetUnfolder]: 12/43 cut-off events. [2021-03-25 14:53:20,177 INFO L130 PetriNetUnfolder]: For 35/36 co-relation queries the response was YES. [2021-03-25 14:53:20,177 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 43 events. 12/43 cut-off events. For 35/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 107 event pairs, 0 based on Foata normal form. 1/42 useless extension candidates. Maximal degree in co-relation 114. Up to 16 conditions per place. [2021-03-25 14:53:20,177 INFO L142 LiptonReduction]: Number of co-enabled transitions 50 [2021-03-25 14:53:20,432 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2021-03-25 14:53:20,838 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 90 [2021-03-25 14:53:20,966 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-03-25 14:53:20,969 INFO L154 LiptonReduction]: Checked pairs total: 2 [2021-03-25 14:53:20,969 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:53:20,969 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 798 [2021-03-25 14:53:20,970 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 125 flow [2021-03-25 14:53:20,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:20,970 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:53:20,970 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:53:20,970 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:53:20,971 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:53:20,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:53:20,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1547784777, now seen corresponding path program 1 times [2021-03-25 14:53:20,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:53:20,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808301043] [2021-03-25 14:53:20,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:53:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:53:21,081 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-25 14:53:21,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 14:53:21,113 INFO L142 QuantifierPusher]: treesize reduction 15, result has 86.4 percent of original size [2021-03-25 14:53:21,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 95 [2021-03-25 14:53:21,157 INFO L142 QuantifierPusher]: treesize reduction 19, result has 84.7 percent of original size [2021-03-25 14:53:21,162 INFO L147 QuantifierPusher]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-03-25 14:53:21,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:21,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:53:21,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:21,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:21,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:53:21,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808301043] [2021-03-25 14:53:21,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:53:21,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:53:21,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965107244] [2021-03-25 14:53:21,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:53:21,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:53:21,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:53:21,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:53:21,215 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 180 [2021-03-25 14:53:21,216 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 125 flow. Second operand has 7 states, 7 states have (on average 127.85714285714286) internal successors, (895), 7 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:21,216 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:53:21,216 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 180 [2021-03-25 14:53:21,216 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:53:21,312 INFO L129 PetriNetUnfolder]: 14/51 cut-off events. [2021-03-25 14:53:21,312 INFO L130 PetriNetUnfolder]: For 109/118 co-relation queries the response was YES. [2021-03-25 14:53:21,312 INFO L84 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 51 events. 14/51 cut-off events. For 109/118 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 153 event pairs, 1 based on Foata normal form. 10/61 useless extension candidates. Maximal degree in co-relation 151. Up to 18 conditions per place. [2021-03-25 14:53:21,312 INFO L132 encePairwiseOnDemand]: 175/180 looper letters, 4 selfloop transitions, 3 changer transitions 3/25 dead transitions. [2021-03-25 14:53:21,312 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 25 transitions, 151 flow [2021-03-25 14:53:21,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:53:21,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:53:21,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 772 transitions. [2021-03-25 14:53:21,315 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7148148148148148 [2021-03-25 14:53:21,315 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 772 transitions. [2021-03-25 14:53:21,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 772 transitions. [2021-03-25 14:53:21,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:53:21,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 772 transitions. [2021-03-25 14:53:21,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:21,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:21,319 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:21,319 INFO L185 Difference]: Start difference. First operand has 37 places, 24 transitions, 125 flow. Second operand 6 states and 772 transitions. [2021-03-25 14:53:21,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 25 transitions, 151 flow [2021-03-25 14:53:21,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 25 transitions, 140 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-25 14:53:21,320 INFO L241 Difference]: Finished difference. Result has 40 places, 21 transitions, 106 flow [2021-03-25 14:53:21,321 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=106, PETRI_PLACES=40, PETRI_TRANSITIONS=21} [2021-03-25 14:53:21,321 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -6 predicate places. [2021-03-25 14:53:21,321 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:53:21,321 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 21 transitions, 106 flow [2021-03-25 14:53:21,321 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 21 transitions, 106 flow [2021-03-25 14:53:21,321 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 21 transitions, 106 flow [2021-03-25 14:53:21,325 INFO L129 PetriNetUnfolder]: 5/24 cut-off events. [2021-03-25 14:53:21,325 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-03-25 14:53:21,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 24 events. 5/24 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 60. Up to 8 conditions per place. [2021-03-25 14:53:21,326 INFO L142 LiptonReduction]: Number of co-enabled transitions 26 [2021-03-25 14:53:21,408 INFO L154 LiptonReduction]: Checked pairs total: 28 [2021-03-25 14:53:21,409 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:53:21,409 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 88 [2021-03-25 14:53:21,409 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 21 transitions, 106 flow [2021-03-25 14:53:21,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 127.85714285714286) internal successors, (895), 7 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:21,410 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:53:21,410 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:53:21,410 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:53:21,410 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:53:21,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:53:21,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1493562809, now seen corresponding path program 2 times [2021-03-25 14:53:21,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:53:21,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399776725] [2021-03-25 14:53:21,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:53:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:53:21,455 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:53:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:53:21,495 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:53:21,539 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:53:21,539 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:53:21,540 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:53:21,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:53:21 BasicIcfg [2021-03-25 14:53:21,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:53:21,617 INFO L168 Benchmark]: Toolchain (without parser) took 15587.96 ms. Allocated memory was 343.9 MB in the beginning and 536.9 MB in the end (delta: 192.9 MB). Free memory was 307.2 MB in the beginning and 281.7 MB in the end (delta: 25.4 MB). Peak memory consumption was 219.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:53:21,617 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 343.9 MB. Free memory was 325.4 MB in the beginning and 325.3 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:53:21,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 488.65 ms. Allocated memory is still 343.9 MB. Free memory was 307.0 MB in the beginning and 304.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:53:21,618 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.45 ms. Allocated memory is still 343.9 MB. Free memory was 303.4 MB in the beginning and 301.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:53:21,618 INFO L168 Benchmark]: Boogie Preprocessor took 40.03 ms. Allocated memory is still 343.9 MB. Free memory was 301.3 MB in the beginning and 299.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:53:21,618 INFO L168 Benchmark]: RCFGBuilder took 1767.49 ms. Allocated memory is still 343.9 MB. Free memory was 299.2 MB in the beginning and 266.5 MB in the end (delta: 32.8 MB). Peak memory consumption was 158.6 MB. Max. memory is 16.0 GB. [2021-03-25 14:53:21,618 INFO L168 Benchmark]: TraceAbstraction took 13235.31 ms. Allocated memory was 343.9 MB in the beginning and 536.9 MB in the end (delta: 192.9 MB). Free memory was 265.4 MB in the beginning and 281.7 MB in the end (delta: -16.3 MB). Peak memory consumption was 176.6 MB. Max. memory is 16.0 GB. [2021-03-25 14:53:21,619 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.13 ms. Allocated memory is still 343.9 MB. Free memory was 325.4 MB in the beginning and 325.3 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 488.65 ms. Allocated memory is still 343.9 MB. Free memory was 307.0 MB in the beginning and 304.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 51.45 ms. Allocated memory is still 343.9 MB. Free memory was 303.4 MB in the beginning and 301.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 40.03 ms. Allocated memory is still 343.9 MB. Free memory was 301.3 MB in the beginning and 299.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1767.49 ms. Allocated memory is still 343.9 MB. Free memory was 299.2 MB in the beginning and 266.5 MB in the end (delta: 32.8 MB). Peak memory consumption was 158.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 13235.31 ms. Allocated memory was 343.9 MB in the beginning and 536.9 MB in the end (delta: 192.9 MB). Free memory was 265.4 MB in the beginning and 281.7 MB in the end (delta: -16.3 MB). Peak memory consumption was 176.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2967.3ms, 103 PlacesBefore, 46 PlacesAfterwards, 95 TransitionsBefore, 37 TransitionsAfterwards, 1586 CoEnabledTransitionPairs, 4 FixpointIterations, 29 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 64 TotalNumberOfCompositions, 2392 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1417, positive: 1361, positive conditional: 0, positive unconditional: 1361, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1036, positive: 1002, positive conditional: 0, positive unconditional: 1002, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1036, positive: 1002, positive conditional: 0, positive unconditional: 1002, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1036, positive: 998, positive conditional: 0, positive unconditional: 998, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 38, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 471, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 458, negative conditional: 0, negative unconditional: 458, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1417, positive: 359, positive conditional: 0, positive unconditional: 359, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 1036, unknown conditional: 0, unknown unconditional: 1036] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 165, Positive conditional cache size: 0, Positive unconditional cache size: 165, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1218.2ms, 43 PlacesBefore, 33 PlacesAfterwards, 34 TransitionsBefore, 24 TransitionsAfterwards, 318 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 1163 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 592, positive: 515, positive conditional: 0, positive unconditional: 515, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, positive: 67, positive conditional: 0, positive unconditional: 67, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 77, positive: 67, positive conditional: 0, positive unconditional: 67, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 77, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 165, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 158, negative conditional: 0, negative unconditional: 158, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 592, positive: 448, positive conditional: 0, positive unconditional: 448, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 77, unknown conditional: 0, unknown unconditional: 77] , Statistics on independence cache: Total cache size (in pairs): 182, Positive cache size: 159, Positive conditional cache size: 0, Positive unconditional cache size: 159, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 992.3ms, 36 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 420 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 174, positive: 138, positive conditional: 0, positive unconditional: 138, negative: 36, negative conditional: 0, negative unconditional: 36, 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: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 174, positive: 138, positive conditional: 0, positive unconditional: 138, 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): 184, Positive cache size: 159, Positive conditional cache size: 0, Positive unconditional cache size: 159, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.0ms, 35 PlacesBefore, 35 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 208 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 97, positive: 83, positive conditional: 0, positive unconditional: 83, 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: 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: 97, positive: 77, positive conditional: 0, positive unconditional: 77, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 165, Positive conditional cache size: 0, Positive unconditional cache size: 165, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.9ms, 37 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 208 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 103, positive: 89, positive conditional: 0, positive unconditional: 89, 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: 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: 103, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 165, Positive conditional cache size: 0, Positive unconditional cache size: 165, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 35.6ms, 40 PlacesBefore, 37 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 263 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 125, positive: 101, positive conditional: 0, positive unconditional: 101, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 4, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 4, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 125, positive: 99, positive conditional: 0, positive unconditional: 99, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 139, Positive conditional cache size: 0, Positive unconditional cache size: 139, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 200.5ms, 33 PlacesBefore, 32 PlacesAfterwards, 19 TransitionsBefore, 18 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 168 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 56, positive: 38, positive conditional: 0, positive unconditional: 38, 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: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 28, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 108, Positive conditional cache size: 0, Positive unconditional cache size: 108, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 93.8ms, 35 PlacesBefore, 33 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 54 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 80, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 109, Positive conditional cache size: 0, Positive unconditional cache size: 109, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.5ms, 39 PlacesBefore, 37 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 72 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 18, positive: 11, positive conditional: 0, positive unconditional: 11, 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): 128, Positive cache size: 109, Positive conditional cache size: 0, Positive unconditional cache size: 109, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4247.2ms, 40 PlacesBefore, 35 PlacesAfterwards, 24 TransitionsBefore, 21 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 193 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 130, positive: 106, positive conditional: 0, positive unconditional: 106, 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: 6, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 122, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 122, negative conditional: 0, negative unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 130, positive: 104, positive conditional: 0, positive unconditional: 104, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 797.9ms, 39 PlacesBefore, 37 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 2 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 87.4ms, 40 PlacesBefore, 38 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 26 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 28 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 25, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 80, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - 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_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2055; [L832] FCALL, FORK 0 pthread_create(&t2055, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_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, z=0] [L833] 0 pthread_t t2056; [L834] FCALL, FORK 0 pthread_create(&t2056, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_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, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L835] 0 pthread_t t2057; [L836] FCALL, FORK 0 pthread_create(&t2057, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 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) [L809] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L809] 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) [L809] 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) [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 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 [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L813] 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 [L746] 1 __unbuffered_p0_EAX = z [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 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) [L753] 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) [L754] 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)) [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 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L754] 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)) [L754] 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)) [L755] 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)) [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 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L755] 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)) [L755] 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)) [L756] 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)) [L756] 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) [L756] 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)) [L756] 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)) [L757] 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)) [L757] 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) [L757] 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)) [L757] 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)) [L758] 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)) [L758] 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) [L758] 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)) [L758] 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)) [L759] 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)) [L759] 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) [L759] 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)) [L759] 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)) [L760] 1 __unbuffered_p0_EBX = x [L761] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] 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) [L789] 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) [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 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 [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 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 [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L842] 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) [L842] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L842] 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) [L842] 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) [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 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 [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L846] 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 [L849] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 13017.8ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 732.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3060.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 38 SDtfs, 30 SDslu, 23 SDs, 0 SdLazy, 199 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 217.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 358.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=8, InterpolantAutomatonStates: 55, 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: 37.1ms SsaConstructionTime, 370.4ms SatisfiabilityAnalysisTime, 814.2ms InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 923 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...