/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/safe031_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 15:02:20,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 15:02:20,543 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 15:02:20,565 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 15:02:20,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 15:02:20,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 15:02:20,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 15:02:20,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 15:02:20,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 15:02:20,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 15:02:20,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 15:02:20,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 15:02:20,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 15:02:20,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 15:02:20,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 15:02:20,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 15:02:20,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 15:02:20,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 15:02:20,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 15:02:20,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 15:02:20,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 15:02:20,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 15:02:20,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 15:02:20,600 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 15:02:20,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 15:02:20,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 15:02:20,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 15:02:20,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 15:02:20,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 15:02:20,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 15:02:20,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 15:02:20,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 15:02:20,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 15:02:20,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 15:02:20,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 15:02:20,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 15:02:20,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 15:02:20,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 15:02:20,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 15:02:20,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 15:02:20,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 15:02:20,619 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-03-25 15:02:20,649 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 15:02:20,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 15:02:20,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 15:02:20,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 15:02:20,653 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 15:02:20,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 15:02:20,653 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 15:02:20,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 15:02:20,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 15:02:20,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 15:02:20,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 15:02:20,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 15:02:20,655 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 15:02:20,655 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 15:02:20,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 15:02:20,655 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 15:02:20,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 15:02:20,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 15:02:20,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 15:02:20,656 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 15:02:20,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 15:02:20,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 15:02:20,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 15:02:20,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 15:02:20,657 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 15:02:20,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 15:02:20,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 15:02:20,657 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 15:02:20,657 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 15:02:20,657 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 15:02:20,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 15:02:20,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 15:02:20,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 15:02:20,981 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 15:02:20,982 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 15:02:20,983 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.oepc.i [2021-03-25 15:02:21,048 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e34427a2d/380b4b8b019c4501a1cb6b481be30a1b/FLAG66c9cbf8d [2021-03-25 15:02:21,541 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 15:02:21,541 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_rmo.oepc.i [2021-03-25 15:02:21,568 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e34427a2d/380b4b8b019c4501a1cb6b481be30a1b/FLAG66c9cbf8d [2021-03-25 15:02:21,854 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e34427a2d/380b4b8b019c4501a1cb6b481be30a1b [2021-03-25 15:02:21,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 15:02:21,857 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 15:02:21,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 15:02:21,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 15:02:21,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 15:02:21,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 03:02:21" (1/1) ... [2021-03-25 15:02:21,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@177be27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:21, skipping insertion in model container [2021-03-25 15:02:21,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 03:02:21" (1/1) ... [2021-03-25 15:02:21,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 15:02:21,900 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 15:02:22,040 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/safe031_rmo.oepc.i[993,1006] [2021-03-25 15:02:22,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 15:02:22,221 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 15:02:22,229 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/safe031_rmo.oepc.i[993,1006] [2021-03-25 15:02:22,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 15:02:22,356 INFO L208 MainTranslator]: Completed translation [2021-03-25 15:02:22,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:22 WrapperNode [2021-03-25 15:02:22,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 15:02:22,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 15:02:22,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 15:02:22,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 15:02:22,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:22" (1/1) ... [2021-03-25 15:02:22,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:22" (1/1) ... [2021-03-25 15:02:22,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 15:02:22,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 15:02:22,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 15:02:22,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 15:02:22,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:22" (1/1) ... [2021-03-25 15:02:22,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:22" (1/1) ... [2021-03-25 15:02:22,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:22" (1/1) ... [2021-03-25 15:02:22,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:22" (1/1) ... [2021-03-25 15:02:22,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:22" (1/1) ... [2021-03-25 15:02:22,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:22" (1/1) ... [2021-03-25 15:02:22,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:22" (1/1) ... [2021-03-25 15:02:22,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 15:02:22,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 15:02:22,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 15:02:22,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 15:02:22,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 15:02:22,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 15:02:22,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 15:02:22,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 15:02:22,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 15:02:22,497 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 15:02:22,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 15:02:22,498 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 15:02:22,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 15:02:22,499 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 15:02:22,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 15:02:22,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 15:02:22,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 15:02:22,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 15:02:22,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 15:02:22,501 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 15:02:24,082 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 15:02:24,082 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 15:02:24,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 03:02:24 BoogieIcfgContainer [2021-03-25 15:02:24,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 15:02:24,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 15:02:24,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 15:02:24,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 15:02:24,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 03:02:21" (1/3) ... [2021-03-25 15:02:24,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e99972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 03:02:24, skipping insertion in model container [2021-03-25 15:02:24,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:02:22" (2/3) ... [2021-03-25 15:02:24,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e99972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 03:02:24, skipping insertion in model container [2021-03-25 15:02:24,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 03:02:24" (3/3) ... [2021-03-25 15:02:24,091 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_rmo.oepc.i [2021-03-25 15:02:24,095 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 15:02:24,100 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 15:02:24,101 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 15:02:24,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,143 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,143 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,144 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,144 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,150 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,151 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,151 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,151 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,156 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,161 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,161 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,161 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,161 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,161 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,161 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,161 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,162 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,162 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,163 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,165 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,166 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,171 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,171 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,171 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,171 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,173 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,173 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,173 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,173 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,173 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,175 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,175 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,175 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,175 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,180 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,180 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,180 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,183 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,184 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,186 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,186 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,187 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,187 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,187 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,187 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,187 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,187 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,187 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,187 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,187 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,188 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,188 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,188 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,188 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,188 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,188 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,189 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,189 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,189 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:02:24,190 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 15:02:24,240 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 15:02:24,257 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 15:02:24,257 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 15:02:24,258 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 15:02:24,258 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 15:02:24,258 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 15:02:24,258 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 15:02:24,258 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 15:02:24,258 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 15:02:24,268 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2021-03-25 15:02:24,299 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-03-25 15:02:24,299 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:02:24,304 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-25 15:02:24,304 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 96 transitions, 207 flow [2021-03-25 15:02:24,308 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 93 transitions, 195 flow [2021-03-25 15:02:24,309 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:02:24,320 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 195 flow [2021-03-25 15:02:24,323 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 195 flow [2021-03-25 15:02:24,324 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 195 flow [2021-03-25 15:02:24,342 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-03-25 15:02:24,342 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:02:24,342 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-25 15:02:24,345 INFO L142 LiptonReduction]: Number of co-enabled transitions 1586 [2021-03-25 15:02:25,273 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 15:02:25,710 WARN L205 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 15:02:25,853 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 15:02:27,177 INFO L154 LiptonReduction]: Checked pairs total: 2266 [2021-03-25 15:02:27,177 INFO L156 LiptonReduction]: Total number of compositions: 61 [2021-03-25 15:02:27,179 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2871 [2021-03-25 15:02:27,189 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-03-25 15:02:27,189 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:02:27,191 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:02:27,192 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:02:27,192 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:02:27,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:02:27,196 INFO L82 PathProgramCache]: Analyzing trace with hash 463855959, now seen corresponding path program 1 times [2021-03-25 15:02:27,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:02:27,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029615423] [2021-03-25 15:02:27,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:02:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:02:27,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:27,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:02:27,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:27,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:02:27,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:02:27,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029615423] [2021-03-25 15:02:27,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:02:27,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 15:02:27,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137657094] [2021-03-25 15:02:27,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 15:02:27,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:02:27,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 15:02:27,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 15:02:27,398 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 157 [2021-03-25 15:02:27,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:27,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:02:27,401 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 157 [2021-03-25 15:02:27,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:02:27,457 INFO L129 PetriNetUnfolder]: 29/140 cut-off events. [2021-03-25 15:02:27,457 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:02:27,458 INFO L84 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 140 events. 29/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 583 event pairs, 15 based on Foata normal form. 9/133 useless extension candidates. Maximal degree in co-relation 185. Up to 41 conditions per place. [2021-03-25 15:02:27,459 INFO L132 encePairwiseOnDemand]: 153/157 looper letters, 7 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2021-03-25 15:02:27,460 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 38 transitions, 103 flow [2021-03-25 15:02:27,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 15:02:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 15:02:27,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2021-03-25 15:02:27,471 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9044585987261147 [2021-03-25 15:02:27,472 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2021-03-25 15:02:27,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2021-03-25 15:02:27,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:02:27,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2021-03-25 15:02:27,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:27,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:27,485 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:27,487 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 426 transitions. [2021-03-25 15:02:27,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 38 transitions, 103 flow [2021-03-25 15:02:27,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 15:02:27,491 INFO L241 Difference]: Finished difference. Result has 44 places, 35 transitions, 80 flow [2021-03-25 15:02:27,492 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2021-03-25 15:02:27,493 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-25 15:02:27,493 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:02:27,493 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 80 flow [2021-03-25 15:02:27,494 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 80 flow [2021-03-25 15:02:27,494 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 80 flow [2021-03-25 15:02:27,498 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-03-25 15:02:27,498 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:02:27,498 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 15:02:27,499 INFO L142 LiptonReduction]: Number of co-enabled transitions 318 [2021-03-25 15:02:27,635 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2021-03-25 15:02:29,080 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-25 15:02:29,222 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 15:02:29,507 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-25 15:02:29,637 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 15:02:29,641 INFO L154 LiptonReduction]: Checked pairs total: 1464 [2021-03-25 15:02:29,642 INFO L156 LiptonReduction]: Total number of compositions: 13 [2021-03-25 15:02:29,642 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2149 [2021-03-25 15:02:29,643 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-03-25 15:02:29,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:29,643 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:02:29,643 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:02:29,644 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 15:02:29,644 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:02:29,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:02:29,644 INFO L82 PathProgramCache]: Analyzing trace with hash 859757403, now seen corresponding path program 1 times [2021-03-25 15:02:29,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:02:29,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003516536] [2021-03-25 15:02:29,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:02:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:02:29,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:29,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:02:29,776 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-03-25 15:02:29,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 15:02:29,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:29,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:02:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:02:29,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003516536] [2021-03-25 15:02:29,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:02:29,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 15:02:29,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60491977] [2021-03-25 15:02:29,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 15:02:29,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:02:29,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 15:02:29,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 15:02:29,799 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 170 [2021-03-25 15:02:29,800 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:29,800 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:02:29,800 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 170 [2021-03-25 15:02:29,800 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:02:29,911 INFO L129 PetriNetUnfolder]: 101/273 cut-off events. [2021-03-25 15:02:29,911 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:02:29,913 INFO L84 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 273 events. 101/273 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1572 event pairs, 16 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 460. Up to 61 conditions per place. [2021-03-25 15:02:29,915 INFO L132 encePairwiseOnDemand]: 162/170 looper letters, 6 selfloop transitions, 6 changer transitions 13/39 dead transitions. [2021-03-25 15:02:29,915 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 136 flow [2021-03-25 15:02:29,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 15:02:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 15:02:29,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 690 transitions. [2021-03-25 15:02:29,920 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8117647058823529 [2021-03-25 15:02:29,920 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 690 transitions. [2021-03-25 15:02:29,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 690 transitions. [2021-03-25 15:02:29,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:02:29,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 690 transitions. [2021-03-25 15:02:29,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:29,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:29,926 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:29,926 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states and 690 transitions. [2021-03-25 15:02:29,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 136 flow [2021-03-25 15:02:29,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 15:02:29,928 INFO L241 Difference]: Finished difference. Result has 38 places, 26 transitions, 104 flow [2021-03-25 15:02:29,928 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2021-03-25 15:02:29,928 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -9 predicate places. [2021-03-25 15:02:29,929 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:02:29,929 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 26 transitions, 104 flow [2021-03-25 15:02:29,929 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 26 transitions, 104 flow [2021-03-25 15:02:29,930 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 104 flow [2021-03-25 15:02:29,952 INFO L129 PetriNetUnfolder]: 48/167 cut-off events. [2021-03-25 15:02:29,952 INFO L130 PetriNetUnfolder]: For 49/51 co-relation queries the response was YES. [2021-03-25 15:02:29,952 INFO L84 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 167 events. 48/167 cut-off events. For 49/51 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 906 event pairs, 18 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 353. Up to 61 conditions per place. [2021-03-25 15:02:29,954 INFO L142 LiptonReduction]: Number of co-enabled transitions 256 [2021-03-25 15:02:30,049 INFO L154 LiptonReduction]: Checked pairs total: 174 [2021-03-25 15:02:30,050 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:02:30,050 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 121 [2021-03-25 15:02:30,051 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 104 flow [2021-03-25 15:02:30,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:30,052 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:02:30,052 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:02:30,052 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 15:02:30,052 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:02:30,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:02:30,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1523801107, now seen corresponding path program 1 times [2021-03-25 15:02:30,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:02:30,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938748577] [2021-03-25 15:02:30,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:02:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:02:30,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:30,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:02:30,156 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-03-25 15:02:30,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 15:02:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:02:30,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938748577] [2021-03-25 15:02:30,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:02:30,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 15:02:30,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987215304] [2021-03-25 15:02:30,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 15:02:30,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:02:30,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 15:02:30,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 15:02:30,165 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 170 [2021-03-25 15:02:30,166 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:30,166 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:02:30,166 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 170 [2021-03-25 15:02:30,166 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:02:30,198 INFO L129 PetriNetUnfolder]: 42/147 cut-off events. [2021-03-25 15:02:30,198 INFO L130 PetriNetUnfolder]: For 70/146 co-relation queries the response was YES. [2021-03-25 15:02:30,198 INFO L84 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 147 events. 42/147 cut-off events. For 70/146 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 731 event pairs, 4 based on Foata normal form. 3/144 useless extension candidates. Maximal degree in co-relation 404. Up to 53 conditions per place. [2021-03-25 15:02:30,199 INFO L132 encePairwiseOnDemand]: 163/170 looper letters, 8 selfloop transitions, 10 changer transitions 0/32 dead transitions. [2021-03-25 15:02:30,199 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 176 flow [2021-03-25 15:02:30,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 15:02:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 15:02:30,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2021-03-25 15:02:30,201 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.836764705882353 [2021-03-25 15:02:30,201 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 569 transitions. [2021-03-25 15:02:30,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 569 transitions. [2021-03-25 15:02:30,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:02:30,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 569 transitions. [2021-03-25 15:02:30,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:30,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:30,205 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:30,205 INFO L185 Difference]: Start difference. First operand has 34 places, 26 transitions, 104 flow. Second operand 4 states and 569 transitions. [2021-03-25 15:02:30,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 176 flow [2021-03-25 15:02:30,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 142 flow, removed 8 selfloop flow, removed 4 redundant places. [2021-03-25 15:02:30,208 INFO L241 Difference]: Finished difference. Result has 35 places, 31 transitions, 142 flow [2021-03-25 15:02:30,208 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2021-03-25 15:02:30,208 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -12 predicate places. [2021-03-25 15:02:30,209 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:02:30,209 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 31 transitions, 142 flow [2021-03-25 15:02:30,209 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 31 transitions, 142 flow [2021-03-25 15:02:30,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 142 flow [2021-03-25 15:02:30,225 INFO L129 PetriNetUnfolder]: 42/152 cut-off events. [2021-03-25 15:02:30,225 INFO L130 PetriNetUnfolder]: For 86/103 co-relation queries the response was YES. [2021-03-25 15:02:30,226 INFO L84 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 152 events. 42/152 cut-off events. For 86/103 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 801 event pairs, 13 based on Foata normal form. 1/149 useless extension candidates. Maximal degree in co-relation 334. Up to 53 conditions per place. [2021-03-25 15:02:30,227 INFO L142 LiptonReduction]: Number of co-enabled transitions 296 [2021-03-25 15:02:30,233 INFO L154 LiptonReduction]: Checked pairs total: 255 [2021-03-25 15:02:30,233 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:02:30,233 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24 [2021-03-25 15:02:30,234 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 142 flow [2021-03-25 15:02:30,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:30,234 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:02:30,235 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:02:30,235 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 15:02:30,235 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:02:30,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:02:30,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1523801789, now seen corresponding path program 1 times [2021-03-25 15:02:30,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:02:30,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127182443] [2021-03-25 15:02:30,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:02:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:02:30,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:30,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:02:30,278 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-03-25 15:02:30,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 15:02:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:02:30,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127182443] [2021-03-25 15:02:30,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:02:30,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 15:02:30,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529107047] [2021-03-25 15:02:30,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 15:02:30,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:02:30,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 15:02:30,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 15:02:30,288 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 170 [2021-03-25 15:02:30,289 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:30,289 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:02:30,289 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 170 [2021-03-25 15:02:30,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:02:30,337 INFO L129 PetriNetUnfolder]: 35/133 cut-off events. [2021-03-25 15:02:30,337 INFO L130 PetriNetUnfolder]: For 102/220 co-relation queries the response was YES. [2021-03-25 15:02:30,338 INFO L84 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 133 events. 35/133 cut-off events. For 102/220 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 645 event pairs, 6 based on Foata normal form. 10/138 useless extension candidates. Maximal degree in co-relation 368. Up to 46 conditions per place. [2021-03-25 15:02:30,339 INFO L132 encePairwiseOnDemand]: 163/170 looper letters, 10 selfloop transitions, 12 changer transitions 0/36 dead transitions. [2021-03-25 15:02:30,339 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 36 transitions, 218 flow [2021-03-25 15:02:30,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 15:02:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 15:02:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 568 transitions. [2021-03-25 15:02:30,341 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8352941176470589 [2021-03-25 15:02:30,341 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 568 transitions. [2021-03-25 15:02:30,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 568 transitions. [2021-03-25 15:02:30,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:02:30,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 568 transitions. [2021-03-25 15:02:30,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:30,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:30,344 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:30,345 INFO L185 Difference]: Start difference. First operand has 35 places, 31 transitions, 142 flow. Second operand 4 states and 568 transitions. [2021-03-25 15:02:30,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 36 transitions, 218 flow [2021-03-25 15:02:30,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 15:02:30,348 INFO L241 Difference]: Finished difference. Result has 41 places, 36 transitions, 230 flow [2021-03-25 15:02:30,349 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2021-03-25 15:02:30,349 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -6 predicate places. [2021-03-25 15:02:30,349 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:02:30,349 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 36 transitions, 230 flow [2021-03-25 15:02:30,349 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 36 transitions, 230 flow [2021-03-25 15:02:30,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 230 flow [2021-03-25 15:02:30,365 INFO L129 PetriNetUnfolder]: 35/133 cut-off events. [2021-03-25 15:02:30,365 INFO L130 PetriNetUnfolder]: For 215/235 co-relation queries the response was YES. [2021-03-25 15:02:30,366 INFO L84 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 133 events. 35/133 cut-off events. For 215/235 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 662 event pairs, 5 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 381. Up to 46 conditions per place. [2021-03-25 15:02:30,367 INFO L142 LiptonReduction]: Number of co-enabled transitions 344 [2021-03-25 15:02:30,371 INFO L154 LiptonReduction]: Checked pairs total: 305 [2021-03-25 15:02:30,371 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:02:30,371 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-03-25 15:02:30,372 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 230 flow [2021-03-25 15:02:30,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:30,372 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:02:30,372 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:02:30,372 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 15:02:30,373 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:02:30,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:02:30,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1570406798, now seen corresponding path program 1 times [2021-03-25 15:02:30,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:02:30,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744877946] [2021-03-25 15:02:30,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:02:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:02:30,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:30,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:02:30,443 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 15:02:30,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 15:02:30,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:30,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:02:30,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:02:30,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744877946] [2021-03-25 15:02:30,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:02:30,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 15:02:30,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207177004] [2021-03-25 15:02:30,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 15:02:30,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:02:30,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 15:02:30,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 15:02:30,456 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 170 [2021-03-25 15:02:30,457 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:30,457 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:02:30,457 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 170 [2021-03-25 15:02:30,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:02:30,543 INFO L129 PetriNetUnfolder]: 180/430 cut-off events. [2021-03-25 15:02:30,544 INFO L130 PetriNetUnfolder]: For 260/272 co-relation queries the response was YES. [2021-03-25 15:02:30,546 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1041 conditions, 430 events. 180/430 cut-off events. For 260/272 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 2769 event pairs, 57 based on Foata normal form. 35/388 useless extension candidates. Maximal degree in co-relation 1023. Up to 266 conditions per place. [2021-03-25 15:02:30,549 INFO L132 encePairwiseOnDemand]: 164/170 looper letters, 10 selfloop transitions, 8 changer transitions 0/47 dead transitions. [2021-03-25 15:02:30,549 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 47 transitions, 288 flow [2021-03-25 15:02:30,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 15:02:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 15:02:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 715 transitions. [2021-03-25 15:02:30,553 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8411764705882353 [2021-03-25 15:02:30,553 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 715 transitions. [2021-03-25 15:02:30,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 715 transitions. [2021-03-25 15:02:30,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:02:30,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 715 transitions. [2021-03-25 15:02:30,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:30,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:30,562 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:30,562 INFO L185 Difference]: Start difference. First operand has 41 places, 36 transitions, 230 flow. Second operand 5 states and 715 transitions. [2021-03-25 15:02:30,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 47 transitions, 288 flow [2021-03-25 15:02:30,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 288 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 15:02:30,568 INFO L241 Difference]: Finished difference. Result has 48 places, 43 transitions, 290 flow [2021-03-25 15:02:30,568 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=290, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2021-03-25 15:02:30,569 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 1 predicate places. [2021-03-25 15:02:30,569 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:02:30,569 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 43 transitions, 290 flow [2021-03-25 15:02:30,569 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 43 transitions, 290 flow [2021-03-25 15:02:30,569 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 43 transitions, 290 flow [2021-03-25 15:02:30,626 INFO L129 PetriNetUnfolder]: 134/354 cut-off events. [2021-03-25 15:02:30,626 INFO L130 PetriNetUnfolder]: For 451/495 co-relation queries the response was YES. [2021-03-25 15:02:30,628 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 354 events. 134/354 cut-off events. For 451/495 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2243 event pairs, 40 based on Foata normal form. 10/342 useless extension candidates. Maximal degree in co-relation 1081. Up to 185 conditions per place. [2021-03-25 15:02:30,631 INFO L142 LiptonReduction]: Number of co-enabled transitions 480 [2021-03-25 15:02:30,643 INFO L154 LiptonReduction]: Checked pairs total: 655 [2021-03-25 15:02:30,644 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 15:02:30,644 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 75 [2021-03-25 15:02:30,645 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 284 flow [2021-03-25 15:02:30,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:30,646 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:02:30,646 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:02:30,646 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 15:02:30,646 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:02:30,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:02:30,646 INFO L82 PathProgramCache]: Analyzing trace with hash -234433085, now seen corresponding path program 1 times [2021-03-25 15:02:30,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:02:30,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161909513] [2021-03-25 15:02:30,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:02:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:02:30,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:30,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:02:30,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:30,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:02:30,743 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 15:02:30,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 15:02:30,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:30,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:02:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:02:30,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161909513] [2021-03-25 15:02:30,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:02:30,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 15:02:30,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214349153] [2021-03-25 15:02:30,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 15:02:30,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:02:30,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 15:02:30,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 15:02:30,753 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 170 [2021-03-25 15:02:30,753 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 284 flow. Second operand has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:30,753 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:02:30,754 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 170 [2021-03-25 15:02:30,754 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:02:30,831 INFO L129 PetriNetUnfolder]: 114/297 cut-off events. [2021-03-25 15:02:30,831 INFO L130 PetriNetUnfolder]: For 385/522 co-relation queries the response was YES. [2021-03-25 15:02:30,832 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 297 events. 114/297 cut-off events. For 385/522 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1627 event pairs, 6 based on Foata normal form. 56/324 useless extension candidates. Maximal degree in co-relation 1045. Up to 173 conditions per place. [2021-03-25 15:02:30,834 INFO L132 encePairwiseOnDemand]: 164/170 looper letters, 8 selfloop transitions, 11 changer transitions 3/51 dead transitions. [2021-03-25 15:02:30,834 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 51 transitions, 372 flow [2021-03-25 15:02:30,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 15:02:30,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 15:02:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 858 transitions. [2021-03-25 15:02:30,837 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8411764705882353 [2021-03-25 15:02:30,837 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 858 transitions. [2021-03-25 15:02:30,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 858 transitions. [2021-03-25 15:02:30,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:02:30,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 858 transitions. [2021-03-25 15:02:30,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:30,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:30,841 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:30,841 INFO L185 Difference]: Start difference. First operand has 48 places, 42 transitions, 284 flow. Second operand 6 states and 858 transitions. [2021-03-25 15:02:30,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 51 transitions, 372 flow [2021-03-25 15:02:30,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 366 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 15:02:30,846 INFO L241 Difference]: Finished difference. Result has 52 places, 46 transitions, 348 flow [2021-03-25 15:02:30,846 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2021-03-25 15:02:30,846 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2021-03-25 15:02:30,847 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:02:30,847 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 46 transitions, 348 flow [2021-03-25 15:02:30,847 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 46 transitions, 348 flow [2021-03-25 15:02:30,847 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 348 flow [2021-03-25 15:02:30,874 INFO L129 PetriNetUnfolder]: 62/211 cut-off events. [2021-03-25 15:02:30,874 INFO L130 PetriNetUnfolder]: For 459/496 co-relation queries the response was YES. [2021-03-25 15:02:30,875 INFO L84 FinitePrefix]: Finished finitePrefix Result has 836 conditions, 211 events. 62/211 cut-off events. For 459/496 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1155 event pairs, 5 based on Foata normal form. 2/208 useless extension candidates. Maximal degree in co-relation 812. Up to 119 conditions per place. [2021-03-25 15:02:30,878 INFO L142 LiptonReduction]: Number of co-enabled transitions 436 [2021-03-25 15:02:30,890 INFO L154 LiptonReduction]: Checked pairs total: 635 [2021-03-25 15:02:30,891 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 15:02:30,891 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 44 [2021-03-25 15:02:30,895 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 340 flow [2021-03-25 15:02:30,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:30,896 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:02:30,896 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:02:30,896 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 15:02:30,896 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:02:30,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:02:30,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1683187099, now seen corresponding path program 1 times [2021-03-25 15:02:30,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:02:30,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336975013] [2021-03-25 15:02:30,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:02:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:02:30,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:30,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:02:30,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:30,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:02:30,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:02:30,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336975013] [2021-03-25 15:02:30,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:02:30,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 15:02:30,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139071139] [2021-03-25 15:02:30,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 15:02:30,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:02:30,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 15:02:30,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 15:02:30,999 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 170 [2021-03-25 15:02:31,000 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:31,000 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:02:31,000 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 170 [2021-03-25 15:02:31,000 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:02:31,031 INFO L129 PetriNetUnfolder]: 70/231 cut-off events. [2021-03-25 15:02:31,031 INFO L130 PetriNetUnfolder]: For 550/567 co-relation queries the response was YES. [2021-03-25 15:02:31,032 INFO L84 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 231 events. 70/231 cut-off events. For 550/567 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1210 event pairs, 10 based on Foata normal form. 13/240 useless extension candidates. Maximal degree in co-relation 889. Up to 123 conditions per place. [2021-03-25 15:02:31,033 INFO L132 encePairwiseOnDemand]: 167/170 looper letters, 4 selfloop transitions, 6 changer transitions 4/42 dead transitions. [2021-03-25 15:02:31,033 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 42 transitions, 334 flow [2021-03-25 15:02:31,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 15:02:31,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 15:02:31,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2021-03-25 15:02:31,034 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.888235294117647 [2021-03-25 15:02:31,034 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2021-03-25 15:02:31,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2021-03-25 15:02:31,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:02:31,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2021-03-25 15:02:31,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:31,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:31,037 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:31,037 INFO L185 Difference]: Start difference. First operand has 52 places, 45 transitions, 340 flow. Second operand 3 states and 453 transitions. [2021-03-25 15:02:31,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 42 transitions, 334 flow [2021-03-25 15:02:31,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 314 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-03-25 15:02:31,043 INFO L241 Difference]: Finished difference. Result has 50 places, 38 transitions, 281 flow [2021-03-25 15:02:31,043 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=281, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2021-03-25 15:02:31,043 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 3 predicate places. [2021-03-25 15:02:31,043 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:02:31,043 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 38 transitions, 281 flow [2021-03-25 15:02:31,044 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 38 transitions, 281 flow [2021-03-25 15:02:31,044 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 38 transitions, 281 flow [2021-03-25 15:02:31,063 INFO L129 PetriNetUnfolder]: 61/210 cut-off events. [2021-03-25 15:02:31,064 INFO L130 PetriNetUnfolder]: For 378/386 co-relation queries the response was YES. [2021-03-25 15:02:31,064 INFO L84 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 210 events. 61/210 cut-off events. For 378/386 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1099 event pairs, 10 based on Foata normal form. 2/208 useless extension candidates. Maximal degree in co-relation 697. Up to 82 conditions per place. [2021-03-25 15:02:31,066 INFO L142 LiptonReduction]: Number of co-enabled transitions 310 [2021-03-25 15:02:31,070 INFO L154 LiptonReduction]: Checked pairs total: 207 [2021-03-25 15:02:31,071 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:02:31,071 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28 [2021-03-25 15:02:31,071 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 281 flow [2021-03-25 15:02:31,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:31,072 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:02:31,072 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:02:31,072 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 15:02:31,072 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:02:31,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:02:31,072 INFO L82 PathProgramCache]: Analyzing trace with hash 173546653, now seen corresponding path program 1 times [2021-03-25 15:02:31,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:02:31,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211142666] [2021-03-25 15:02:31,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:02:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:02:31,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:31,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:02:31,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:31,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:02:31,162 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-03-25 15:02:31,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 15:02:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:02:31,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211142666] [2021-03-25 15:02:31,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:02:31,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 15:02:31,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88788948] [2021-03-25 15:02:31,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 15:02:31,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:02:31,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 15:02:31,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 15:02:31,174 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 170 [2021-03-25 15:02:31,174 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 281 flow. Second operand has 4 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:31,174 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:02:31,174 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 170 [2021-03-25 15:02:31,174 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:02:31,223 INFO L129 PetriNetUnfolder]: 81/259 cut-off events. [2021-03-25 15:02:31,223 INFO L130 PetriNetUnfolder]: For 596/636 co-relation queries the response was YES. [2021-03-25 15:02:31,224 INFO L84 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 259 events. 81/259 cut-off events. For 596/636 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1438 event pairs, 15 based on Foata normal form. 16/269 useless extension candidates. Maximal degree in co-relation 909. Up to 111 conditions per place. [2021-03-25 15:02:31,225 INFO L132 encePairwiseOnDemand]: 163/170 looper letters, 5 selfloop transitions, 12 changer transitions 3/40 dead transitions. [2021-03-25 15:02:31,225 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 40 transitions, 346 flow [2021-03-25 15:02:31,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 15:02:31,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 15:02:31,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 567 transitions. [2021-03-25 15:02:31,227 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8338235294117647 [2021-03-25 15:02:31,227 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 567 transitions. [2021-03-25 15:02:31,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 567 transitions. [2021-03-25 15:02:31,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:02:31,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 567 transitions. [2021-03-25 15:02:31,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:31,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:31,230 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:31,230 INFO L185 Difference]: Start difference. First operand has 50 places, 38 transitions, 281 flow. Second operand 4 states and 567 transitions. [2021-03-25 15:02:31,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 40 transitions, 346 flow [2021-03-25 15:02:31,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 318 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-25 15:02:31,234 INFO L241 Difference]: Finished difference. Result has 51 places, 37 transitions, 278 flow [2021-03-25 15:02:31,235 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2021-03-25 15:02:31,235 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2021-03-25 15:02:31,235 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:02:31,235 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 37 transitions, 278 flow [2021-03-25 15:02:31,235 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 37 transitions, 278 flow [2021-03-25 15:02:31,236 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 37 transitions, 278 flow [2021-03-25 15:02:31,258 INFO L129 PetriNetUnfolder]: 66/228 cut-off events. [2021-03-25 15:02:31,258 INFO L130 PetriNetUnfolder]: For 473/483 co-relation queries the response was YES. [2021-03-25 15:02:31,259 INFO L84 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 228 events. 66/228 cut-off events. For 473/483 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1262 event pairs, 12 based on Foata normal form. 2/225 useless extension candidates. Maximal degree in co-relation 750. Up to 96 conditions per place. [2021-03-25 15:02:31,261 INFO L142 LiptonReduction]: Number of co-enabled transitions 302 [2021-03-25 15:02:31,265 INFO L154 LiptonReduction]: Checked pairs total: 215 [2021-03-25 15:02:31,266 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:02:31,266 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 31 [2021-03-25 15:02:31,266 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 278 flow [2021-03-25 15:02:31,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:31,266 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:02:31,267 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:02:31,267 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 15:02:31,267 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:02:31,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:02:31,267 INFO L82 PathProgramCache]: Analyzing trace with hash -984657531, now seen corresponding path program 2 times [2021-03-25 15:02:31,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:02:31,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244019381] [2021-03-25 15:02:31,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:02:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:02:31,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:31,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:02:31,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:31,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:02:31,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:31,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:02:31,361 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 15:02:31,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 15:02:31,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:31,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:02:31,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:02:31,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244019381] [2021-03-25 15:02:31,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:02:31,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 15:02:31,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165437250] [2021-03-25 15:02:31,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 15:02:31,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:02:31,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 15:02:31,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 15:02:31,371 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 170 [2021-03-25 15:02:31,371 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 139.83333333333334) internal successors, (839), 6 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:31,371 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:02:31,371 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 170 [2021-03-25 15:02:31,372 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:02:31,448 INFO L129 PetriNetUnfolder]: 122/304 cut-off events. [2021-03-25 15:02:31,448 INFO L130 PetriNetUnfolder]: For 528/671 co-relation queries the response was YES. [2021-03-25 15:02:31,450 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1163 conditions, 304 events. 122/304 cut-off events. For 528/671 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1651 event pairs, 1 based on Foata normal form. 52/318 useless extension candidates. Maximal degree in co-relation 1138. Up to 126 conditions per place. [2021-03-25 15:02:31,450 INFO L132 encePairwiseOnDemand]: 164/170 looper letters, 2 selfloop transitions, 10 changer transitions 18/44 dead transitions. [2021-03-25 15:02:31,450 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 354 flow [2021-03-25 15:02:31,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 15:02:31,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 15:02:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 995 transitions. [2021-03-25 15:02:31,453 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8361344537815126 [2021-03-25 15:02:31,453 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 995 transitions. [2021-03-25 15:02:31,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 995 transitions. [2021-03-25 15:02:31,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:02:31,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 995 transitions. [2021-03-25 15:02:31,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.14285714285714) internal successors, (995), 7 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:31,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 170.0) internal successors, (1360), 8 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:31,458 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 170.0) internal successors, (1360), 8 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:31,458 INFO L185 Difference]: Start difference. First operand has 51 places, 37 transitions, 278 flow. Second operand 7 states and 995 transitions. [2021-03-25 15:02:31,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 354 flow [2021-03-25 15:02:31,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 44 transitions, 319 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-03-25 15:02:31,465 INFO L241 Difference]: Finished difference. Result has 57 places, 26 transitions, 180 flow [2021-03-25 15:02:31,465 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=180, PETRI_PLACES=57, PETRI_TRANSITIONS=26} [2021-03-25 15:02:31,465 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 10 predicate places. [2021-03-25 15:02:31,465 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:02:31,466 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 26 transitions, 180 flow [2021-03-25 15:02:31,466 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 26 transitions, 180 flow [2021-03-25 15:02:31,466 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 26 transitions, 180 flow [2021-03-25 15:02:31,470 INFO L129 PetriNetUnfolder]: 5/29 cut-off events. [2021-03-25 15:02:31,470 INFO L130 PetriNetUnfolder]: For 45/48 co-relation queries the response was YES. [2021-03-25 15:02:31,471 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 29 events. 5/29 cut-off events. For 45/48 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 27 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 99. Up to 10 conditions per place. [2021-03-25 15:02:31,471 INFO L142 LiptonReduction]: Number of co-enabled transitions 66 [2021-03-25 15:02:31,787 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 15:02:31,919 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 15:02:32,603 WARN L205 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-03-25 15:02:32,863 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-25 15:02:34,116 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 302 DAG size of output: 257 [2021-03-25 15:02:34,685 WARN L205 SmtUtils]: Spent 567.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 15:02:35,031 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-03-25 15:02:35,133 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-03-25 15:02:35,285 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-25 15:02:35,420 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-25 15:02:35,445 INFO L154 LiptonReduction]: Checked pairs total: 177 [2021-03-25 15:02:35,445 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 15:02:35,445 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3980 [2021-03-25 15:02:35,446 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 21 transitions, 160 flow [2021-03-25 15:02:35,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 139.83333333333334) internal successors, (839), 6 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:35,446 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:02:35,446 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:02:35,446 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 15:02:35,446 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:02:35,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:02:35,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1604180176, now seen corresponding path program 1 times [2021-03-25 15:02:35,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:02:35,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125018404] [2021-03-25 15:02:35,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:02:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:02:35,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:35,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:02:35,518 INFO L142 QuantifierPusher]: treesize reduction 10, result has 67.7 percent of original size [2021-03-25 15:02:35,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 15:02:35,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:35,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 15:02:35,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:02:35,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:02:35,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 15:02:35,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125018404] [2021-03-25 15:02:35,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:02:35,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 15:02:35,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195146171] [2021-03-25 15:02:35,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 15:02:35,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:02:35,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 15:02:35,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 15:02:35,545 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 175 [2021-03-25 15:02:35,546 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 21 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:35,546 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:02:35,546 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 175 [2021-03-25 15:02:35,546 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:02:35,621 INFO L129 PetriNetUnfolder]: 16/53 cut-off events. [2021-03-25 15:02:35,621 INFO L130 PetriNetUnfolder]: For 241/251 co-relation queries the response was YES. [2021-03-25 15:02:35,621 INFO L84 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 53 events. 16/53 cut-off events. For 241/251 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 155 event pairs, 0 based on Foata normal form. 4/55 useless extension candidates. Maximal degree in co-relation 206. Up to 23 conditions per place. [2021-03-25 15:02:35,622 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 4 selfloop transitions, 5 changer transitions 2/26 dead transitions. [2021-03-25 15:02:35,622 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 26 transitions, 210 flow [2021-03-25 15:02:35,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 15:02:35,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 15:02:35,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 880 transitions. [2021-03-25 15:02:35,624 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7183673469387755 [2021-03-25 15:02:35,624 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 880 transitions. [2021-03-25 15:02:35,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 880 transitions. [2021-03-25 15:02:35,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:02:35,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 880 transitions. [2021-03-25 15:02:35,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.71428571428571) internal successors, (880), 7 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:35,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 175.0) internal successors, (1400), 8 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:35,629 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 175.0) internal successors, (1400), 8 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:35,629 INFO L185 Difference]: Start difference. First operand has 49 places, 21 transitions, 160 flow. Second operand 7 states and 880 transitions. [2021-03-25 15:02:35,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 26 transitions, 210 flow [2021-03-25 15:02:35,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 126 flow, removed 13 selfloop flow, removed 19 redundant places. [2021-03-25 15:02:35,631 INFO L241 Difference]: Finished difference. Result has 39 places, 23 transitions, 117 flow [2021-03-25 15:02:35,631 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=117, PETRI_PLACES=39, PETRI_TRANSITIONS=23} [2021-03-25 15:02:35,631 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -8 predicate places. [2021-03-25 15:02:35,631 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:02:35,631 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 23 transitions, 117 flow [2021-03-25 15:02:35,631 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 23 transitions, 117 flow [2021-03-25 15:02:35,632 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 23 transitions, 117 flow [2021-03-25 15:02:35,642 INFO L129 PetriNetUnfolder]: 9/36 cut-off events. [2021-03-25 15:02:35,642 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-03-25 15:02:35,642 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 36 events. 9/36 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 71 event pairs, 1 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 96. Up to 12 conditions per place. [2021-03-25 15:02:35,642 INFO L142 LiptonReduction]: Number of co-enabled transitions 48 [2021-03-25 15:02:35,643 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 15:02:35,644 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:02:35,644 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-03-25 15:02:35,646 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 117 flow [2021-03-25 15:02:35,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:02:35,647 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:02:35,647 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:02:35,647 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 15:02:35,647 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:02:35,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:02:35,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1992046235, now seen corresponding path program 1 times [2021-03-25 15:02:35,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:02:35,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201502115] [2021-03-25 15:02:35,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:02:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 15:02:35,684 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 15:02:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 15:02:35,747 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 15:02:35,785 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 15:02:35,786 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 15:02:35,786 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 15:02:35,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 03:02:35 BasicIcfg [2021-03-25 15:02:35,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 15:02:35,881 INFO L168 Benchmark]: Toolchain (without parser) took 14024.18 ms. Allocated memory was 255.9 MB in the beginning and 692.1 MB in the end (delta: 436.2 MB). Free memory was 232.9 MB in the beginning and 647.3 MB in the end (delta: -414.4 MB). Peak memory consumption was 340.5 MB. Max. memory is 16.0 GB. [2021-03-25 15:02:35,881 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.2 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 15:02:35,882 INFO L168 Benchmark]: CACSL2BoogieTranslator took 495.85 ms. Allocated memory was 255.9 MB in the beginning and 358.6 MB in the end (delta: 102.8 MB). Free memory was 232.9 MB in the beginning and 317.9 MB in the end (delta: -85.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-25 15:02:35,882 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.03 ms. Allocated memory is still 358.6 MB. Free memory was 317.9 MB in the beginning and 315.5 MB in the end (delta: 2.4 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 15:02:35,882 INFO L168 Benchmark]: Boogie Preprocessor took 41.77 ms. Allocated memory is still 358.6 MB. Free memory was 315.5 MB in the beginning and 313.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 15:02:35,882 INFO L168 Benchmark]: RCFGBuilder took 1643.84 ms. Allocated memory is still 358.6 MB. Free memory was 313.4 MB in the beginning and 266.9 MB in the end (delta: 46.5 MB). Peak memory consumption was 49.9 MB. Max. memory is 16.0 GB. [2021-03-25 15:02:35,883 INFO L168 Benchmark]: TraceAbstraction took 11795.49 ms. Allocated memory was 358.6 MB in the beginning and 692.1 MB in the end (delta: 333.4 MB). Free memory was 266.9 MB in the beginning and 647.3 MB in the end (delta: -380.4 MB). Peak memory consumption was 272.9 MB. Max. memory is 16.0 GB. [2021-03-25 15:02:35,888 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.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.2 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 495.85 ms. Allocated memory was 255.9 MB in the beginning and 358.6 MB in the end (delta: 102.8 MB). Free memory was 232.9 MB in the beginning and 317.9 MB in the end (delta: -85.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 40.03 ms. Allocated memory is still 358.6 MB. Free memory was 317.9 MB in the beginning and 315.5 MB in the end (delta: 2.4 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 41.77 ms. Allocated memory is still 358.6 MB. Free memory was 315.5 MB in the beginning and 313.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1643.84 ms. Allocated memory is still 358.6 MB. Free memory was 313.4 MB in the beginning and 266.9 MB in the end (delta: 46.5 MB). Peak memory consumption was 49.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 11795.49 ms. Allocated memory was 358.6 MB in the beginning and 692.1 MB in the end (delta: 333.4 MB). Free memory was 266.9 MB in the beginning and 647.3 MB in the end (delta: -380.4 MB). Peak memory consumption was 272.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2854.5ms, 101 PlacesBefore, 47 PlacesAfterwards, 93 TransitionsBefore, 38 TransitionsAfterwards, 1586 CoEnabledTransitionPairs, 5 FixpointIterations, 26 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 61 TotalNumberOfCompositions, 2266 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1163, positive: 1104, positive conditional: 0, positive unconditional: 1104, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 891, positive: 857, positive conditional: 0, positive unconditional: 857, 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: 891, positive: 857, positive conditional: 0, positive unconditional: 857, 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: 891, positive: 855, positive conditional: 0, positive unconditional: 855, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 362, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 355, negative conditional: 0, negative unconditional: 355, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1163, positive: 247, positive conditional: 0, positive unconditional: 247, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 891, unknown conditional: 0, unknown unconditional: 891] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2148.2ms, 44 PlacesBefore, 32 PlacesAfterwards, 35 TransitionsBefore, 23 TransitionsAfterwards, 318 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 1464 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 537, positive: 437, positive conditional: 0, positive unconditional: 437, negative: 100, negative conditional: 0, negative unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 94, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 94, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 94, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 149, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 139, negative conditional: 0, negative unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 537, positive: 354, positive conditional: 0, positive unconditional: 354, negative: 89, negative conditional: 0, negative unconditional: 89, unknown: 94, unknown conditional: 0, unknown unconditional: 94] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 111, Positive conditional cache size: 0, Positive unconditional cache size: 111, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 120.3ms, 38 PlacesBefore, 34 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 174 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 10, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 10, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 88, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 118, Positive conditional cache size: 0, Positive unconditional cache size: 118, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.8ms, 35 PlacesBefore, 35 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 255 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 61, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 15, negative conditional: 0, negative unconditional: 15, 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: 61, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 118, Positive conditional cache size: 0, Positive unconditional cache size: 118, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.3ms, 41 PlacesBefore, 41 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 344 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 305 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 123, Positive conditional cache size: 0, Positive unconditional cache size: 123, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 74.5ms, 48 PlacesBefore, 48 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 655 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 149, positive: 121, positive conditional: 0, positive unconditional: 121, negative: 28, negative conditional: 0, negative unconditional: 28, 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: 149, positive: 115, positive conditional: 0, positive unconditional: 115, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 113, Positive conditional cache size: 0, Positive unconditional cache size: 113, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 43.9ms, 52 PlacesBefore, 52 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 436 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 635 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 145, positive: 117, positive conditional: 0, positive unconditional: 117, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 13, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 13, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 145, positive: 104, positive conditional: 0, positive unconditional: 104, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 115, Positive conditional cache size: 0, Positive unconditional cache size: 115, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26.9ms, 50 PlacesBefore, 50 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 207 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 11, negative conditional: 0, negative unconditional: 11, 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: 24, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 115, Positive conditional cache size: 0, Positive unconditional cache size: 115, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 30.2ms, 51 PlacesBefore, 51 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 215 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 81, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 81, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 116, Positive conditional cache size: 0, Positive unconditional cache size: 116, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3979.3ms, 57 PlacesBefore, 49 PlacesAfterwards, 26 TransitionsBefore, 21 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 177 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 21, negative conditional: 0, negative unconditional: 21, 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: 129, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.3ms, 39 PlacesBefore, 37 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, 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; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff0_thd3; [L723] 0 _Bool x$r_buff1_thd0; [L724] 0 _Bool x$r_buff1_thd1; [L725] 0 _Bool x$r_buff1_thd2; [L726] 0 _Bool x$r_buff1_thd3; [L727] 0 _Bool x$read_delayed; [L728] 0 int *x$read_delayed_var; [L729] 0 int x$w_buff0; [L730] 0 _Bool x$w_buff0_used; [L731] 0 int x$w_buff1; [L732] 0 _Bool x$w_buff1_used; [L734] 0 int y = 0; [L736] 0 int z = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L829] 0 pthread_t t2525; [L830] FCALL, FORK 0 pthread_create(&t2525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L831] 0 pthread_t t2526; [L832] FCALL, FORK 0 pthread_create(&t2526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L833] 0 pthread_t t2527; [L834] FCALL, FORK 0 pthread_create(&t2527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L801] 3 y = 2 [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=2, z=1] [L742] 1 z = 2 [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, 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=255, 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=2, z=2] [L787] 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) [L787] 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) [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 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 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L791] 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 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L807] 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) [L807] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L807] 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) [L807] 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) [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 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 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L811] 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 [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L840] 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) [L840] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L840] 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) [L840] 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) [L841] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L842] 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 [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L844] 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 [L847] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=255, 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=2, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 11532.7ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 832.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2927.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 62 SDtfs, 34 SDslu, 33 SDs, 0 SdLazy, 169 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 206.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 152.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=348occurred in iteration=6, InterpolantAutomatonStates: 48, 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: 30.8ms SsaConstructionTime, 377.0ms SatisfiabilityAnalysisTime, 565.1ms InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 609 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...