/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix032_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:14:27,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:14:27,844 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:14:27,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:14:27,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:14:27,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:14:27,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:14:27,881 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:14:27,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:14:27,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:14:27,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:14:27,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:14:27,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:14:27,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:14:27,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:14:27,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:14:27,896 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:14:27,896 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:14:27,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:14:27,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:14:27,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:14:27,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:14:27,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:14:27,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:14:27,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:14:27,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:14:27,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:14:27,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:14:27,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:14:27,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:14:27,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:14:27,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:14:27,915 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:14:27,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:14:27,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:14:27,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:14:27,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:14:27,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:14:27,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:14:27,917 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:14:27,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:14:27,918 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:14:27,945 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:14:27,946 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:14:27,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:14:27,948 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:14:27,948 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:14:27,949 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:14:27,949 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:14:27,949 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:14:27,949 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:14:27,949 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:14:27,950 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:14:27,950 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:14:27,950 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:14:27,950 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:14:27,950 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:14:27,950 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:14:27,950 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:14:27,951 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:14:27,951 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:14:27,951 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:14:27,951 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:14:27,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:14:27,951 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:14:27,951 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:14:27,951 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:14:27,952 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:14:27,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:14:27,952 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:14:27,952 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:14:27,952 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:14:27,952 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:14:28,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:14:28,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:14:28,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:14:28,268 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:14:28,268 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:14:28,269 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_pso.opt.i [2021-03-26 00:14:28,318 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b606ed748/48763cb9eddc478eb103e0df24a83155/FLAGb19b51b1c [2021-03-26 00:14:28,744 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:14:28,745 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_pso.opt.i [2021-03-26 00:14:28,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b606ed748/48763cb9eddc478eb103e0df24a83155/FLAGb19b51b1c [2021-03-26 00:14:29,093 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b606ed748/48763cb9eddc478eb103e0df24a83155 [2021-03-26 00:14:29,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:14:29,097 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:14:29,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:14:29,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:14:29,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:14:29,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:14:29" (1/1) ... [2021-03-26 00:14:29,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@297c9c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:29, skipping insertion in model container [2021-03-26 00:14:29,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:14:29" (1/1) ... [2021-03-26 00:14:29,106 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:14:29,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:14:29,250 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/mix032_pso.opt.i[948,961] [2021-03-26 00:14:29,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:14:29,377 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:14:29,384 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/mix032_pso.opt.i[948,961] [2021-03-26 00:14:29,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:14:29,446 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:14:29,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:29 WrapperNode [2021-03-26 00:14:29,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:14:29,447 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:14:29,447 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:14:29,447 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:14:29,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:29" (1/1) ... [2021-03-26 00:14:29,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:29" (1/1) ... [2021-03-26 00:14:29,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:14:29,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:14:29,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:14:29,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:14:29,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:29" (1/1) ... [2021-03-26 00:14:29,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:29" (1/1) ... [2021-03-26 00:14:29,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:29" (1/1) ... [2021-03-26 00:14:29,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:29" (1/1) ... [2021-03-26 00:14:29,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:29" (1/1) ... [2021-03-26 00:14:29,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:29" (1/1) ... [2021-03-26 00:14:29,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:29" (1/1) ... [2021-03-26 00:14:29,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:14:29,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:14:29,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:14:29,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:14:29,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:14:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:14:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:14:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:14:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:14:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:14:29,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:14:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:14:29,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:14:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:14:29,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:14:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:14:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:14:29,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:14:29,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:14:29,552 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:14:30,535 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:14:30,535 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:14:30,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:14:30 BoogieIcfgContainer [2021-03-26 00:14:30,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:14:30,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:14:30,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:14:30,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:14:30,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:14:29" (1/3) ... [2021-03-26 00:14:30,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1014af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:14:30, skipping insertion in model container [2021-03-26 00:14:30,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:29" (2/3) ... [2021-03-26 00:14:30,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1014af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:14:30, skipping insertion in model container [2021-03-26 00:14:30,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:14:30" (3/3) ... [2021-03-26 00:14:30,541 INFO L111 eAbstractionObserver]: Analyzing ICFG mix032_pso.opt.i [2021-03-26 00:14:30,545 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:14:30,547 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:14:30,547 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:14:30,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,567 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,567 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,568 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,568 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,568 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,568 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,569 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,569 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,577 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,577 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,577 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,577 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,577 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,578 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,578 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,578 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,582 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,583 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,584 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,584 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,584 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,584 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,584 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,584 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,584 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,584 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,585 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,586 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,586 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:30,586 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:14:30,598 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:14:30,609 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:14:30,609 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:14:30,609 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:14:30,610 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:14:30,610 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:14:30,610 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:14:30,610 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:14:30,610 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:14:30,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2021-03-26 00:14:30,640 INFO L129 PetriNetUnfolder]: 2/102 cut-off events. [2021-03-26 00:14:30,640 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:14:30,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-03-26 00:14:30,643 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2021-03-26 00:14:30,646 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2021-03-26 00:14:30,646 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:30,654 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 102 transitions, 213 flow [2021-03-26 00:14:30,656 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 102 transitions, 213 flow [2021-03-26 00:14:30,657 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 213 flow [2021-03-26 00:14:30,669 INFO L129 PetriNetUnfolder]: 2/102 cut-off events. [2021-03-26 00:14:30,669 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:14:30,669 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-03-26 00:14:30,671 INFO L142 LiptonReduction]: Number of co-enabled transitions 1832 [2021-03-26 00:14:31,583 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:14:31,894 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:14:32,728 INFO L154 LiptonReduction]: Checked pairs total: 2848 [2021-03-26 00:14:32,729 INFO L156 LiptonReduction]: Total number of compositions: 71 [2021-03-26 00:14:32,732 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2086 [2021-03-26 00:14:32,741 INFO L129 PetriNetUnfolder]: 0/27 cut-off events. [2021-03-26 00:14:32,741 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:14:32,741 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:32,742 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-26 00:14:32,742 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:32,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:32,745 INFO L82 PathProgramCache]: Analyzing trace with hash -81098595, now seen corresponding path program 1 times [2021-03-26 00:14:32,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:32,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359097946] [2021-03-26 00:14:32,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:14:32,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:32,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:14:32,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:32,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:32,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:14:32,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359097946] [2021-03-26 00:14:32,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:14:32,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:14:32,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937751412] [2021-03-26 00:14:32,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:14:32,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:14:32,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:14:32,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:14:32,994 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 176 [2021-03-26 00:14:33,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:33,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:14:33,003 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 176 [2021-03-26 00:14:33,003 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:14:33,051 INFO L129 PetriNetUnfolder]: 9/78 cut-off events. [2021-03-26 00:14:33,052 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:14:33,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 78 events. 9/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 213 event pairs, 3 based on Foata normal form. 6/76 useless extension candidates. Maximal degree in co-relation 88. Up to 17 conditions per place. [2021-03-26 00:14:33,053 INFO L132 encePairwiseOnDemand]: 172/176 looper letters, 5 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2021-03-26 00:14:33,053 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 103 flow [2021-03-26 00:14:33,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:14:33,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:14:33,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2021-03-26 00:14:33,067 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9109848484848485 [2021-03-26 00:14:33,068 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 481 transitions. [2021-03-26 00:14:33,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 481 transitions. [2021-03-26 00:14:33,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:14:33,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 481 transitions. [2021-03-26 00:14:33,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:33,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:33,087 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:33,088 INFO L185 Difference]: Start difference. First operand has 50 places, 41 transitions, 91 flow. Second operand 3 states and 481 transitions. [2021-03-26 00:14:33,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 103 flow [2021-03-26 00:14:33,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 40 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:14:33,091 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 86 flow [2021-03-26 00:14:33,092 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-03-26 00:14:33,093 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2021-03-26 00:14:33,093 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:33,093 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 86 flow [2021-03-26 00:14:33,094 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 86 flow [2021-03-26 00:14:33,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 86 flow [2021-03-26 00:14:33,099 INFO L129 PetriNetUnfolder]: 0/38 cut-off events. [2021-03-26 00:14:33,099 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:14:33,100 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:14:33,101 INFO L142 LiptonReduction]: Number of co-enabled transitions 326 [2021-03-26 00:14:34,372 INFO L154 LiptonReduction]: Checked pairs total: 1698 [2021-03-26 00:14:34,373 INFO L156 LiptonReduction]: Total number of compositions: 14 [2021-03-26 00:14:34,373 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1280 [2021-03-26 00:14:34,374 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-26 00:14:34,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:34,374 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:34,375 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:34,375 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:14:34,375 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:34,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:34,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2060627892, now seen corresponding path program 1 times [2021-03-26 00:14:34,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:34,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114364251] [2021-03-26 00:14:34,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:14:34,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:34,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:14:34,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:34,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:34,446 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:14:34,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:14:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:14:34,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114364251] [2021-03-26 00:14:34,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:14:34,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:14:34,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106401866] [2021-03-26 00:14:34,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:14:34,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:14:34,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:14:34,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:14:34,452 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 190 [2021-03-26 00:14:34,452 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:34,452 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:14:34,452 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 190 [2021-03-26 00:14:34,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:14:34,469 INFO L129 PetriNetUnfolder]: 1/26 cut-off events. [2021-03-26 00:14:34,469 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:14:34,470 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 26 events. 1/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 33. Up to 3 conditions per place. [2021-03-26 00:14:34,470 INFO L132 encePairwiseOnDemand]: 186/190 looper letters, 1 selfloop transitions, 2 changer transitions 4/26 dead transitions. [2021-03-26 00:14:34,470 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 74 flow [2021-03-26 00:14:34,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:14:34,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:14:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 812 transitions. [2021-03-26 00:14:34,471 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8547368421052631 [2021-03-26 00:14:34,472 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 812 transitions. [2021-03-26 00:14:34,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 812 transitions. [2021-03-26 00:14:34,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:14:34,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 812 transitions. [2021-03-26 00:14:34,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 162.4) internal successors, (812), 5 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:34,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 190.0) internal successors, (1140), 6 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:34,475 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 190.0) internal successors, (1140), 6 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:34,475 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 5 states and 812 transitions. [2021-03-26 00:14:34,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 74 flow [2021-03-26 00:14:34,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 26 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:14:34,476 INFO L241 Difference]: Finished difference. Result has 36 places, 22 transitions, 58 flow [2021-03-26 00:14:34,476 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=58, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2021-03-26 00:14:34,476 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -14 predicate places. [2021-03-26 00:14:34,477 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:34,477 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 22 transitions, 58 flow [2021-03-26 00:14:34,477 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 22 transitions, 58 flow [2021-03-26 00:14:34,477 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 22 transitions, 58 flow [2021-03-26 00:14:34,479 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-26 00:14:34,479 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:14:34,479 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:14:34,480 INFO L142 LiptonReduction]: Number of co-enabled transitions 202 [2021-03-26 00:14:34,943 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-26 00:14:35,086 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 00:14:35,322 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-26 00:14:35,429 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 00:14:35,439 INFO L154 LiptonReduction]: Checked pairs total: 399 [2021-03-26 00:14:35,440 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:14:35,440 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 963 [2021-03-26 00:14:35,441 INFO L480 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 52 flow [2021-03-26 00:14:35,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:35,442 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:35,442 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:35,442 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:14:35,442 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:35,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:35,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1679272019, now seen corresponding path program 1 times [2021-03-26 00:14:35,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:35,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16422152] [2021-03-26 00:14:35,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:14:35,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:35,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:35,483 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 00:14:35,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:14:35,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:14:35,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16422152] [2021-03-26 00:14:35,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:14:35,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:14:35,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378323498] [2021-03-26 00:14:35,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:14:35,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:14:35,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:14:35,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:14:35,491 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 193 [2021-03-26 00:14:35,492 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:35,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:14:35,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 193 [2021-03-26 00:14:35,492 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:14:35,530 INFO L129 PetriNetUnfolder]: 28/90 cut-off events. [2021-03-26 00:14:35,530 INFO L130 PetriNetUnfolder]: For 17/31 co-relation queries the response was YES. [2021-03-26 00:14:35,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 90 events. 28/90 cut-off events. For 17/31 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 334 event pairs, 14 based on Foata normal form. 4/92 useless extension candidates. Maximal degree in co-relation 165. Up to 47 conditions per place. [2021-03-26 00:14:35,531 INFO L132 encePairwiseOnDemand]: 190/193 looper letters, 8 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2021-03-26 00:14:35,531 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 22 transitions, 81 flow [2021-03-26 00:14:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:14:35,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:14:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2021-03-26 00:14:35,533 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8065630397236615 [2021-03-26 00:14:35,533 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2021-03-26 00:14:35,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2021-03-26 00:14:35,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:14:35,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2021-03-26 00:14:35,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:35,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:35,536 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:35,536 INFO L185 Difference]: Start difference. First operand has 29 places, 19 transitions, 52 flow. Second operand 3 states and 467 transitions. [2021-03-26 00:14:35,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 22 transitions, 81 flow [2021-03-26 00:14:35,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 22 transitions, 75 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:14:35,536 INFO L241 Difference]: Finished difference. Result has 30 places, 19 transitions, 56 flow [2021-03-26 00:14:35,537 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2021-03-26 00:14:35,537 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -20 predicate places. [2021-03-26 00:14:35,537 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:35,537 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 19 transitions, 56 flow [2021-03-26 00:14:35,537 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 19 transitions, 56 flow [2021-03-26 00:14:35,537 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 19 transitions, 56 flow [2021-03-26 00:14:35,539 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2021-03-26 00:14:35,539 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:14:35,539 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 19 events. 0/19 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:14:35,539 INFO L142 LiptonReduction]: Number of co-enabled transitions 158 [2021-03-26 00:14:35,553 INFO L154 LiptonReduction]: Checked pairs total: 167 [2021-03-26 00:14:35,553 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:14:35,553 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-03-26 00:14:35,557 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 56 flow [2021-03-26 00:14:35,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:35,557 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:35,557 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:35,558 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:14:35,558 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:35,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:35,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1779435278, now seen corresponding path program 1 times [2021-03-26 00:14:35,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:35,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995827513] [2021-03-26 00:14:35,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:14:35,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:35,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:35,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:35,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:35,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:35,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:14:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:14:35,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995827513] [2021-03-26 00:14:35,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:14:35,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:14:35,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978758382] [2021-03-26 00:14:35,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:14:35,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:14:35,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:14:35,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:14:35,633 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 193 [2021-03-26 00:14:35,634 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:35,634 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:14:35,634 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 193 [2021-03-26 00:14:35,634 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:14:35,662 INFO L129 PetriNetUnfolder]: 28/77 cut-off events. [2021-03-26 00:14:35,663 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-03-26 00:14:35,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 77 events. 28/77 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 264 event pairs, 12 based on Foata normal form. 8/84 useless extension candidates. Maximal degree in co-relation 153. Up to 45 conditions per place. [2021-03-26 00:14:35,663 INFO L132 encePairwiseOnDemand]: 187/193 looper letters, 5 selfloop transitions, 4 changer transitions 7/29 dead transitions. [2021-03-26 00:14:35,663 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 108 flow [2021-03-26 00:14:35,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:14:35,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:14:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 823 transitions. [2021-03-26 00:14:35,665 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8528497409326425 [2021-03-26 00:14:35,665 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 823 transitions. [2021-03-26 00:14:35,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 823 transitions. [2021-03-26 00:14:35,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:14:35,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 823 transitions. [2021-03-26 00:14:35,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:35,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:35,669 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:35,669 INFO L185 Difference]: Start difference. First operand has 30 places, 19 transitions, 56 flow. Second operand 5 states and 823 transitions. [2021-03-26 00:14:35,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 108 flow [2021-03-26 00:14:35,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:14:35,670 INFO L241 Difference]: Finished difference. Result has 35 places, 22 transitions, 88 flow [2021-03-26 00:14:35,670 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2021-03-26 00:14:35,670 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -15 predicate places. [2021-03-26 00:14:35,671 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:35,671 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 88 flow [2021-03-26 00:14:35,671 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 22 transitions, 88 flow [2021-03-26 00:14:35,671 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 88 flow [2021-03-26 00:14:35,680 INFO L129 PetriNetUnfolder]: 23/61 cut-off events. [2021-03-26 00:14:35,680 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-03-26 00:14:35,682 INFO L84 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 61 events. 23/61 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 176 event pairs, 11 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 154. Up to 38 conditions per place. [2021-03-26 00:14:35,684 INFO L142 LiptonReduction]: Number of co-enabled transitions 176 [2021-03-26 00:14:35,718 INFO L154 LiptonReduction]: Checked pairs total: 136 [2021-03-26 00:14:35,718 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:14:35,718 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 47 [2021-03-26 00:14:35,720 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 88 flow [2021-03-26 00:14:35,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:35,750 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:35,751 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:35,751 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:14:35,751 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:35,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:35,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1571053480, now seen corresponding path program 1 times [2021-03-26 00:14:35,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:35,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617946715] [2021-03-26 00:14:35,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:14:35,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:35,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:35,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:35,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:35,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:35,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:35,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:35,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:14:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:14:35,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617946715] [2021-03-26 00:14:35,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:14:35,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:14:35,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912881626] [2021-03-26 00:14:35,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:14:35,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:14:35,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:14:35,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:14:35,852 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 193 [2021-03-26 00:14:35,853 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 161.8) internal successors, (809), 5 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:35,853 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:14:35,853 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 193 [2021-03-26 00:14:35,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:14:35,908 INFO L129 PetriNetUnfolder]: 16/55 cut-off events. [2021-03-26 00:14:35,909 INFO L130 PetriNetUnfolder]: For 45/54 co-relation queries the response was YES. [2021-03-26 00:14:35,909 INFO L84 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 55 events. 16/55 cut-off events. For 45/54 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 153 event pairs, 2 based on Foata normal form. 12/66 useless extension candidates. Maximal degree in co-relation 174. Up to 35 conditions per place. [2021-03-26 00:14:35,909 INFO L132 encePairwiseOnDemand]: 187/193 looper letters, 5 selfloop transitions, 7 changer transitions 7/32 dead transitions. [2021-03-26 00:14:35,909 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 184 flow [2021-03-26 00:14:35,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:14:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:14:35,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 987 transitions. [2021-03-26 00:14:35,913 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8523316062176166 [2021-03-26 00:14:35,913 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 987 transitions. [2021-03-26 00:14:35,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 987 transitions. [2021-03-26 00:14:35,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:14:35,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 987 transitions. [2021-03-26 00:14:35,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 164.5) internal successors, (987), 6 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:35,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:35,917 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:35,917 INFO L185 Difference]: Start difference. First operand has 33 places, 22 transitions, 88 flow. Second operand 6 states and 987 transitions. [2021-03-26 00:14:35,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 32 transitions, 184 flow [2021-03-26 00:14:35,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 178 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:14:35,919 INFO L241 Difference]: Finished difference. Result has 39 places, 25 transitions, 138 flow [2021-03-26 00:14:35,920 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2021-03-26 00:14:35,920 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2021-03-26 00:14:35,920 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:35,920 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 25 transitions, 138 flow [2021-03-26 00:14:35,925 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 25 transitions, 138 flow [2021-03-26 00:14:35,926 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 25 transitions, 138 flow [2021-03-26 00:14:35,933 INFO L129 PetriNetUnfolder]: 11/43 cut-off events. [2021-03-26 00:14:35,934 INFO L130 PetriNetUnfolder]: For 70/76 co-relation queries the response was YES. [2021-03-26 00:14:35,934 INFO L84 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 43 events. 11/43 cut-off events. For 70/76 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 84 event pairs, 2 based on Foata normal form. 3/45 useless extension candidates. Maximal degree in co-relation 141. Up to 23 conditions per place. [2021-03-26 00:14:35,934 INFO L142 LiptonReduction]: Number of co-enabled transitions 176 [2021-03-26 00:14:35,936 INFO L154 LiptonReduction]: Checked pairs total: 166 [2021-03-26 00:14:35,936 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:14:35,936 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-03-26 00:14:35,939 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 138 flow [2021-03-26 00:14:35,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 161.8) internal successors, (809), 5 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:35,940 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:35,940 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:35,940 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:14:35,941 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:35,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:35,941 INFO L82 PathProgramCache]: Analyzing trace with hash -834450315, now seen corresponding path program 1 times [2021-03-26 00:14:35,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:35,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83618591] [2021-03-26 00:14:35,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:14:36,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:36,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:36,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:36,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:36,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:36,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:36,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:36,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:36,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:36,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:14:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:14:36,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83618591] [2021-03-26 00:14:36,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:14:36,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:14:36,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483692071] [2021-03-26 00:14:36,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:14:36,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:14:36,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:14:36,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:14:36,030 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 193 [2021-03-26 00:14:36,030 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 161.83333333333334) internal successors, (971), 6 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:36,031 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:14:36,031 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 193 [2021-03-26 00:14:36,031 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:14:36,074 INFO L129 PetriNetUnfolder]: 7/34 cut-off events. [2021-03-26 00:14:36,074 INFO L130 PetriNetUnfolder]: For 86/106 co-relation queries the response was YES. [2021-03-26 00:14:36,074 INFO L84 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 34 events. 7/34 cut-off events. For 86/106 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 14/47 useless extension candidates. Maximal degree in co-relation 125. Up to 20 conditions per place. [2021-03-26 00:14:36,074 INFO L132 encePairwiseOnDemand]: 187/193 looper letters, 2 selfloop transitions, 10 changer transitions 4/29 dead transitions. [2021-03-26 00:14:36,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 206 flow [2021-03-26 00:14:36,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:14:36,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:14:36,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1145 transitions. [2021-03-26 00:14:36,077 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.847520355292376 [2021-03-26 00:14:36,077 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1145 transitions. [2021-03-26 00:14:36,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1145 transitions. [2021-03-26 00:14:36,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:14:36,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1145 transitions. [2021-03-26 00:14:36,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 163.57142857142858) internal successors, (1145), 7 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:36,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:36,081 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:36,082 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 138 flow. Second operand 7 states and 1145 transitions. [2021-03-26 00:14:36,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 206 flow [2021-03-26 00:14:36,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 162 flow, removed 16 selfloop flow, removed 6 redundant places. [2021-03-26 00:14:36,085 INFO L241 Difference]: Finished difference. Result has 40 places, 25 transitions, 132 flow [2021-03-26 00:14:36,085 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=132, PETRI_PLACES=40, PETRI_TRANSITIONS=25} [2021-03-26 00:14:36,085 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2021-03-26 00:14:36,085 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:36,085 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 25 transitions, 132 flow [2021-03-26 00:14:36,086 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 25 transitions, 132 flow [2021-03-26 00:14:36,086 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 25 transitions, 132 flow [2021-03-26 00:14:36,089 INFO L129 PetriNetUnfolder]: 5/28 cut-off events. [2021-03-26 00:14:36,089 INFO L130 PetriNetUnfolder]: For 35/38 co-relation queries the response was YES. [2021-03-26 00:14:36,090 INFO L84 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 28 events. 5/28 cut-off events. For 35/38 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 1/28 useless extension candidates. Maximal degree in co-relation 73. Up to 11 conditions per place. [2021-03-26 00:14:36,090 INFO L142 LiptonReduction]: Number of co-enabled transitions 132 [2021-03-26 00:14:36,358 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:14:36,476 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:14:36,787 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-26 00:14:36,908 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-26 00:14:36,911 INFO L154 LiptonReduction]: Checked pairs total: 432 [2021-03-26 00:14:36,911 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:14:36,911 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 826 [2021-03-26 00:14:36,911 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 128 flow [2021-03-26 00:14:36,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 161.83333333333334) internal successors, (971), 6 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:36,912 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:36,912 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-26 00:14:36,912 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:14:36,912 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:36,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:36,912 INFO L82 PathProgramCache]: Analyzing trace with hash 561730560, now seen corresponding path program 1 times [2021-03-26 00:14:36,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:36,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805879352] [2021-03-26 00:14:36,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:14:36,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:36,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:14:36,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:36,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:36,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:36,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:36,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:14:36,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805879352] [2021-03-26 00:14:36,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:14:36,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:14:36,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581370592] [2021-03-26 00:14:36,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:14:36,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:14:36,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:14:36,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:14:36,947 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 195 [2021-03-26 00:14:36,947 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:36,947 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:14:36,947 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 195 [2021-03-26 00:14:36,947 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:14:36,961 INFO L129 PetriNetUnfolder]: 10/40 cut-off events. [2021-03-26 00:14:36,961 INFO L130 PetriNetUnfolder]: For 127/143 co-relation queries the response was YES. [2021-03-26 00:14:36,961 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 40 events. 10/40 cut-off events. For 127/143 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 86 event pairs, 0 based on Foata normal form. 4/38 useless extension candidates. Maximal degree in co-relation 122. Up to 20 conditions per place. [2021-03-26 00:14:36,961 INFO L132 encePairwiseOnDemand]: 192/195 looper letters, 3 selfloop transitions, 1 changer transitions 1/24 dead transitions. [2021-03-26 00:14:36,962 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 24 transitions, 140 flow [2021-03-26 00:14:36,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:14:36,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:14:36,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 662 transitions. [2021-03-26 00:14:36,963 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8487179487179487 [2021-03-26 00:14:36,963 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 662 transitions. [2021-03-26 00:14:36,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 662 transitions. [2021-03-26 00:14:36,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:14:36,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 662 transitions. [2021-03-26 00:14:36,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 165.5) internal successors, (662), 4 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:36,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:36,965 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:36,966 INFO L185 Difference]: Start difference. First operand has 36 places, 23 transitions, 128 flow. Second operand 4 states and 662 transitions. [2021-03-26 00:14:36,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 24 transitions, 140 flow [2021-03-26 00:14:36,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 102 flow, removed 12 selfloop flow, removed 6 redundant places. [2021-03-26 00:14:36,967 INFO L241 Difference]: Finished difference. Result has 35 places, 23 transitions, 97 flow [2021-03-26 00:14:36,967 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=90, 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=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2021-03-26 00:14:36,967 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -15 predicate places. [2021-03-26 00:14:36,967 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:36,967 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 23 transitions, 97 flow [2021-03-26 00:14:36,967 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 23 transitions, 97 flow [2021-03-26 00:14:36,967 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 23 transitions, 97 flow [2021-03-26 00:14:36,970 INFO L129 PetriNetUnfolder]: 6/31 cut-off events. [2021-03-26 00:14:36,970 INFO L130 PetriNetUnfolder]: For 25/26 co-relation queries the response was YES. [2021-03-26 00:14:36,970 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 31 events. 6/31 cut-off events. For 25/26 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 58 event pairs, 0 based on Foata normal form. 1/29 useless extension candidates. Maximal degree in co-relation 67. Up to 10 conditions per place. [2021-03-26 00:14:36,971 INFO L142 LiptonReduction]: Number of co-enabled transitions 122 [2021-03-26 00:14:37,528 WARN L205 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 182 [2021-03-26 00:14:37,798 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-26 00:14:38,919 WARN L205 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 306 DAG size of output: 262 [2021-03-26 00:14:39,410 WARN L205 SmtUtils]: Spent 489.00 ms on a formula simplification that was a NOOP. DAG size: 259 [2021-03-26 00:14:39,522 INFO L154 LiptonReduction]: Checked pairs total: 160 [2021-03-26 00:14:39,522 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:14:39,522 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2555 [2021-03-26 00:14:39,523 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 95 flow [2021-03-26 00:14:39,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:39,523 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:39,523 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:39,523 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:14:39,523 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:39,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:39,524 INFO L82 PathProgramCache]: Analyzing trace with hash -83084768, now seen corresponding path program 1 times [2021-03-26 00:14:39,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:39,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977061277] [2021-03-26 00:14:39,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:14:39,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:39,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:14:39,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:39,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:39,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:39,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:14:39,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977061277] [2021-03-26 00:14:39,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:14:39,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:14:39,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746653003] [2021-03-26 00:14:39,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:14:39,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:14:39,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:14:39,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:14:39,602 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 196 [2021-03-26 00:14:39,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:39,602 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:14:39,602 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 196 [2021-03-26 00:14:39,602 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:14:39,617 INFO L129 PetriNetUnfolder]: 12/48 cut-off events. [2021-03-26 00:14:39,617 INFO L130 PetriNetUnfolder]: For 103/114 co-relation queries the response was YES. [2021-03-26 00:14:39,617 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 48 events. 12/48 cut-off events. For 103/114 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 117 event pairs, 0 based on Foata normal form. 6/49 useless extension candidates. Maximal degree in co-relation 116. Up to 18 conditions per place. [2021-03-26 00:14:39,617 INFO L132 encePairwiseOnDemand]: 193/196 looper letters, 3 selfloop transitions, 1 changer transitions 1/23 dead transitions. [2021-03-26 00:14:39,617 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 23 transitions, 107 flow [2021-03-26 00:14:39,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:14:39,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:14:39,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 674 transitions. [2021-03-26 00:14:39,619 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8596938775510204 [2021-03-26 00:14:39,619 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 674 transitions. [2021-03-26 00:14:39,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 674 transitions. [2021-03-26 00:14:39,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:14:39,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 674 transitions. [2021-03-26 00:14:39,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:39,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:39,622 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:39,622 INFO L185 Difference]: Start difference. First operand has 33 places, 22 transitions, 95 flow. Second operand 4 states and 674 transitions. [2021-03-26 00:14:39,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 23 transitions, 107 flow [2021-03-26 00:14:39,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 23 transitions, 104 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:14:39,624 INFO L241 Difference]: Finished difference. Result has 36 places, 22 transitions, 99 flow [2021-03-26 00:14:39,624 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2021-03-26 00:14:39,624 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -14 predicate places. [2021-03-26 00:14:39,624 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:39,624 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 22 transitions, 99 flow [2021-03-26 00:14:39,624 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 22 transitions, 99 flow [2021-03-26 00:14:39,624 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 22 transitions, 99 flow [2021-03-26 00:14:39,629 INFO L129 PetriNetUnfolder]: 7/36 cut-off events. [2021-03-26 00:14:39,629 INFO L130 PetriNetUnfolder]: For 29/30 co-relation queries the response was YES. [2021-03-26 00:14:39,629 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 36 events. 7/36 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 58 event pairs, 0 based on Foata normal form. 1/35 useless extension candidates. Maximal degree in co-relation 85. Up to 12 conditions per place. [2021-03-26 00:14:39,629 INFO L142 LiptonReduction]: Number of co-enabled transitions 92 [2021-03-26 00:14:39,744 INFO L154 LiptonReduction]: Checked pairs total: 107 [2021-03-26 00:14:39,744 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:14:39,744 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 120 [2021-03-26 00:14:39,744 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 97 flow [2021-03-26 00:14:39,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:39,745 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:39,745 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:39,745 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:14:39,746 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:39,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:39,746 INFO L82 PathProgramCache]: Analyzing trace with hash 583184517, now seen corresponding path program 1 times [2021-03-26 00:14:39,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:39,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265068064] [2021-03-26 00:14:39,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:14:39,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:39,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:14:39,818 INFO L142 QuantifierPusher]: treesize reduction 9, result has 62.5 percent of original size [2021-03-26 00:14:39,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 00:14:39,831 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-03-26 00:14:39,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 00:14:39,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:39,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:39,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:14:39,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265068064] [2021-03-26 00:14:39,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:14:39,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:14:39,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94816393] [2021-03-26 00:14:39,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:14:39,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:14:39,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:14:39,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:14:39,852 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 197 [2021-03-26 00:14:39,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 21 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:39,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:14:39,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 197 [2021-03-26 00:14:39,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:14:39,894 INFO L129 PetriNetUnfolder]: 15/66 cut-off events. [2021-03-26 00:14:39,894 INFO L130 PetriNetUnfolder]: For 190/207 co-relation queries the response was YES. [2021-03-26 00:14:39,894 INFO L84 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 66 events. 15/66 cut-off events. For 190/207 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 227 event pairs, 0 based on Foata normal form. 11/70 useless extension candidates. Maximal degree in co-relation 176. Up to 24 conditions per place. [2021-03-26 00:14:39,895 INFO L132 encePairwiseOnDemand]: 193/197 looper letters, 3 selfloop transitions, 2 changer transitions 3/24 dead transitions. [2021-03-26 00:14:39,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 24 transitions, 123 flow [2021-03-26 00:14:39,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:14:39,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:14:39,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 744 transitions. [2021-03-26 00:14:39,896 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7553299492385787 [2021-03-26 00:14:39,896 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 744 transitions. [2021-03-26 00:14:39,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 744 transitions. [2021-03-26 00:14:39,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:14:39,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 744 transitions. [2021-03-26 00:14:39,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:39,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:39,899 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:39,899 INFO L185 Difference]: Start difference. First operand has 34 places, 21 transitions, 97 flow. Second operand 5 states and 744 transitions. [2021-03-26 00:14:39,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 24 transitions, 123 flow [2021-03-26 00:14:39,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 24 transitions, 120 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:14:39,900 INFO L241 Difference]: Finished difference. Result has 38 places, 21 transitions, 104 flow [2021-03-26 00:14:39,900 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=38, PETRI_TRANSITIONS=21} [2021-03-26 00:14:39,901 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -12 predicate places. [2021-03-26 00:14:39,901 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:39,901 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 21 transitions, 104 flow [2021-03-26 00:14:39,901 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 21 transitions, 104 flow [2021-03-26 00:14:39,901 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 21 transitions, 104 flow [2021-03-26 00:14:39,905 INFO L129 PetriNetUnfolder]: 7/36 cut-off events. [2021-03-26 00:14:39,905 INFO L130 PetriNetUnfolder]: For 34/35 co-relation queries the response was YES. [2021-03-26 00:14:39,905 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 36 events. 7/36 cut-off events. For 34/35 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 0 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 96. Up to 12 conditions per place. [2021-03-26 00:14:39,905 INFO L142 LiptonReduction]: Number of co-enabled transitions 34 [2021-03-26 00:14:40,053 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-26 00:14:40,388 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2021-03-26 00:14:40,494 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 00:14:40,630 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-26 00:14:40,987 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2021-03-26 00:14:41,111 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-03-26 00:14:41,264 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-26 00:14:41,615 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2021-03-26 00:14:41,727 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-03-26 00:14:42,063 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 00:14:42,323 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 00:14:42,840 WARN L205 SmtUtils]: Spent 514.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 00:14:43,467 WARN L205 SmtUtils]: Spent 626.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 00:14:43,470 INFO L154 LiptonReduction]: Checked pairs total: 23 [2021-03-26 00:14:43,470 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 00:14:43,470 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3569 [2021-03-26 00:14:43,471 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 115 flow [2021-03-26 00:14:43,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:43,471 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:43,471 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:43,471 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:14:43,471 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:43,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:43,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1722912651, now seen corresponding path program 1 times [2021-03-26 00:14:43,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:43,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522590906] [2021-03-26 00:14:43,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:14:43,505 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:14:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:14:43,532 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:14:43,562 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:14:43,562 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:14:43,563 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:14:43,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:14:43 BasicIcfg [2021-03-26 00:14:43,634 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:14:43,634 INFO L168 Benchmark]: Toolchain (without parser) took 14537.30 ms. Allocated memory was 362.8 MB in the beginning and 799.0 MB in the end (delta: 436.2 MB). Free memory was 325.6 MB in the beginning and 695.1 MB in the end (delta: -369.5 MB). Peak memory consumption was 65.7 MB. Max. memory is 16.0 GB. [2021-03-26 00:14:43,634 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 362.8 MB. Free memory was 343.7 MB in the beginning and 343.6 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:14:43,635 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.64 ms. Allocated memory is still 362.8 MB. Free memory was 325.4 MB in the beginning and 322.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:14:43,635 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.47 ms. Allocated memory is still 362.8 MB. Free memory was 322.5 MB in the beginning and 320.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:14:43,635 INFO L168 Benchmark]: Boogie Preprocessor took 21.39 ms. Allocated memory is still 362.8 MB. Free memory was 320.4 MB in the beginning and 318.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:14:43,635 INFO L168 Benchmark]: RCFGBuilder took 1032.75 ms. Allocated memory is still 362.8 MB. Free memory was 318.3 MB in the beginning and 326.9 MB in the end (delta: -8.6 MB). Peak memory consumption was 169.7 MB. Max. memory is 16.0 GB. [2021-03-26 00:14:43,639 INFO L168 Benchmark]: TraceAbstraction took 13096.34 ms. Allocated memory was 362.8 MB in the beginning and 799.0 MB in the end (delta: 436.2 MB). Free memory was 326.9 MB in the beginning and 695.1 MB in the end (delta: -368.2 MB). Peak memory consumption was 69.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:14:43,644 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44 ms. Allocated memory is still 362.8 MB. Free memory was 343.7 MB in the beginning and 343.6 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 348.64 ms. Allocated memory is still 362.8 MB. Free memory was 325.4 MB in the beginning and 322.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 34.47 ms. Allocated memory is still 362.8 MB. Free memory was 322.5 MB in the beginning and 320.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 21.39 ms. Allocated memory is still 362.8 MB. Free memory was 320.4 MB in the beginning and 318.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1032.75 ms. Allocated memory is still 362.8 MB. Free memory was 318.3 MB in the beginning and 326.9 MB in the end (delta: -8.6 MB). Peak memory consumption was 169.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 13096.34 ms. Allocated memory was 362.8 MB in the beginning and 799.0 MB in the end (delta: 436.2 MB). Free memory was 326.9 MB in the beginning and 695.1 MB in the end (delta: -368.2 MB). Peak memory consumption was 69.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2073.1ms, 110 PlacesBefore, 50 PlacesAfterwards, 102 TransitionsBefore, 41 TransitionsAfterwards, 1832 CoEnabledTransitionPairs, 5 FixpointIterations, 29 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 71 TotalNumberOfCompositions, 2848 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1588, positive: 1513, positive conditional: 1513, positive unconditional: 0, negative: 75, negative conditional: 75, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1234, positive: 1202, positive conditional: 0, positive unconditional: 1202, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1234, positive: 1202, positive conditional: 0, positive unconditional: 1202, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1234, positive: 1200, positive conditional: 0, positive unconditional: 1200, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 34, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 182, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 175, negative conditional: 0, negative unconditional: 175, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1588, positive: 311, positive conditional: 311, positive unconditional: 0, negative: 43, negative conditional: 43, negative unconditional: 0, unknown: 1234, unknown conditional: 1234, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 74, Positive conditional cache size: 74, Positive unconditional cache size: 0, Negative cache size: 18, Negative conditional cache size: 18, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1278.6ms, 47 PlacesBefore, 33 PlacesAfterwards, 38 TransitionsBefore, 24 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 5 FixpointIterations, 11 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 1698 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 580, positive: 465, positive conditional: 465, positive unconditional: 0, negative: 115, negative conditional: 115, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, positive: 98, positive conditional: 12, positive unconditional: 86, negative: 20, negative conditional: 1, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 118, positive: 98, positive conditional: 12, positive unconditional: 86, negative: 20, negative conditional: 1, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 118, positive: 92, positive conditional: 0, positive unconditional: 92, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 20, negative conditional: 1, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 100, negative conditional: 28, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 580, positive: 367, positive conditional: 367, positive unconditional: 0, negative: 95, negative conditional: 95, negative unconditional: 0, unknown: 118, unknown conditional: 118, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 103, Positive conditional cache size: 103, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 962.8ms, 36 PlacesBefore, 29 PlacesAfterwards, 22 TransitionsBefore, 19 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 399 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 121, positive: 89, positive conditional: 89, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, positive: 31, positive conditional: 10, positive unconditional: 21, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, positive: 31, positive conditional: 10, positive unconditional: 21, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 37, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 121, positive: 58, positive conditional: 58, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 49, Positive conditional cache size: 49, Positive unconditional cache size: 0, Negative cache size: 20, Negative conditional cache size: 20, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.3ms, 30 PlacesBefore, 30 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 167 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 46, positive: 31, positive conditional: 31, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 10, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 10, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 13, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, positive: 25, positive conditional: 25, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 55, Positive conditional cache size: 55, Positive unconditional cache size: 0, Negative cache size: 24, Negative conditional cache size: 24, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 47.2ms, 35 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 136 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37, positive: 27, positive conditional: 27, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 32, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 37, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 67, Positive conditional cache size: 67, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.4ms, 39 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 166 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 53, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 14, positive unconditional: 4, 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: 18, positive: 18, positive conditional: 14, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 0, positive unconditional: 18, 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: 53, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 85, Positive conditional cache size: 85, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 825.4ms, 40 PlacesBefore, 36 PlacesAfterwards, 25 TransitionsBefore, 23 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 432 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 129, positive: 87, positive conditional: 87, positive unconditional: 0, negative: 42, negative conditional: 42, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 11, positive conditional: 8, positive unconditional: 3, 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: 14, positive: 11, positive conditional: 8, positive unconditional: 3, 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: 14, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 31, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 129, positive: 76, positive conditional: 76, positive unconditional: 0, negative: 39, negative conditional: 39, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 66, Positive conditional cache size: 66, Positive unconditional cache size: 0, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2555.0ms, 35 PlacesBefore, 33 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 160 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 84, positive: 66, positive conditional: 66, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, positive: 34, positive conditional: 16, positive unconditional: 18, 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: 37, positive: 34, positive conditional: 16, positive unconditional: 18, 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: 37, positive: 34, positive conditional: 0, positive unconditional: 34, 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: 109, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 109, negative conditional: 0, negative unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, positive: 32, positive conditional: 32, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 75, Positive conditional cache size: 75, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 119.6ms, 36 PlacesBefore, 34 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 107 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 64, positive: 51, positive conditional: 51, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 20, positive conditional: 6, positive unconditional: 14, 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: 24, positive: 20, positive conditional: 6, positive unconditional: 14, 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: 24, positive: 20, positive conditional: 0, positive unconditional: 20, 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: 94, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 94, negative conditional: 0, negative unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, positive: 31, positive conditional: 31, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 48, Positive conditional cache size: 48, Positive unconditional cache size: 0, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3569.3ms, 38 PlacesBefore, 35 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 34 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 23 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 23, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 14, 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: 14, positive: 14, positive conditional: 14, 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: 14, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, positive: 31, positive conditional: 31, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 23, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 7, Positive conditional cache size: 7, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L723] 0 int b = 0; [L724] 0 _Bool main$tmp_guard0; [L725] 0 _Bool main$tmp_guard1; [L727] 0 int x = 0; [L729] 0 int y = 0; [L731] 0 int z = 0; [L732] 0 _Bool z$flush_delayed; [L733] 0 int z$mem_tmp; [L734] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd1; [L736] 0 _Bool z$r_buff0_thd2; [L737] 0 _Bool z$r_buff0_thd3; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$read_delayed; [L743] 0 int *z$read_delayed_var; [L744] 0 int z$w_buff0; [L745] 0 _Bool z$w_buff0_used; [L746] 0 int z$w_buff1; [L747] 0 _Bool z$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L845] 0 pthread_t t858; [L846] FCALL, FORK 0 pthread_create(&t858, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t859; [L848] FCALL, FORK 0 pthread_create(&t859, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 pthread_t t860; [L850] FCALL, FORK 0 pthread_create(&t860, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z$w_buff1 = z$w_buff0 [L803] 3 z$w_buff0 = 1 [L804] 3 z$w_buff1_used = z$w_buff0_used [L805] 3 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L807] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 3 z$r_buff0_thd3 = (_Bool)1 [L814] 3 a = 1 [L817] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 b = 1 [L756] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L768] 2 x = 1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 z$flush_delayed = weak$$choice2 [L780] 2 z$mem_tmp = z [L781] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L781] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L782] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L782] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0) [L782] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L782] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L783] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L783] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1) [L783] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L783] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L784] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L784] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used) [L784] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L784] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L785] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L785] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L786] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2) [L786] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L786] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L787] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L787] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 __unbuffered_p1_EBX = z [L789] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L789] 2 z = z$flush_delayed ? z$mem_tmp : z [L790] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L823] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L824] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L824] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L825] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L826] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L826] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L827] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L827] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L832] 3 return 0; [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L860] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 104 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 12956.1ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 435.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2127.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 34 SDtfs, 18 SDslu, 19 SDs, 0 SdLazy, 144 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 128.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 92.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=5, InterpolantAutomatonStates: 42, 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: 26.7ms SsaConstructionTime, 293.7ms SatisfiabilityAnalysisTime, 439.8ms InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 468 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...