/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/safe011_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:39:02,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:39:02,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:39:02,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:39:02,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:39:02,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:39:02,200 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:39:02,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:39:02,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:39:02,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:39:02,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:39:02,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:39:02,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:39:02,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:39:02,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:39:02,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:39:02,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:39:02,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:39:02,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:39:02,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:39:02,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:39:02,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:39:02,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:39:02,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:39:02,215 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:39:02,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:39:02,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:39:02,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:39:02,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:39:02,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:39:02,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:39:02,218 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:39:02,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:39:02,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:39:02,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:39:02,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:39:02,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:39:02,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:39:02,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:39:02,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:39:02,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:39:02,222 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:39:02,236 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:39:02,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:39:02,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:39:02,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:39:02,238 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:39:02,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:39:02,238 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:39:02,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:39:02,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:39:02,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:39:02,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:39:02,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:39:02,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:39:02,239 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:39:02,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:39:02,239 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:39:02,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:39:02,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:39:02,240 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:39:02,240 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:39:02,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:39:02,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:39:02,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:39:02,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:39:02,240 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:39:02,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:39:02,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:39:02,241 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:39:02,241 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:39:02,241 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:39:02,241 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:39:02,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:39:02,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:39:02,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:39:02,526 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:39:02,526 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:39:02,527 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i [2021-03-26 00:39:02,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea22777e/9ca5ff8c57624d6dbed8ffd1b3ffef01/FLAGa52d2ecce [2021-03-26 00:39:02,905 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:39:02,905 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i [2021-03-26 00:39:02,929 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea22777e/9ca5ff8c57624d6dbed8ffd1b3ffef01/FLAGa52d2ecce [2021-03-26 00:39:03,283 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea22777e/9ca5ff8c57624d6dbed8ffd1b3ffef01 [2021-03-26 00:39:03,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:39:03,286 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:39:03,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:39:03,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:39:03,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:39:03,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:39:03" (1/1) ... [2021-03-26 00:39:03,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@241ccbdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:03, skipping insertion in model container [2021-03-26 00:39:03,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:39:03" (1/1) ... [2021-03-26 00:39:03,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:39:03,342 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:39:03,421 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/safe011_pso.oepc.i[950,963] [2021-03-26 00:39:03,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:39:03,581 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:39:03,590 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/safe011_pso.oepc.i[950,963] [2021-03-26 00:39:03,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:39:03,671 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:39:03,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:03 WrapperNode [2021-03-26 00:39:03,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:39:03,673 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:39:03,673 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:39:03,673 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:39:03,677 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:39:03" (1/1) ... [2021-03-26 00:39:03,687 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:39:03" (1/1) ... [2021-03-26 00:39:03,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:39:03,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:39:03,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:39:03,707 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:39:03,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:03" (1/1) ... [2021-03-26 00:39:03,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:03" (1/1) ... [2021-03-26 00:39:03,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:03" (1/1) ... [2021-03-26 00:39:03,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:03" (1/1) ... [2021-03-26 00:39:03,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:03" (1/1) ... [2021-03-26 00:39:03,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:03" (1/1) ... [2021-03-26 00:39:03,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:03" (1/1) ... [2021-03-26 00:39:03,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:39:03,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:39:03,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:39:03,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:39:03,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:03" (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:39:03,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:39:03,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:39:03,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:39:03,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:39:03,794 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:39:03,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:39:03,794 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:39:03,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:39:03,794 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:39:03,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:39:03,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:39:03,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:39:03,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:39:03,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:39:03,795 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:39:05,104 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:39:05,105 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:39:05,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:39:05 BoogieIcfgContainer [2021-03-26 00:39:05,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:39:05,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:39:05,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:39:05,110 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:39:05,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:39:03" (1/3) ... [2021-03-26 00:39:05,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a801e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:39:05, skipping insertion in model container [2021-03-26 00:39:05,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:03" (2/3) ... [2021-03-26 00:39:05,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a801e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:39:05, skipping insertion in model container [2021-03-26 00:39:05,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:39:05" (3/3) ... [2021-03-26 00:39:05,112 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_pso.oepc.i [2021-03-26 00:39:05,116 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:39:05,119 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:39:05,119 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:39:05,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,145 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,145 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,145 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,146 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,146 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,146 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,146 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,146 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,150 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,150 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,151 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,151 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,154 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,154 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,154 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,154 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,159 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,159 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,161 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,163 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,164 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,167 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,167 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,167 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,168 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,169 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,169 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:05,170 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:39:05,182 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:39:05,203 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:39:05,203 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:39:05,203 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:39:05,203 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:39:05,203 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:39:05,203 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:39:05,203 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:39:05,203 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:39:05,216 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 00:39:05,250 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 00:39:05,250 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:39:05,259 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 00:39:05,259 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 00:39:05,265 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-26 00:39:05,266 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:05,273 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 00:39:05,275 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 00:39:05,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-26 00:39:05,297 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 00:39:05,298 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:39:05,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 00:39:05,300 INFO L142 LiptonReduction]: Number of co-enabled transitions 1694 [2021-03-26 00:39:06,707 WARN L205 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2021-03-26 00:39:06,983 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-26 00:39:08,194 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-03-26 00:39:08,739 WARN L205 SmtUtils]: Spent 541.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 00:39:08,915 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:39:09,316 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 00:39:09,446 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:39:10,305 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 00:39:10,574 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 00:39:11,157 WARN L205 SmtUtils]: Spent 581.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 00:39:11,736 WARN L205 SmtUtils]: Spent 577.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 00:39:11,924 INFO L154 LiptonReduction]: Checked pairs total: 3065 [2021-03-26 00:39:11,924 INFO L156 LiptonReduction]: Total number of compositions: 64 [2021-03-26 00:39:11,926 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6661 [2021-03-26 00:39:11,932 INFO L129 PetriNetUnfolder]: 0/12 cut-off events. [2021-03-26 00:39:11,932 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:39:11,932 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:11,932 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:11,932 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:11,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:11,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1571617397, now seen corresponding path program 1 times [2021-03-26 00:39:11,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:11,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121148364] [2021-03-26 00:39:11,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:12,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:12,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:39:12,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:12,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:39:12,120 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:39:12,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121148364] [2021-03-26 00:39:12,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:12,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:39:12,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32128738] [2021-03-26 00:39:12,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:39:12,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:12,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:39:12,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:39:12,134 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 161 [2021-03-26 00:39:12,137 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states 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:39:12,137 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:12,137 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 161 [2021-03-26 00:39:12,138 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:12,212 INFO L129 PetriNetUnfolder]: 69/200 cut-off events. [2021-03-26 00:39:12,212 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:39:12,213 INFO L84 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 200 events. 69/200 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 953 event pairs, 54 based on Foata normal form. 11/193 useless extension candidates. Maximal degree in co-relation 309. Up to 89 conditions per place. [2021-03-26 00:39:12,214 INFO L132 encePairwiseOnDemand]: 157/161 looper letters, 9 selfloop transitions, 2 changer transitions 5/41 dead transitions. [2021-03-26 00:39:12,214 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 117 flow [2021-03-26 00:39:12,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:39:12,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:39:12,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2021-03-26 00:39:12,223 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8964803312629399 [2021-03-26 00:39:12,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2021-03-26 00:39:12,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2021-03-26 00:39:12,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:12,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2021-03-26 00:39:12,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states 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:39:12,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states 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:39:12,232 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states 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:39:12,233 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 433 transitions. [2021-03-26 00:39:12,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 117 flow [2021-03-26 00:39:12,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 114 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:39:12,240 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 74 flow [2021-03-26 00:39:12,241 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2021-03-26 00:39:12,241 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-26 00:39:12,242 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:12,242 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-26 00:39:12,242 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-26 00:39:12,242 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2021-03-26 00:39:12,245 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-26 00:39:12,245 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:39:12,246 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:39:12,246 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-26 00:39:13,058 WARN L205 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 186 [2021-03-26 00:39:13,321 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 00:39:13,881 WARN L205 SmtUtils]: Spent 557.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-26 00:39:14,440 WARN L205 SmtUtils]: Spent 558.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-26 00:39:15,028 INFO L154 LiptonReduction]: Checked pairs total: 942 [2021-03-26 00:39:15,028 INFO L156 LiptonReduction]: Total number of compositions: 8 [2021-03-26 00:39:15,028 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2786 [2021-03-26 00:39:15,029 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-26 00:39:15,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states 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:39:15,030 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:15,030 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:39:15,030 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:39:15,030 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:15,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:15,030 INFO L82 PathProgramCache]: Analyzing trace with hash -72729481, now seen corresponding path program 1 times [2021-03-26 00:39:15,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:15,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583772962] [2021-03-26 00:39:15,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:15,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:15,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:39:15,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:15,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:39:15,122 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:39:15,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:39:15,125 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:39:15,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583772962] [2021-03-26 00:39:15,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:15,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:39:15,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419177462] [2021-03-26 00:39:15,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:39:15,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:15,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:39:15,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:39:15,128 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 169 [2021-03-26 00:39:15,129 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:15,129 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:15,129 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 169 [2021-03-26 00:39:15,129 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:15,139 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-26 00:39:15,139 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:39:15,140 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:39:15,140 INFO L132 encePairwiseOnDemand]: 166/169 looper letters, 1 selfloop transitions, 2 changer transitions 1/24 dead transitions. [2021-03-26 00:39:15,140 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 64 flow [2021-03-26 00:39:15,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:39:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:39:15,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2021-03-26 00:39:15,142 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8717948717948718 [2021-03-26 00:39:15,142 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2021-03-26 00:39:15,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2021-03-26 00:39:15,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:15,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2021-03-26 00:39:15,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states 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:39:15,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states 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:39:15,145 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states 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:39:15,145 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states and 442 transitions. [2021-03-26 00:39:15,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 64 flow [2021-03-26 00:39:15,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 60 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:39:15,145 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 60 flow [2021-03-26 00:39:15,146 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, 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=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2021-03-26 00:39:15,146 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -14 predicate places. [2021-03-26 00:39:15,146 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:15,146 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 60 flow [2021-03-26 00:39:15,146 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 60 flow [2021-03-26 00:39:15,147 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 60 flow [2021-03-26 00:39:15,149 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 00:39:15,149 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:39:15,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:39:15,149 INFO L142 LiptonReduction]: Number of co-enabled transitions 214 [2021-03-26 00:39:15,611 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 00:39:15,731 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 00:39:15,993 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 00:39:16,110 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 00:39:16,113 INFO L154 LiptonReduction]: Checked pairs total: 777 [2021-03-26 00:39:16,113 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:39:16,113 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 967 [2021-03-26 00:39:16,114 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2021-03-26 00:39:16,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:16,114 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:16,114 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:16,114 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:39:16,114 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:16,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:16,115 INFO L82 PathProgramCache]: Analyzing trace with hash -721798440, now seen corresponding path program 1 times [2021-03-26 00:39:16,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:16,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661404562] [2021-03-26 00:39:16,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:16,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:16,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:39:16,175 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:39:16,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661404562] [2021-03-26 00:39:16,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:16,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:39:16,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633909752] [2021-03-26 00:39:16,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:39:16,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:16,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:39:16,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:39:16,177 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 171 [2021-03-26 00:39:16,177 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states 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:39:16,177 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:16,177 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 171 [2021-03-26 00:39:16,177 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:16,188 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-03-26 00:39:16,188 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-26 00:39:16,189 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 33 events. 3/33 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 1 based on Foata normal form. 1/32 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2021-03-26 00:39:16,189 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 3 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2021-03-26 00:39:16,189 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 23 transitions, 72 flow [2021-03-26 00:39:16,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:39:16,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:39:16,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2021-03-26 00:39:16,193 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8791423001949318 [2021-03-26 00:39:16,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 451 transitions. [2021-03-26 00:39:16,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 451 transitions. [2021-03-26 00:39:16,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:16,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 451 transitions. [2021-03-26 00:39:16,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states 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:39:16,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states 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:39:16,197 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states 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:39:16,197 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 451 transitions. [2021-03-26 00:39:16,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 23 transitions, 72 flow [2021-03-26 00:39:16,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:39:16,198 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 71 flow [2021-03-26 00:39:16,198 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2021-03-26 00:39:16,198 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -16 predicate places. [2021-03-26 00:39:16,198 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:16,199 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 23 transitions, 71 flow [2021-03-26 00:39:16,199 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 71 flow [2021-03-26 00:39:16,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 71 flow [2021-03-26 00:39:16,203 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-03-26 00:39:16,204 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 00:39:16,204 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 33 events. 3/33 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2021-03-26 00:39:16,204 INFO L142 LiptonReduction]: Number of co-enabled transitions 240 [2021-03-26 00:39:16,304 INFO L154 LiptonReduction]: Checked pairs total: 235 [2021-03-26 00:39:16,305 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:39:16,305 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 107 [2021-03-26 00:39:16,308 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 71 flow [2021-03-26 00:39:16,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states 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:39:16,311 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:16,311 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:16,311 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:39:16,311 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:16,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:16,313 INFO L82 PathProgramCache]: Analyzing trace with hash 452263556, now seen corresponding path program 1 times [2021-03-26 00:39:16,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:16,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059954413] [2021-03-26 00:39:16,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:16,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:16,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:39:16,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:16,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:39:16,379 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:39:16,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059954413] [2021-03-26 00:39:16,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:16,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:39:16,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881641541] [2021-03-26 00:39:16,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:39:16,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:16,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:39:16,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:39:16,382 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 171 [2021-03-26 00:39:16,382 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states 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:39:16,383 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:16,383 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 171 [2021-03-26 00:39:16,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:16,405 INFO L129 PetriNetUnfolder]: 2/42 cut-off events. [2021-03-26 00:39:16,405 INFO L130 PetriNetUnfolder]: For 15/18 co-relation queries the response was YES. [2021-03-26 00:39:16,406 INFO L84 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 42 events. 2/42 cut-off events. For 15/18 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 4/45 useless extension candidates. Maximal degree in co-relation 67. Up to 8 conditions per place. [2021-03-26 00:39:16,406 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 2 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2021-03-26 00:39:16,406 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 84 flow [2021-03-26 00:39:16,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:39:16,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:39:16,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 587 transitions. [2021-03-26 00:39:16,409 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8581871345029239 [2021-03-26 00:39:16,409 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 587 transitions. [2021-03-26 00:39:16,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 587 transitions. [2021-03-26 00:39:16,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:16,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 587 transitions. [2021-03-26 00:39:16,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:16,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:16,411 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:16,411 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 71 flow. Second operand 4 states and 587 transitions. [2021-03-26 00:39:16,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 84 flow [2021-03-26 00:39:16,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 24 transitions, 81 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:39:16,412 INFO L241 Difference]: Finished difference. Result has 36 places, 24 transitions, 87 flow [2021-03-26 00:39:16,412 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2021-03-26 00:39:16,413 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -12 predicate places. [2021-03-26 00:39:16,413 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:16,413 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 24 transitions, 87 flow [2021-03-26 00:39:16,413 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 24 transitions, 87 flow [2021-03-26 00:39:16,413 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 24 transitions, 87 flow [2021-03-26 00:39:16,418 INFO L129 PetriNetUnfolder]: 2/42 cut-off events. [2021-03-26 00:39:16,418 INFO L130 PetriNetUnfolder]: For 10/14 co-relation queries the response was YES. [2021-03-26 00:39:16,418 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 42 events. 2/42 cut-off events. For 10/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 1/42 useless extension candidates. Maximal degree in co-relation 73. Up to 8 conditions per place. [2021-03-26 00:39:16,419 INFO L142 LiptonReduction]: Number of co-enabled transitions 248 [2021-03-26 00:39:16,421 INFO L154 LiptonReduction]: Checked pairs total: 243 [2021-03-26 00:39:16,421 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:39:16,421 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8 [2021-03-26 00:39:16,422 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 87 flow [2021-03-26 00:39:16,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states 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:39:16,423 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:16,423 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:16,423 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:39:16,423 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:16,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:16,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1388593770, now seen corresponding path program 1 times [2021-03-26 00:39:16,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:16,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283891741] [2021-03-26 00:39:16,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:16,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:16,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:39:16,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:16,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:39:16,507 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:39:16,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283891741] [2021-03-26 00:39:16,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:16,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:39:16,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192777020] [2021-03-26 00:39:16,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:39:16,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:16,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:39:16,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:39:16,509 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 171 [2021-03-26 00:39:16,509 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states 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:39:16,509 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:16,509 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 171 [2021-03-26 00:39:16,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:16,562 INFO L129 PetriNetUnfolder]: 151/317 cut-off events. [2021-03-26 00:39:16,562 INFO L130 PetriNetUnfolder]: For 194/217 co-relation queries the response was YES. [2021-03-26 00:39:16,563 INFO L84 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 317 events. 151/317 cut-off events. For 194/217 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1610 event pairs, 52 based on Foata normal form. 11/307 useless extension candidates. Maximal degree in co-relation 684. Up to 243 conditions per place. [2021-03-26 00:39:16,565 INFO L132 encePairwiseOnDemand]: 166/171 looper letters, 9 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2021-03-26 00:39:16,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 123 flow [2021-03-26 00:39:16,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:39:16,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:39:16,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2021-03-26 00:39:16,566 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8226120857699805 [2021-03-26 00:39:16,566 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2021-03-26 00:39:16,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2021-03-26 00:39:16,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:16,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2021-03-26 00:39:16,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states 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:39:16,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states 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:39:16,569 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states 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:39:16,569 INFO L185 Difference]: Start difference. First operand has 36 places, 24 transitions, 87 flow. Second operand 3 states and 422 transitions. [2021-03-26 00:39:16,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 123 flow [2021-03-26 00:39:16,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 119 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:39:16,571 INFO L241 Difference]: Finished difference. Result has 37 places, 27 transitions, 109 flow [2021-03-26 00:39:16,571 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2021-03-26 00:39:16,571 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -11 predicate places. [2021-03-26 00:39:16,571 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:16,571 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 27 transitions, 109 flow [2021-03-26 00:39:16,571 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 27 transitions, 109 flow [2021-03-26 00:39:16,572 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 27 transitions, 109 flow [2021-03-26 00:39:16,581 INFO L129 PetriNetUnfolder]: 27/96 cut-off events. [2021-03-26 00:39:16,582 INFO L130 PetriNetUnfolder]: For 84/89 co-relation queries the response was YES. [2021-03-26 00:39:16,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 96 events. 27/96 cut-off events. For 84/89 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 405 event pairs, 8 based on Foata normal form. 2/92 useless extension candidates. Maximal degree in co-relation 218. Up to 52 conditions per place. [2021-03-26 00:39:16,583 INFO L142 LiptonReduction]: Number of co-enabled transitions 276 [2021-03-26 00:39:16,638 INFO L154 LiptonReduction]: Checked pairs total: 124 [2021-03-26 00:39:16,638 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:39:16,639 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 68 [2021-03-26 00:39:16,639 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 109 flow [2021-03-26 00:39:16,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states 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:39:16,640 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:16,640 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:16,640 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:39:16,640 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:16,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:16,640 INFO L82 PathProgramCache]: Analyzing trace with hash -2056140589, now seen corresponding path program 1 times [2021-03-26 00:39:16,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:16,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053790567] [2021-03-26 00:39:16,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:16,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:16,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:39:16,717 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-26 00:39:16,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-26 00:39:16,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:16,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:39:16,741 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:39:16,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053790567] [2021-03-26 00:39:16,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:16,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:39:16,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158600199] [2021-03-26 00:39:16,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:39:16,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:16,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:39:16,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:39:16,743 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 171 [2021-03-26 00:39:16,743 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states 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:39:16,743 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:16,743 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 171 [2021-03-26 00:39:16,743 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:16,819 INFO L129 PetriNetUnfolder]: 165/339 cut-off events. [2021-03-26 00:39:16,819 INFO L130 PetriNetUnfolder]: For 410/512 co-relation queries the response was YES. [2021-03-26 00:39:16,820 INFO L84 FinitePrefix]: Finished finitePrefix Result has 923 conditions, 339 events. 165/339 cut-off events. For 410/512 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1729 event pairs, 47 based on Foata normal form. 27/348 useless extension candidates. Maximal degree in co-relation 908. Up to 248 conditions per place. [2021-03-26 00:39:16,821 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 10 selfloop transitions, 9 changer transitions 0/35 dead transitions. [2021-03-26 00:39:16,821 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 175 flow [2021-03-26 00:39:16,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:39:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:39:16,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2021-03-26 00:39:16,823 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7514619883040936 [2021-03-26 00:39:16,823 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2021-03-26 00:39:16,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2021-03-26 00:39:16,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:16,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2021-03-26 00:39:16,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states 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:39:16,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:16,827 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:16,827 INFO L185 Difference]: Start difference. First operand has 37 places, 27 transitions, 109 flow. Second operand 4 states and 514 transitions. [2021-03-26 00:39:16,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 175 flow [2021-03-26 00:39:16,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 169 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:39:16,831 INFO L241 Difference]: Finished difference. Result has 41 places, 33 transitions, 167 flow [2021-03-26 00:39:16,831 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2021-03-26 00:39:16,831 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2021-03-26 00:39:16,831 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:16,831 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 33 transitions, 167 flow [2021-03-26 00:39:16,831 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 33 transitions, 167 flow [2021-03-26 00:39:16,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 33 transitions, 167 flow [2021-03-26 00:39:16,845 INFO L129 PetriNetUnfolder]: 36/139 cut-off events. [2021-03-26 00:39:16,846 INFO L130 PetriNetUnfolder]: For 259/294 co-relation queries the response was YES. [2021-03-26 00:39:16,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 139 events. 36/139 cut-off events. For 259/294 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 715 event pairs, 9 based on Foata normal form. 6/137 useless extension candidates. Maximal degree in co-relation 365. Up to 67 conditions per place. [2021-03-26 00:39:16,848 INFO L142 LiptonReduction]: Number of co-enabled transitions 322 [2021-03-26 00:39:16,883 INFO L154 LiptonReduction]: Checked pairs total: 133 [2021-03-26 00:39:16,883 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:39:16,884 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 53 [2021-03-26 00:39:16,886 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 167 flow [2021-03-26 00:39:16,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states 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:39:16,887 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:16,887 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:16,887 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:39:16,887 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:16,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:16,887 INFO L82 PathProgramCache]: Analyzing trace with hash -2088259813, now seen corresponding path program 1 times [2021-03-26 00:39:16,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:16,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144846079] [2021-03-26 00:39:16,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:16,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:16,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:39:16,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:16,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:39:16,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:16,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:39:16,966 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:39:16,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144846079] [2021-03-26 00:39:16,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:16,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:39:16,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364842940] [2021-03-26 00:39:16,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:39:16,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:16,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:39:16,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:39:16,968 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 171 [2021-03-26 00:39:16,968 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states 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:39:16,968 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:16,968 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 171 [2021-03-26 00:39:16,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:17,060 INFO L129 PetriNetUnfolder]: 157/333 cut-off events. [2021-03-26 00:39:17,061 INFO L130 PetriNetUnfolder]: For 787/965 co-relation queries the response was YES. [2021-03-26 00:39:17,061 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 333 events. 157/333 cut-off events. For 787/965 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1720 event pairs, 40 based on Foata normal form. 62/380 useless extension candidates. Maximal degree in co-relation 1019. Up to 191 conditions per place. [2021-03-26 00:39:17,062 INFO L132 encePairwiseOnDemand]: 164/171 looper letters, 16 selfloop transitions, 15 changer transitions 0/47 dead transitions. [2021-03-26 00:39:17,063 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 47 transitions, 287 flow [2021-03-26 00:39:17,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:39:17,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:39:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 814 transitions. [2021-03-26 00:39:17,065 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7933723196881092 [2021-03-26 00:39:17,065 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 814 transitions. [2021-03-26 00:39:17,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 814 transitions. [2021-03-26 00:39:17,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:17,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 814 transitions. [2021-03-26 00:39:17,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 0 states have call successors, (0), 0 states 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:39:17,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states 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:39:17,068 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states 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:39:17,068 INFO L185 Difference]: Start difference. First operand has 41 places, 33 transitions, 167 flow. Second operand 6 states and 814 transitions. [2021-03-26 00:39:17,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 47 transitions, 287 flow [2021-03-26 00:39:17,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 287 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:39:17,070 INFO L241 Difference]: Finished difference. Result has 48 places, 40 transitions, 251 flow [2021-03-26 00:39:17,070 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=251, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2021-03-26 00:39:17,070 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2021-03-26 00:39:17,070 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:17,071 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 40 transitions, 251 flow [2021-03-26 00:39:17,071 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 40 transitions, 251 flow [2021-03-26 00:39:17,071 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 40 transitions, 251 flow [2021-03-26 00:39:17,087 INFO L129 PetriNetUnfolder]: 69/191 cut-off events. [2021-03-26 00:39:17,088 INFO L130 PetriNetUnfolder]: For 730/776 co-relation queries the response was YES. [2021-03-26 00:39:17,088 INFO L84 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 191 events. 69/191 cut-off events. For 730/776 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 961 event pairs, 15 based on Foata normal form. 10/195 useless extension candidates. Maximal degree in co-relation 679. Up to 88 conditions per place. [2021-03-26 00:39:17,089 INFO L142 LiptonReduction]: Number of co-enabled transitions 378 [2021-03-26 00:39:17,094 INFO L154 LiptonReduction]: Checked pairs total: 199 [2021-03-26 00:39:17,094 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:39:17,094 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24 [2021-03-26 00:39:17,094 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 251 flow [2021-03-26 00:39:17,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states 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:39:17,095 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:17,095 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:17,095 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:39:17,095 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:17,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:17,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1179416462, now seen corresponding path program 1 times [2021-03-26 00:39:17,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:17,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917104668] [2021-03-26 00:39:17,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:17,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:17,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:39:17,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:17,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 00:39:17,200 INFO L142 QuantifierPusher]: treesize reduction 9, result has 65.4 percent of original size [2021-03-26 00:39:17,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:39:17,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:17,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 00:39:17,220 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:39:17,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917104668] [2021-03-26 00:39:17,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:17,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:39:17,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940981236] [2021-03-26 00:39:17,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:39:17,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:17,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:39:17,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:39:17,223 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 171 [2021-03-26 00:39:17,224 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 251 flow. Second operand has 6 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states 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:39:17,224 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:17,224 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 171 [2021-03-26 00:39:17,224 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:17,339 INFO L129 PetriNetUnfolder]: 194/401 cut-off events. [2021-03-26 00:39:17,340 INFO L130 PetriNetUnfolder]: For 1415/1655 co-relation queries the response was YES. [2021-03-26 00:39:17,341 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1641 conditions, 401 events. 194/401 cut-off events. For 1415/1655 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2152 event pairs, 31 based on Foata normal form. 62/446 useless extension candidates. Maximal degree in co-relation 1619. Up to 268 conditions per place. [2021-03-26 00:39:17,342 INFO L132 encePairwiseOnDemand]: 163/171 looper letters, 24 selfloop transitions, 20 changer transitions 0/60 dead transitions. [2021-03-26 00:39:17,342 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 479 flow [2021-03-26 00:39:17,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:39:17,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:39:17,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2021-03-26 00:39:17,344 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7590643274853801 [2021-03-26 00:39:17,344 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 649 transitions. [2021-03-26 00:39:17,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 649 transitions. [2021-03-26 00:39:17,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:17,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 649 transitions. [2021-03-26 00:39:17,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states 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:39:17,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states 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:39:17,347 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states 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:39:17,347 INFO L185 Difference]: Start difference. First operand has 48 places, 40 transitions, 251 flow. Second operand 5 states and 649 transitions. [2021-03-26 00:39:17,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 479 flow [2021-03-26 00:39:17,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 455 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-03-26 00:39:17,351 INFO L241 Difference]: Finished difference. Result has 54 places, 56 transitions, 440 flow [2021-03-26 00:39:17,351 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=440, PETRI_PLACES=54, PETRI_TRANSITIONS=56} [2021-03-26 00:39:17,351 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2021-03-26 00:39:17,351 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:17,351 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 56 transitions, 440 flow [2021-03-26 00:39:17,352 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 56 transitions, 440 flow [2021-03-26 00:39:17,352 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 56 transitions, 440 flow [2021-03-26 00:39:17,382 INFO L129 PetriNetUnfolder]: 131/332 cut-off events. [2021-03-26 00:39:17,382 INFO L130 PetriNetUnfolder]: For 1881/2016 co-relation queries the response was YES. [2021-03-26 00:39:17,383 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1401 conditions, 332 events. 131/332 cut-off events. For 1881/2016 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1926 event pairs, 9 based on Foata normal form. 19/340 useless extension candidates. Maximal degree in co-relation 1377. Up to 150 conditions per place. [2021-03-26 00:39:17,385 INFO L142 LiptonReduction]: Number of co-enabled transitions 478 [2021-03-26 00:39:17,411 INFO L154 LiptonReduction]: Checked pairs total: 423 [2021-03-26 00:39:17,412 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:39:17,412 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 61 [2021-03-26 00:39:17,412 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 56 transitions, 440 flow [2021-03-26 00:39:17,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states 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:39:17,413 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:17,413 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:17,413 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:39:17,413 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:17,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:17,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1537298943, now seen corresponding path program 1 times [2021-03-26 00:39:17,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:17,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329874001] [2021-03-26 00:39:17,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:17,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:17,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:39:17,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:17,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:39:17,482 INFO L142 QuantifierPusher]: treesize reduction 37, result has 43.9 percent of original size [2021-03-26 00:39:17,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 00:39:17,498 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.4 percent of original size [2021-03-26 00:39:17,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 00:39:17,519 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:39:17,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329874001] [2021-03-26 00:39:17,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:17,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:39:17,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444381798] [2021-03-26 00:39:17,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:39:17,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:17,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:39:17,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:39:17,521 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 171 [2021-03-26 00:39:17,522 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 56 transitions, 440 flow. Second operand has 6 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states 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:39:17,523 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:17,523 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 171 [2021-03-26 00:39:17,523 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:17,636 INFO L129 PetriNetUnfolder]: 189/411 cut-off events. [2021-03-26 00:39:17,636 INFO L130 PetriNetUnfolder]: For 1861/2207 co-relation queries the response was YES. [2021-03-26 00:39:17,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1856 conditions, 411 events. 189/411 cut-off events. For 1861/2207 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2301 event pairs, 52 based on Foata normal form. 56/450 useless extension candidates. Maximal degree in co-relation 1830. Up to 263 conditions per place. [2021-03-26 00:39:17,639 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 33 selfloop transitions, 11 changer transitions 0/60 dead transitions. [2021-03-26 00:39:17,639 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 552 flow [2021-03-26 00:39:17,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:39:17,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:39:17,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2021-03-26 00:39:17,641 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7660818713450293 [2021-03-26 00:39:17,641 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 524 transitions. [2021-03-26 00:39:17,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 524 transitions. [2021-03-26 00:39:17,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:17,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 524 transitions. [2021-03-26 00:39:17,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states 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:39:17,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:17,643 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:17,643 INFO L185 Difference]: Start difference. First operand has 54 places, 56 transitions, 440 flow. Second operand 4 states and 524 transitions. [2021-03-26 00:39:17,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 552 flow [2021-03-26 00:39:17,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 60 transitions, 548 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-03-26 00:39:17,648 INFO L241 Difference]: Finished difference. Result has 58 places, 56 transitions, 466 flow [2021-03-26 00:39:17,648 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=466, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2021-03-26 00:39:17,648 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2021-03-26 00:39:17,648 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:17,648 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 56 transitions, 466 flow [2021-03-26 00:39:17,648 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 56 transitions, 466 flow [2021-03-26 00:39:17,649 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 56 transitions, 466 flow [2021-03-26 00:39:17,677 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1026] L834-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse17 (= 0 (mod v_~z$w_buff1_used~0_459 256))) (.cse18 (= (mod v_~z$r_buff1_thd0~0_258 256) 0)) (.cse1 (= (mod v_~z$r_buff0_thd0~0_319 256) 0))) (let ((.cse6 (= (mod v_~weak$$choice2~0_96 256) 0)) (.cse0 (not .cse1)) (.cse13 (and .cse18 .cse1)) (.cse15 (and .cse1 .cse17)) (.cse19 (= (mod v_~z$w_buff0_used~0_567 256) 0))) (let ((.cse3 (not .cse19)) (.cse5 (or .cse19 .cse13 .cse15)) (.cse2 (or .cse0 (not .cse18))) (.cse4 (or .cse0 (not .cse17))) (.cse8 (not .cse6))) (and (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= |v_ULTIMATE.start_main_#t~nondet33_57| v_~weak$$choice2~0_96) (or (and (or (and .cse0 (= v_~z$w_buff0~0_213 |v_ULTIMATE.start_main_#t~ite34_86|)) (and (= v_~z$w_buff1~0_201 |v_ULTIMATE.start_main_#t~ite34_86|) .cse1)) .cse2 .cse3 .cse4 (= |v_ULTIMATE.start_main_#t~ite34_86| |v_ULTIMATE.start_main_#t~ite35_79|)) (and (= v_~z~0_284 |v_ULTIMATE.start_main_#t~ite35_79|) .cse5 (= |v_ULTIMATE.start_main_#t~ite34_86| |v_ULTIMATE.start_main_#t~ite34_85|))) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~ite36_114| |v_ULTIMATE.start_main_#t~ite36_113|))) (or (and (= v_~z$w_buff0~0_212 |v_ULTIMATE.start_main_#t~ite37_102|) .cse6 (or (and .cse2 (= v_~z$w_buff0~0_213 |v_ULTIMATE.start_main_#t~ite36_114|) .cse3 .cse4 (= |v_ULTIMATE.start_main_#t~ite36_114| |v_ULTIMATE.start_main_#t~ite37_102|)) (and .cse5 (= v_~z$w_buff0~0_213 |v_ULTIMATE.start_main_#t~ite37_102|) .cse7))) (and .cse8 (= v_~z$w_buff0~0_213 v_~z$w_buff0~0_212) .cse7 (= |v_ULTIMATE.start_main_#t~ite37_102| |v_ULTIMATE.start_main_#t~ite37_101|)))) (= v_~main$tmp_guard1~0_36 (ite (= (ite (not (and (= v_~x~0_59 2) (= 2 |v_ULTIMATE.start_main_#t~ite35_79|) (= v_~__unbuffered_p2_EAX~0_46 1))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~ite39_109| |v_ULTIMATE.start_main_#t~ite39_110|))) (or (and (= v_~z$w_buff1~0_201 v_~z$w_buff1~0_200) .cse8 .cse9 (= |v_ULTIMATE.start_main_#t~ite40_104| |v_ULTIMATE.start_main_#t~ite40_103|)) (and .cse6 (= v_~z$w_buff1~0_200 |v_ULTIMATE.start_main_#t~ite40_104|) (or (and (= v_~z$w_buff1~0_201 |v_ULTIMATE.start_main_#t~ite40_104|) .cse5 .cse9) (and .cse2 (= |v_ULTIMATE.start_main_#t~ite39_110| |v_ULTIMATE.start_main_#t~ite40_104|) .cse3 (= v_~z$w_buff1~0_201 |v_ULTIMATE.start_main_#t~ite39_110|) .cse4))))) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~ite42_118| |v_ULTIMATE.start_main_#t~ite42_117|))) (or (and .cse8 (= |v_ULTIMATE.start_main_#t~ite43_114| |v_ULTIMATE.start_main_#t~ite43_113|) .cse10 (= v_~z$w_buff0_used~0_567 v_~z$w_buff0_used~0_566)) (and .cse6 (= v_~z$w_buff0_used~0_566 |v_ULTIMATE.start_main_#t~ite43_114|) (or (and .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite42_118| |v_ULTIMATE.start_main_#t~ite43_114|) .cse4 (or (and .cse0 (= |v_ULTIMATE.start_main_#t~ite42_118| 0)) (and .cse1 (= v_~z$w_buff0_used~0_567 |v_ULTIMATE.start_main_#t~ite42_118|)))) (and .cse10 .cse5 (= v_~z$w_buff0_used~0_567 |v_ULTIMATE.start_main_#t~ite43_114|)))))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (or (and .cse8 (= v_~z$mem_tmp~0_44 v_~z~0_283)) (and (= v_~z~0_283 |v_ULTIMATE.start_main_#t~ite35_79|) .cse6)) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~ite51_108| |v_ULTIMATE.start_main_#t~ite51_107|))) (or (and .cse8 (= |v_ULTIMATE.start_main_#t~ite52_98| |v_ULTIMATE.start_main_#t~ite52_97|) (= v_~z$r_buff1_thd0~0_258 v_~z$r_buff1_thd0~0_257) .cse11) (and (= v_~z$r_buff1_thd0~0_257 |v_ULTIMATE.start_main_#t~ite52_98|) .cse6 (= v_~z$r_buff1_thd0~0_258 |v_ULTIMATE.start_main_#t~ite52_98|) .cse11))) (= v_~z$flush_delayed~0_74 0) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite45_99| |v_ULTIMATE.start_main_#t~ite45_100|))) (or (and (let ((.cse14 (= (mod v_~z$w_buff0_used~0_566 256) 0))) (or (and .cse12 (= v_~z$w_buff1_used~0_459 |v_ULTIMATE.start_main_#t~ite46_94|) (or .cse13 .cse14 .cse15)) (and (not .cse14) (= |v_ULTIMATE.start_main_#t~ite46_94| |v_ULTIMATE.start_main_#t~ite45_100|) .cse2 .cse4 (= |v_ULTIMATE.start_main_#t~ite45_100| 0)))) .cse6 (= v_~z$w_buff1_used~0_458 |v_ULTIMATE.start_main_#t~ite46_94|)) (and .cse8 (= v_~z$w_buff1_used~0_458 v_~z$w_buff1_used~0_459) .cse12 (= |v_ULTIMATE.start_main_#t~ite46_94| |v_ULTIMATE.start_main_#t~ite46_93|)))) (= v_~z$mem_tmp~0_44 v_~z~0_284) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~ite48_108| |v_ULTIMATE.start_main_#t~ite48_107|))) (or (and .cse16 .cse8 (= v_~z$r_buff0_thd0~0_319 v_~z$r_buff0_thd0~0_318) (= |v_ULTIMATE.start_main_#t~ite49_102| |v_ULTIMATE.start_main_#t~ite49_101|)) (and .cse16 (= v_~z$r_buff0_thd0~0_318 |v_ULTIMATE.start_main_#t~ite49_102|) (= v_~z$r_buff0_thd0~0_319 |v_ULTIMATE.start_main_#t~ite49_102|) .cse6))) (= |v_ULTIMATE.start_main_#t~nondet32_47| v_~weak$$choice0~0_23))))) InVars {ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_47|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_57|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_567, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_109|, ~z$w_buff0~0=v_~z$w_buff0~0_213, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_459, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_93|, ~z$w_buff1~0=v_~z$w_buff1~0_201, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_101|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_107|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_101|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_113|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_117|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_99|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_85|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_97|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_319, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_107|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_103|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_258, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_46, ~z~0=v_~z~0_284, ~x~0=v_~x~0_59} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_46|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_56|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_54|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_92|, ~z$w_buff1~0=v_~z$w_buff1~0_200, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_100|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_106|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_112|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_116|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_98|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_52|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_96|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_318, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_106|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_257, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_46, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|, ~z$mem_tmp~0=v_~z$mem_tmp~0_44, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_566, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_108|, ~z$w_buff0~0=v_~z$w_buff0~0_212, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_458, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_78|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_112|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~z$flush_delayed~0=v_~z$flush_delayed~0_74, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_100|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_50|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_60|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_84|, ~weak$$choice0~0=v_~weak$$choice0~0_23, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_56|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_102|, ~z~0=v_~z~0_283, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~x~0=v_~x~0_59} AuxVars[|v_ULTIMATE.start_main_#t~ite42_118|, |v_ULTIMATE.start_main_#t~ite46_94|, |v_ULTIMATE.start_main_#t~ite51_108|, |v_ULTIMATE.start_main_#t~ite43_114|, |v_ULTIMATE.start_main_#t~ite45_100|, |v_ULTIMATE.start_main_#t~ite52_98|, |v_ULTIMATE.start_main_#t~ite34_86|, |v_ULTIMATE.start_main_#t~ite35_79|, |v_ULTIMATE.start_main_#t~ite49_102|, |v_ULTIMATE.start_main_#t~ite36_114|, |v_ULTIMATE.start_main_#t~ite37_102|, |v_ULTIMATE.start_main_#t~ite40_104|, |v_ULTIMATE.start_main_#t~ite48_108|, |v_ULTIMATE.start_main_#t~ite39_110|] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ~z$mem_tmp~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite34, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0, ~weak$$choice2~0][46], [Black: 127#(= ~x~0 0), Black: 163#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 195#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork1InUse, Black: 196#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0) (or (= ~z~0 0) (= ~z~0 1))), P0Thread1of1ForFork2InUse, 43#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 171#true, P1Thread1of1ForFork0InUse, Black: 137#(= ~__unbuffered_p2_EAX~0 0), 13#L781true, Black: 139#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y~0 0)), Black: 173#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 242#true, Black: 175#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), 212#true, Black: 118#(= ~__unbuffered_p2_EAX~0 0), Black: 245#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0_used~0 0)), Black: 215#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff0_thd2~0 0) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), 29#L754true, Black: 217#(and (= ~z$r_buff0_thd0~0 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~z~0))), 30#L801true, Black: 219#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff0_thd2~0 0))]) [2021-03-26 00:39:17,678 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-26 00:39:17,678 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 00:39:17,678 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 00:39:17,678 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 00:39:17,679 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1026] L834-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse17 (= 0 (mod v_~z$w_buff1_used~0_459 256))) (.cse18 (= (mod v_~z$r_buff1_thd0~0_258 256) 0)) (.cse1 (= (mod v_~z$r_buff0_thd0~0_319 256) 0))) (let ((.cse6 (= (mod v_~weak$$choice2~0_96 256) 0)) (.cse0 (not .cse1)) (.cse13 (and .cse18 .cse1)) (.cse15 (and .cse1 .cse17)) (.cse19 (= (mod v_~z$w_buff0_used~0_567 256) 0))) (let ((.cse3 (not .cse19)) (.cse5 (or .cse19 .cse13 .cse15)) (.cse2 (or .cse0 (not .cse18))) (.cse4 (or .cse0 (not .cse17))) (.cse8 (not .cse6))) (and (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= |v_ULTIMATE.start_main_#t~nondet33_57| v_~weak$$choice2~0_96) (or (and (or (and .cse0 (= v_~z$w_buff0~0_213 |v_ULTIMATE.start_main_#t~ite34_86|)) (and (= v_~z$w_buff1~0_201 |v_ULTIMATE.start_main_#t~ite34_86|) .cse1)) .cse2 .cse3 .cse4 (= |v_ULTIMATE.start_main_#t~ite34_86| |v_ULTIMATE.start_main_#t~ite35_79|)) (and (= v_~z~0_284 |v_ULTIMATE.start_main_#t~ite35_79|) .cse5 (= |v_ULTIMATE.start_main_#t~ite34_86| |v_ULTIMATE.start_main_#t~ite34_85|))) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~ite36_114| |v_ULTIMATE.start_main_#t~ite36_113|))) (or (and (= v_~z$w_buff0~0_212 |v_ULTIMATE.start_main_#t~ite37_102|) .cse6 (or (and .cse2 (= v_~z$w_buff0~0_213 |v_ULTIMATE.start_main_#t~ite36_114|) .cse3 .cse4 (= |v_ULTIMATE.start_main_#t~ite36_114| |v_ULTIMATE.start_main_#t~ite37_102|)) (and .cse5 (= v_~z$w_buff0~0_213 |v_ULTIMATE.start_main_#t~ite37_102|) .cse7))) (and .cse8 (= v_~z$w_buff0~0_213 v_~z$w_buff0~0_212) .cse7 (= |v_ULTIMATE.start_main_#t~ite37_102| |v_ULTIMATE.start_main_#t~ite37_101|)))) (= v_~main$tmp_guard1~0_36 (ite (= (ite (not (and (= v_~x~0_59 2) (= 2 |v_ULTIMATE.start_main_#t~ite35_79|) (= v_~__unbuffered_p2_EAX~0_46 1))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~ite39_109| |v_ULTIMATE.start_main_#t~ite39_110|))) (or (and (= v_~z$w_buff1~0_201 v_~z$w_buff1~0_200) .cse8 .cse9 (= |v_ULTIMATE.start_main_#t~ite40_104| |v_ULTIMATE.start_main_#t~ite40_103|)) (and .cse6 (= v_~z$w_buff1~0_200 |v_ULTIMATE.start_main_#t~ite40_104|) (or (and (= v_~z$w_buff1~0_201 |v_ULTIMATE.start_main_#t~ite40_104|) .cse5 .cse9) (and .cse2 (= |v_ULTIMATE.start_main_#t~ite39_110| |v_ULTIMATE.start_main_#t~ite40_104|) .cse3 (= v_~z$w_buff1~0_201 |v_ULTIMATE.start_main_#t~ite39_110|) .cse4))))) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~ite42_118| |v_ULTIMATE.start_main_#t~ite42_117|))) (or (and .cse8 (= |v_ULTIMATE.start_main_#t~ite43_114| |v_ULTIMATE.start_main_#t~ite43_113|) .cse10 (= v_~z$w_buff0_used~0_567 v_~z$w_buff0_used~0_566)) (and .cse6 (= v_~z$w_buff0_used~0_566 |v_ULTIMATE.start_main_#t~ite43_114|) (or (and .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite42_118| |v_ULTIMATE.start_main_#t~ite43_114|) .cse4 (or (and .cse0 (= |v_ULTIMATE.start_main_#t~ite42_118| 0)) (and .cse1 (= v_~z$w_buff0_used~0_567 |v_ULTIMATE.start_main_#t~ite42_118|)))) (and .cse10 .cse5 (= v_~z$w_buff0_used~0_567 |v_ULTIMATE.start_main_#t~ite43_114|)))))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (or (and .cse8 (= v_~z$mem_tmp~0_44 v_~z~0_283)) (and (= v_~z~0_283 |v_ULTIMATE.start_main_#t~ite35_79|) .cse6)) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~ite51_108| |v_ULTIMATE.start_main_#t~ite51_107|))) (or (and .cse8 (= |v_ULTIMATE.start_main_#t~ite52_98| |v_ULTIMATE.start_main_#t~ite52_97|) (= v_~z$r_buff1_thd0~0_258 v_~z$r_buff1_thd0~0_257) .cse11) (and (= v_~z$r_buff1_thd0~0_257 |v_ULTIMATE.start_main_#t~ite52_98|) .cse6 (= v_~z$r_buff1_thd0~0_258 |v_ULTIMATE.start_main_#t~ite52_98|) .cse11))) (= v_~z$flush_delayed~0_74 0) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite45_99| |v_ULTIMATE.start_main_#t~ite45_100|))) (or (and (let ((.cse14 (= (mod v_~z$w_buff0_used~0_566 256) 0))) (or (and .cse12 (= v_~z$w_buff1_used~0_459 |v_ULTIMATE.start_main_#t~ite46_94|) (or .cse13 .cse14 .cse15)) (and (not .cse14) (= |v_ULTIMATE.start_main_#t~ite46_94| |v_ULTIMATE.start_main_#t~ite45_100|) .cse2 .cse4 (= |v_ULTIMATE.start_main_#t~ite45_100| 0)))) .cse6 (= v_~z$w_buff1_used~0_458 |v_ULTIMATE.start_main_#t~ite46_94|)) (and .cse8 (= v_~z$w_buff1_used~0_458 v_~z$w_buff1_used~0_459) .cse12 (= |v_ULTIMATE.start_main_#t~ite46_94| |v_ULTIMATE.start_main_#t~ite46_93|)))) (= v_~z$mem_tmp~0_44 v_~z~0_284) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~ite48_108| |v_ULTIMATE.start_main_#t~ite48_107|))) (or (and .cse16 .cse8 (= v_~z$r_buff0_thd0~0_319 v_~z$r_buff0_thd0~0_318) (= |v_ULTIMATE.start_main_#t~ite49_102| |v_ULTIMATE.start_main_#t~ite49_101|)) (and .cse16 (= v_~z$r_buff0_thd0~0_318 |v_ULTIMATE.start_main_#t~ite49_102|) (= v_~z$r_buff0_thd0~0_319 |v_ULTIMATE.start_main_#t~ite49_102|) .cse6))) (= |v_ULTIMATE.start_main_#t~nondet32_47| v_~weak$$choice0~0_23))))) InVars {ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_47|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_57|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_567, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_109|, ~z$w_buff0~0=v_~z$w_buff0~0_213, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_459, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_93|, ~z$w_buff1~0=v_~z$w_buff1~0_201, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_101|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_107|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_101|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_113|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_117|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_99|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_85|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_97|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_319, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_107|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_103|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_258, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_46, ~z~0=v_~z~0_284, ~x~0=v_~x~0_59} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_46|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_56|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_54|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_92|, ~z$w_buff1~0=v_~z$w_buff1~0_200, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_100|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_106|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_112|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_116|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_98|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_52|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_96|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_318, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_106|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_257, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_46, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|, ~z$mem_tmp~0=v_~z$mem_tmp~0_44, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_566, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_108|, ~z$w_buff0~0=v_~z$w_buff0~0_212, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_458, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_78|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_112|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~z$flush_delayed~0=v_~z$flush_delayed~0_74, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_100|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_50|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_60|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_84|, ~weak$$choice0~0=v_~weak$$choice0~0_23, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_56|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_102|, ~z~0=v_~z~0_283, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~x~0=v_~x~0_59} AuxVars[|v_ULTIMATE.start_main_#t~ite42_118|, |v_ULTIMATE.start_main_#t~ite46_94|, |v_ULTIMATE.start_main_#t~ite51_108|, |v_ULTIMATE.start_main_#t~ite43_114|, |v_ULTIMATE.start_main_#t~ite45_100|, |v_ULTIMATE.start_main_#t~ite52_98|, |v_ULTIMATE.start_main_#t~ite34_86|, |v_ULTIMATE.start_main_#t~ite35_79|, |v_ULTIMATE.start_main_#t~ite49_102|, |v_ULTIMATE.start_main_#t~ite36_114|, |v_ULTIMATE.start_main_#t~ite37_102|, |v_ULTIMATE.start_main_#t~ite40_104|, |v_ULTIMATE.start_main_#t~ite48_108|, |v_ULTIMATE.start_main_#t~ite39_110|] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ~z$mem_tmp~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite34, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0, ~weak$$choice2~0][46], [Black: 127#(= ~x~0 0), Black: 163#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 195#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork1InUse, Black: 196#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0) (or (= ~z~0 0) (= ~z~0 1))), P0Thread1of1ForFork2InUse, 43#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 171#true, P1Thread1of1ForFork0InUse, Black: 137#(= ~__unbuffered_p2_EAX~0 0), 13#L781true, Black: 139#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y~0 0)), Black: 173#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 242#true, Black: 175#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), 212#true, Black: 118#(= ~__unbuffered_p2_EAX~0 0), Black: 245#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0_used~0 0)), Black: 215#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff0_thd2~0 0) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), 29#L754true, 30#L801true, Black: 217#(and (= ~z$r_buff0_thd0~0 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~z~0))), Black: 219#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff0_thd2~0 0))]) [2021-03-26 00:39:17,679 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-26 00:39:17,679 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 00:39:17,679 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 00:39:17,680 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 00:39:17,680 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 00:39:17,683 INFO L129 PetriNetUnfolder]: 129/325 cut-off events. [2021-03-26 00:39:17,683 INFO L130 PetriNetUnfolder]: For 2635/2805 co-relation queries the response was YES. [2021-03-26 00:39:17,684 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 325 events. 129/325 cut-off events. For 2635/2805 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1906 event pairs, 6 based on Foata normal form. 19/326 useless extension candidates. Maximal degree in co-relation 1475. Up to 168 conditions per place. [2021-03-26 00:39:17,686 INFO L142 LiptonReduction]: Number of co-enabled transitions 478 [2021-03-26 00:39:17,704 INFO L154 LiptonReduction]: Checked pairs total: 302 [2021-03-26 00:39:17,704 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:39:17,704 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 56 [2021-03-26 00:39:17,705 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 466 flow [2021-03-26 00:39:17,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states 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:39:17,705 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:17,705 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:17,705 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:39:17,705 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:17,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:17,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1450930176, now seen corresponding path program 2 times [2021-03-26 00:39:17,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:17,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378649390] [2021-03-26 00:39:17,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:17,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:17,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:39:17,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:17,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:39:17,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:17,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:39:17,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:17,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:39:17,794 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:39:17,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378649390] [2021-03-26 00:39:17,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:17,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:39:17,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729921487] [2021-03-26 00:39:17,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:39:17,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:17,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:39:17,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:39:17,795 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 171 [2021-03-26 00:39:17,796 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 466 flow. Second operand has 6 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states 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:39:17,796 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:17,796 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 171 [2021-03-26 00:39:17,796 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:17,896 INFO L129 PetriNetUnfolder]: 186/410 cut-off events. [2021-03-26 00:39:17,896 INFO L130 PetriNetUnfolder]: For 2236/2582 co-relation queries the response was YES. [2021-03-26 00:39:17,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 410 events. 186/410 cut-off events. For 2236/2582 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2355 event pairs, 50 based on Foata normal form. 75/470 useless extension candidates. Maximal degree in co-relation 1860. Up to 272 conditions per place. [2021-03-26 00:39:17,899 INFO L132 encePairwiseOnDemand]: 166/171 looper letters, 26 selfloop transitions, 18 changer transitions 0/60 dead transitions. [2021-03-26 00:39:17,899 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 580 flow [2021-03-26 00:39:17,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:39:17,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:39:17,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2021-03-26 00:39:17,901 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7558479532163743 [2021-03-26 00:39:17,901 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 517 transitions. [2021-03-26 00:39:17,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 517 transitions. [2021-03-26 00:39:17,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:17,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 517 transitions. [2021-03-26 00:39:17,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states 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:39:17,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:17,903 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:17,903 INFO L185 Difference]: Start difference. First operand has 58 places, 56 transitions, 466 flow. Second operand 4 states and 517 transitions. [2021-03-26 00:39:17,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 580 flow [2021-03-26 00:39:17,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 562 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:39:17,907 INFO L241 Difference]: Finished difference. Result has 60 places, 58 transitions, 522 flow [2021-03-26 00:39:17,908 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=522, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2021-03-26 00:39:17,908 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 12 predicate places. [2021-03-26 00:39:17,908 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:17,908 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 58 transitions, 522 flow [2021-03-26 00:39:17,908 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 58 transitions, 522 flow [2021-03-26 00:39:17,908 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 58 transitions, 522 flow [2021-03-26 00:39:17,938 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1026] L834-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse17 (= 0 (mod v_~z$w_buff1_used~0_459 256))) (.cse18 (= (mod v_~z$r_buff1_thd0~0_258 256) 0)) (.cse1 (= (mod v_~z$r_buff0_thd0~0_319 256) 0))) (let ((.cse6 (= (mod v_~weak$$choice2~0_96 256) 0)) (.cse0 (not .cse1)) (.cse13 (and .cse18 .cse1)) (.cse15 (and .cse1 .cse17)) (.cse19 (= (mod v_~z$w_buff0_used~0_567 256) 0))) (let ((.cse3 (not .cse19)) (.cse5 (or .cse19 .cse13 .cse15)) (.cse2 (or .cse0 (not .cse18))) (.cse4 (or .cse0 (not .cse17))) (.cse8 (not .cse6))) (and (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= |v_ULTIMATE.start_main_#t~nondet33_57| v_~weak$$choice2~0_96) (or (and (or (and .cse0 (= v_~z$w_buff0~0_213 |v_ULTIMATE.start_main_#t~ite34_86|)) (and (= v_~z$w_buff1~0_201 |v_ULTIMATE.start_main_#t~ite34_86|) .cse1)) .cse2 .cse3 .cse4 (= |v_ULTIMATE.start_main_#t~ite34_86| |v_ULTIMATE.start_main_#t~ite35_79|)) (and (= v_~z~0_284 |v_ULTIMATE.start_main_#t~ite35_79|) .cse5 (= |v_ULTIMATE.start_main_#t~ite34_86| |v_ULTIMATE.start_main_#t~ite34_85|))) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~ite36_114| |v_ULTIMATE.start_main_#t~ite36_113|))) (or (and (= v_~z$w_buff0~0_212 |v_ULTIMATE.start_main_#t~ite37_102|) .cse6 (or (and .cse2 (= v_~z$w_buff0~0_213 |v_ULTIMATE.start_main_#t~ite36_114|) .cse3 .cse4 (= |v_ULTIMATE.start_main_#t~ite36_114| |v_ULTIMATE.start_main_#t~ite37_102|)) (and .cse5 (= v_~z$w_buff0~0_213 |v_ULTIMATE.start_main_#t~ite37_102|) .cse7))) (and .cse8 (= v_~z$w_buff0~0_213 v_~z$w_buff0~0_212) .cse7 (= |v_ULTIMATE.start_main_#t~ite37_102| |v_ULTIMATE.start_main_#t~ite37_101|)))) (= v_~main$tmp_guard1~0_36 (ite (= (ite (not (and (= v_~x~0_59 2) (= 2 |v_ULTIMATE.start_main_#t~ite35_79|) (= v_~__unbuffered_p2_EAX~0_46 1))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~ite39_109| |v_ULTIMATE.start_main_#t~ite39_110|))) (or (and (= v_~z$w_buff1~0_201 v_~z$w_buff1~0_200) .cse8 .cse9 (= |v_ULTIMATE.start_main_#t~ite40_104| |v_ULTIMATE.start_main_#t~ite40_103|)) (and .cse6 (= v_~z$w_buff1~0_200 |v_ULTIMATE.start_main_#t~ite40_104|) (or (and (= v_~z$w_buff1~0_201 |v_ULTIMATE.start_main_#t~ite40_104|) .cse5 .cse9) (and .cse2 (= |v_ULTIMATE.start_main_#t~ite39_110| |v_ULTIMATE.start_main_#t~ite40_104|) .cse3 (= v_~z$w_buff1~0_201 |v_ULTIMATE.start_main_#t~ite39_110|) .cse4))))) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~ite42_118| |v_ULTIMATE.start_main_#t~ite42_117|))) (or (and .cse8 (= |v_ULTIMATE.start_main_#t~ite43_114| |v_ULTIMATE.start_main_#t~ite43_113|) .cse10 (= v_~z$w_buff0_used~0_567 v_~z$w_buff0_used~0_566)) (and .cse6 (= v_~z$w_buff0_used~0_566 |v_ULTIMATE.start_main_#t~ite43_114|) (or (and .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite42_118| |v_ULTIMATE.start_main_#t~ite43_114|) .cse4 (or (and .cse0 (= |v_ULTIMATE.start_main_#t~ite42_118| 0)) (and .cse1 (= v_~z$w_buff0_used~0_567 |v_ULTIMATE.start_main_#t~ite42_118|)))) (and .cse10 .cse5 (= v_~z$w_buff0_used~0_567 |v_ULTIMATE.start_main_#t~ite43_114|)))))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (or (and .cse8 (= v_~z$mem_tmp~0_44 v_~z~0_283)) (and (= v_~z~0_283 |v_ULTIMATE.start_main_#t~ite35_79|) .cse6)) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~ite51_108| |v_ULTIMATE.start_main_#t~ite51_107|))) (or (and .cse8 (= |v_ULTIMATE.start_main_#t~ite52_98| |v_ULTIMATE.start_main_#t~ite52_97|) (= v_~z$r_buff1_thd0~0_258 v_~z$r_buff1_thd0~0_257) .cse11) (and (= v_~z$r_buff1_thd0~0_257 |v_ULTIMATE.start_main_#t~ite52_98|) .cse6 (= v_~z$r_buff1_thd0~0_258 |v_ULTIMATE.start_main_#t~ite52_98|) .cse11))) (= v_~z$flush_delayed~0_74 0) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite45_99| |v_ULTIMATE.start_main_#t~ite45_100|))) (or (and (let ((.cse14 (= (mod v_~z$w_buff0_used~0_566 256) 0))) (or (and .cse12 (= v_~z$w_buff1_used~0_459 |v_ULTIMATE.start_main_#t~ite46_94|) (or .cse13 .cse14 .cse15)) (and (not .cse14) (= |v_ULTIMATE.start_main_#t~ite46_94| |v_ULTIMATE.start_main_#t~ite45_100|) .cse2 .cse4 (= |v_ULTIMATE.start_main_#t~ite45_100| 0)))) .cse6 (= v_~z$w_buff1_used~0_458 |v_ULTIMATE.start_main_#t~ite46_94|)) (and .cse8 (= v_~z$w_buff1_used~0_458 v_~z$w_buff1_used~0_459) .cse12 (= |v_ULTIMATE.start_main_#t~ite46_94| |v_ULTIMATE.start_main_#t~ite46_93|)))) (= v_~z$mem_tmp~0_44 v_~z~0_284) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~ite48_108| |v_ULTIMATE.start_main_#t~ite48_107|))) (or (and .cse16 .cse8 (= v_~z$r_buff0_thd0~0_319 v_~z$r_buff0_thd0~0_318) (= |v_ULTIMATE.start_main_#t~ite49_102| |v_ULTIMATE.start_main_#t~ite49_101|)) (and .cse16 (= v_~z$r_buff0_thd0~0_318 |v_ULTIMATE.start_main_#t~ite49_102|) (= v_~z$r_buff0_thd0~0_319 |v_ULTIMATE.start_main_#t~ite49_102|) .cse6))) (= |v_ULTIMATE.start_main_#t~nondet32_47| v_~weak$$choice0~0_23))))) InVars {ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_47|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_57|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_567, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_109|, ~z$w_buff0~0=v_~z$w_buff0~0_213, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_459, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_93|, ~z$w_buff1~0=v_~z$w_buff1~0_201, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_101|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_107|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_101|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_113|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_117|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_99|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_85|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_97|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_319, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_107|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_103|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_258, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_46, ~z~0=v_~z~0_284, ~x~0=v_~x~0_59} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_46|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_56|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_54|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_92|, ~z$w_buff1~0=v_~z$w_buff1~0_200, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_100|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_106|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_112|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_116|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_98|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_52|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_96|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_318, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_106|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_257, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_46, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|, ~z$mem_tmp~0=v_~z$mem_tmp~0_44, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_566, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_108|, ~z$w_buff0~0=v_~z$w_buff0~0_212, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_458, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_78|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_112|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~z$flush_delayed~0=v_~z$flush_delayed~0_74, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_100|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_50|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_60|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_84|, ~weak$$choice0~0=v_~weak$$choice0~0_23, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_56|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_102|, ~z~0=v_~z~0_283, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~x~0=v_~x~0_59} AuxVars[|v_ULTIMATE.start_main_#t~ite42_118|, |v_ULTIMATE.start_main_#t~ite46_94|, |v_ULTIMATE.start_main_#t~ite51_108|, |v_ULTIMATE.start_main_#t~ite43_114|, |v_ULTIMATE.start_main_#t~ite45_100|, |v_ULTIMATE.start_main_#t~ite52_98|, |v_ULTIMATE.start_main_#t~ite34_86|, |v_ULTIMATE.start_main_#t~ite35_79|, |v_ULTIMATE.start_main_#t~ite49_102|, |v_ULTIMATE.start_main_#t~ite36_114|, |v_ULTIMATE.start_main_#t~ite37_102|, |v_ULTIMATE.start_main_#t~ite40_104|, |v_ULTIMATE.start_main_#t~ite48_108|, |v_ULTIMATE.start_main_#t~ite39_110|] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ~z$mem_tmp~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite34, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0, ~weak$$choice2~0][48], [Black: 127#(= ~x~0 0), 260#true, Black: 163#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 195#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork1InUse, Black: 196#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0) (or (= ~z~0 0) (= ~z~0 1))), P0Thread1of1ForFork2InUse, 43#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 171#true, P1Thread1of1ForFork0InUse, Black: 137#(= ~__unbuffered_p2_EAX~0 0), Black: 264#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 13#L781true, Black: 139#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y~0 0)), Black: 173#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 175#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), 212#true, Black: 118#(= ~__unbuffered_p2_EAX~0 0), Black: 245#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0_used~0 0)), Black: 215#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff0_thd2~0 0) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), 29#L754true, 30#L801true, Black: 217#(and (= ~z$r_buff0_thd0~0 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~z~0))), Black: 219#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff0_thd2~0 0))]) [2021-03-26 00:39:17,939 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is not cut-off event [2021-03-26 00:39:17,939 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2021-03-26 00:39:17,939 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2021-03-26 00:39:17,939 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2021-03-26 00:39:17,940 INFO L129 PetriNetUnfolder]: 121/311 cut-off events. [2021-03-26 00:39:17,940 INFO L130 PetriNetUnfolder]: For 2915/3106 co-relation queries the response was YES. [2021-03-26 00:39:17,941 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1522 conditions, 311 events. 121/311 cut-off events. For 2915/3106 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1777 event pairs, 11 based on Foata normal form. 22/318 useless extension candidates. Maximal degree in co-relation 1494. Up to 155 conditions per place. [2021-03-26 00:39:17,943 INFO L142 LiptonReduction]: Number of co-enabled transitions 482 [2021-03-26 00:39:17,952 INFO L154 LiptonReduction]: Checked pairs total: 279 [2021-03-26 00:39:17,952 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:39:17,952 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 44 [2021-03-26 00:39:17,953 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 522 flow [2021-03-26 00:39:17,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states 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:39:17,953 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:17,953 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:17,953 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:39:17,953 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:17,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:17,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1174321706, now seen corresponding path program 1 times [2021-03-26 00:39:17,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:17,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877693722] [2021-03-26 00:39:17,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:18,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:18,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:39:18,027 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:39:18,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:39:18,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:18,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:39:18,033 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:39:18,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877693722] [2021-03-26 00:39:18,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:18,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:39:18,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946949607] [2021-03-26 00:39:18,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:39:18,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:18,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:39:18,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:39:18,034 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 171 [2021-03-26 00:39:18,035 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 522 flow. Second operand has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:18,035 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:18,035 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 171 [2021-03-26 00:39:18,035 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:18,102 INFO L129 PetriNetUnfolder]: 193/490 cut-off events. [2021-03-26 00:39:18,102 INFO L130 PetriNetUnfolder]: For 2817/2937 co-relation queries the response was YES. [2021-03-26 00:39:18,104 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1747 conditions, 490 events. 193/490 cut-off events. For 2817/2937 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 3273 event pairs, 63 based on Foata normal form. 80/540 useless extension candidates. Maximal degree in co-relation 1717. Up to 243 conditions per place. [2021-03-26 00:39:18,105 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 8 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2021-03-26 00:39:18,105 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 57 transitions, 449 flow [2021-03-26 00:39:18,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:39:18,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:39:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2021-03-26 00:39:18,107 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8456140350877193 [2021-03-26 00:39:18,107 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 723 transitions. [2021-03-26 00:39:18,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 723 transitions. [2021-03-26 00:39:18,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:18,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 723 transitions. [2021-03-26 00:39:18,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.6) internal successors, (723), 5 states have internal predecessors, (723), 0 states have call successors, (0), 0 states 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:39:18,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states 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:39:18,110 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states 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:39:18,110 INFO L185 Difference]: Start difference. First operand has 60 places, 58 transitions, 522 flow. Second operand 5 states and 723 transitions. [2021-03-26 00:39:18,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 57 transitions, 449 flow [2021-03-26 00:39:18,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 57 transitions, 414 flow, removed 2 selfloop flow, removed 5 redundant places. [2021-03-26 00:39:18,114 INFO L241 Difference]: Finished difference. Result has 62 places, 54 transitions, 422 flow [2021-03-26 00:39:18,114 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=422, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2021-03-26 00:39:18,114 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 14 predicate places. [2021-03-26 00:39:18,114 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:18,114 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 54 transitions, 422 flow [2021-03-26 00:39:18,114 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 54 transitions, 422 flow [2021-03-26 00:39:18,115 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 54 transitions, 422 flow [2021-03-26 00:39:18,152 INFO L129 PetriNetUnfolder]: 176/440 cut-off events. [2021-03-26 00:39:18,153 INFO L130 PetriNetUnfolder]: For 2363/2603 co-relation queries the response was YES. [2021-03-26 00:39:18,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1807 conditions, 440 events. 176/440 cut-off events. For 2363/2603 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 2849 event pairs, 52 based on Foata normal form. 29/421 useless extension candidates. Maximal degree in co-relation 1778. Up to 192 conditions per place. [2021-03-26 00:39:18,157 INFO L142 LiptonReduction]: Number of co-enabled transitions 550 [2021-03-26 00:39:18,165 INFO L154 LiptonReduction]: Checked pairs total: 35 [2021-03-26 00:39:18,165 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:39:18,165 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 51 [2021-03-26 00:39:18,167 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 416 flow [2021-03-26 00:39:18,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:18,167 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:18,167 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:39:18,167 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:39:18,167 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:18,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:18,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1860071650, now seen corresponding path program 1 times [2021-03-26 00:39:18,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:18,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679567795] [2021-03-26 00:39:18,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:18,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:18,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:39:18,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:18,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:39:18,203 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:39:18,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:39:18,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:18,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:39:18,209 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:39:18,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679567795] [2021-03-26 00:39:18,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:18,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:39:18,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042829511] [2021-03-26 00:39:18,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:39:18,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:18,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:39:18,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:39:18,211 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 171 [2021-03-26 00:39:18,212 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 416 flow. Second operand has 5 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 0 states 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:39:18,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:18,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 171 [2021-03-26 00:39:18,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:18,277 INFO L129 PetriNetUnfolder]: 106/321 cut-off events. [2021-03-26 00:39:18,278 INFO L130 PetriNetUnfolder]: For 1214/1366 co-relation queries the response was YES. [2021-03-26 00:39:18,279 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1377 conditions, 321 events. 106/321 cut-off events. For 1214/1366 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1890 event pairs, 11 based on Foata normal form. 96/410 useless extension candidates. Maximal degree in co-relation 1346. Up to 165 conditions per place. [2021-03-26 00:39:18,280 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 5 selfloop transitions, 11 changer transitions 3/60 dead transitions. [2021-03-26 00:39:18,280 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 494 flow [2021-03-26 00:39:18,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:39:18,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:39:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 867 transitions. [2021-03-26 00:39:18,282 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8450292397660819 [2021-03-26 00:39:18,282 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 867 transitions. [2021-03-26 00:39:18,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 867 transitions. [2021-03-26 00:39:18,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:18,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 867 transitions. [2021-03-26 00:39:18,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 144.5) internal successors, (867), 6 states have internal predecessors, (867), 0 states have call successors, (0), 0 states 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:39:18,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states 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:39:18,285 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states 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:39:18,285 INFO L185 Difference]: Start difference. First operand has 62 places, 53 transitions, 416 flow. Second operand 6 states and 867 transitions. [2021-03-26 00:39:18,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 494 flow [2021-03-26 00:39:18,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 475 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-03-26 00:39:18,291 INFO L241 Difference]: Finished difference. Result has 64 places, 57 transitions, 467 flow [2021-03-26 00:39:18,291 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=467, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2021-03-26 00:39:18,291 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2021-03-26 00:39:18,291 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:18,292 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 57 transitions, 467 flow [2021-03-26 00:39:18,292 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 57 transitions, 467 flow [2021-03-26 00:39:18,292 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 57 transitions, 467 flow [2021-03-26 00:39:18,318 INFO L129 PetriNetUnfolder]: 106/318 cut-off events. [2021-03-26 00:39:18,318 INFO L130 PetriNetUnfolder]: For 1267/1361 co-relation queries the response was YES. [2021-03-26 00:39:18,319 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1417 conditions, 318 events. 106/318 cut-off events. For 1267/1361 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1855 event pairs, 9 based on Foata normal form. 7/317 useless extension candidates. Maximal degree in co-relation 1387. Up to 156 conditions per place. [2021-03-26 00:39:18,321 INFO L142 LiptonReduction]: Number of co-enabled transitions 438 [2021-03-26 00:39:18,333 INFO L154 LiptonReduction]: Checked pairs total: 24 [2021-03-26 00:39:18,334 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:39:18,334 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 43 [2021-03-26 00:39:18,335 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 459 flow [2021-03-26 00:39:18,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 0 states 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:39:18,335 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:18,335 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:18,335 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:39:18,335 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:18,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:18,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1040248850, now seen corresponding path program 1 times [2021-03-26 00:39:18,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:18,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034023107] [2021-03-26 00:39:18,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:18,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:18,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:39:18,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:18,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:39:18,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:18,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:39:18,391 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:39:18,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:39:18,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:18,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:39:18,397 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:39:18,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034023107] [2021-03-26 00:39:18,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:18,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:39:18,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085267398] [2021-03-26 00:39:18,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:39:18,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:18,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:39:18,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:39:18,399 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 171 [2021-03-26 00:39:18,400 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 459 flow. Second operand has 6 states, 6 states have (on average 141.83333333333334) internal successors, (851), 6 states have internal predecessors, (851), 0 states have call successors, (0), 0 states 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:39:18,400 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:18,400 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 171 [2021-03-26 00:39:18,400 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:18,451 INFO L129 PetriNetUnfolder]: 74/220 cut-off events. [2021-03-26 00:39:18,451 INFO L130 PetriNetUnfolder]: For 727/817 co-relation queries the response was YES. [2021-03-26 00:39:18,452 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 220 events. 74/220 cut-off events. For 727/817 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1102 event pairs, 4 based on Foata normal form. 55/270 useless extension candidates. Maximal degree in co-relation 971. Up to 91 conditions per place. [2021-03-26 00:39:18,453 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 2 selfloop transitions, 11 changer transitions 3/57 dead transitions. [2021-03-26 00:39:18,453 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 57 transitions, 491 flow [2021-03-26 00:39:18,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:39:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:39:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1005 transitions. [2021-03-26 00:39:18,455 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8395989974937343 [2021-03-26 00:39:18,455 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1005 transitions. [2021-03-26 00:39:18,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1005 transitions. [2021-03-26 00:39:18,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:18,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1005 transitions. [2021-03-26 00:39:18,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.57142857142858) internal successors, (1005), 7 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states 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:39:18,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 171.0) internal successors, (1368), 8 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states 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:39:18,458 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 171.0) internal successors, (1368), 8 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states 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:39:18,458 INFO L185 Difference]: Start difference. First operand has 64 places, 56 transitions, 459 flow. Second operand 7 states and 1005 transitions. [2021-03-26 00:39:18,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 57 transitions, 491 flow [2021-03-26 00:39:18,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 57 transitions, 442 flow, removed 18 selfloop flow, removed 6 redundant places. [2021-03-26 00:39:18,461 INFO L241 Difference]: Finished difference. Result has 65 places, 54 transitions, 422 flow [2021-03-26 00:39:18,461 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=422, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2021-03-26 00:39:18,462 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2021-03-26 00:39:18,462 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:18,462 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 54 transitions, 422 flow [2021-03-26 00:39:18,462 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 54 transitions, 422 flow [2021-03-26 00:39:18,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 54 transitions, 422 flow [2021-03-26 00:39:18,477 INFO L129 PetriNetUnfolder]: 70/215 cut-off events. [2021-03-26 00:39:18,478 INFO L130 PetriNetUnfolder]: For 534/578 co-relation queries the response was YES. [2021-03-26 00:39:18,478 INFO L84 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 215 events. 70/215 cut-off events. For 534/578 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 2 based on Foata normal form. 8/218 useless extension candidates. Maximal degree in co-relation 877. Up to 63 conditions per place. [2021-03-26 00:39:18,479 INFO L142 LiptonReduction]: Number of co-enabled transitions 330 [2021-03-26 00:39:18,760 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 00:39:18,896 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 00:39:19,527 WARN L205 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 192 [2021-03-26 00:39:19,734 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 00:39:20,965 WARN L205 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 347 DAG size of output: 270 [2021-03-26 00:39:21,447 WARN L205 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 00:39:21,454 INFO L154 LiptonReduction]: Checked pairs total: 9 [2021-03-26 00:39:21,454 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:39:21,454 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2992 [2021-03-26 00:39:21,455 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 408 flow [2021-03-26 00:39:21,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 141.83333333333334) internal successors, (851), 6 states have internal predecessors, (851), 0 states have call successors, (0), 0 states 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:39:21,455 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:21,455 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:21,455 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:39:21,455 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:21,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:21,456 INFO L82 PathProgramCache]: Analyzing trace with hash 2142626733, now seen corresponding path program 1 times [2021-03-26 00:39:21,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:21,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438083138] [2021-03-26 00:39:21,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:21,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:21,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:39:21,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:21,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:39:21,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:21,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 00:39:21,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:21,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:39:21,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:21,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:39:21,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:21,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:39:21,556 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:39:21,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438083138] [2021-03-26 00:39:21,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:21,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:39:21,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191734959] [2021-03-26 00:39:21,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 00:39:21,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:21,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 00:39:21,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-03-26 00:39:21,558 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 173 [2021-03-26 00:39:21,559 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 408 flow. Second operand has 8 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:21,559 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:21,559 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 173 [2021-03-26 00:39:21,559 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:21,683 INFO L129 PetriNetUnfolder]: 81/230 cut-off events. [2021-03-26 00:39:21,683 INFO L130 PetriNetUnfolder]: For 1456/1671 co-relation queries the response was YES. [2021-03-26 00:39:21,684 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 230 events. 81/230 cut-off events. For 1456/1671 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1218 event pairs, 0 based on Foata normal form. 83/307 useless extension candidates. Maximal degree in co-relation 1051. Up to 70 conditions per place. [2021-03-26 00:39:21,685 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 10 selfloop transitions, 22 changer transitions 5/58 dead transitions. [2021-03-26 00:39:21,685 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 58 transitions, 538 flow [2021-03-26 00:39:21,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:39:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:39:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 872 transitions. [2021-03-26 00:39:21,687 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7200660611065235 [2021-03-26 00:39:21,687 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 872 transitions. [2021-03-26 00:39:21,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 872 transitions. [2021-03-26 00:39:21,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:21,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 872 transitions. [2021-03-26 00:39:21,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:21,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states 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:39:21,690 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states 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:39:21,690 INFO L185 Difference]: Start difference. First operand has 61 places, 51 transitions, 408 flow. Second operand 7 states and 872 transitions. [2021-03-26 00:39:21,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 58 transitions, 538 flow [2021-03-26 00:39:21,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 58 transitions, 496 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-03-26 00:39:21,694 INFO L241 Difference]: Finished difference. Result has 61 places, 51 transitions, 418 flow [2021-03-26 00:39:21,694 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=418, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2021-03-26 00:39:21,694 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2021-03-26 00:39:21,694 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:21,694 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 51 transitions, 418 flow [2021-03-26 00:39:21,694 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 51 transitions, 418 flow [2021-03-26 00:39:21,695 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 51 transitions, 418 flow [2021-03-26 00:39:21,707 INFO L129 PetriNetUnfolder]: 62/179 cut-off events. [2021-03-26 00:39:21,707 INFO L130 PetriNetUnfolder]: For 581/626 co-relation queries the response was YES. [2021-03-26 00:39:21,708 INFO L84 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 179 events. 62/179 cut-off events. For 581/626 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 879 event pairs, 0 based on Foata normal form. 10/185 useless extension candidates. Maximal degree in co-relation 706. Up to 54 conditions per place. [2021-03-26 00:39:21,709 INFO L142 LiptonReduction]: Number of co-enabled transitions 244 [2021-03-26 00:39:21,712 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:39:21,712 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:39:21,712 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18 [2021-03-26 00:39:21,713 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 418 flow [2021-03-26 00:39:21,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:21,713 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:21,713 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:39:21,713 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:39:21,713 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:21,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:21,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1450055734, now seen corresponding path program 1 times [2021-03-26 00:39:21,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:21,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141740652] [2021-03-26 00:39:21,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:39:21,737 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:39:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:39:21,757 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:39:21,785 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:39:21,785 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:39:21,785 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 00:39:21,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:39:21 BasicIcfg [2021-03-26 00:39:21,846 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:39:21,846 INFO L168 Benchmark]: Toolchain (without parser) took 18560.40 ms. Allocated memory was 255.9 MB in the beginning and 585.1 MB in the end (delta: 329.3 MB). Free memory was 235.6 MB in the beginning and 336.3 MB in the end (delta: -100.7 MB). Peak memory consumption was 228.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:39:21,846 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:39:21,847 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.31 ms. Allocated memory was 255.9 MB in the beginning and 390.1 MB in the end (delta: 134.2 MB). Free memory was 235.6 MB in the beginning and 350.6 MB in the end (delta: -115.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:39:21,847 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.56 ms. Allocated memory is still 390.1 MB. Free memory was 350.6 MB in the beginning and 347.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:39:21,847 INFO L168 Benchmark]: Boogie Preprocessor took 24.51 ms. Allocated memory is still 390.1 MB. Free memory was 347.9 MB in the beginning and 345.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:39:21,847 INFO L168 Benchmark]: RCFGBuilder took 1375.25 ms. Allocated memory was 390.1 MB in the beginning and 486.5 MB in the end (delta: 96.5 MB). Free memory was 345.7 MB in the beginning and 450.3 MB in the end (delta: -104.6 MB). Peak memory consumption was 62.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:39:21,847 INFO L168 Benchmark]: TraceAbstraction took 16737.73 ms. Allocated memory was 486.5 MB in the beginning and 585.1 MB in the end (delta: 98.6 MB). Free memory was 449.3 MB in the beginning and 336.3 MB in the end (delta: 113.0 MB). Peak memory consumption was 212.6 MB. Max. memory is 16.0 GB. [2021-03-26 00:39:21,848 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.37 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 385.31 ms. Allocated memory was 255.9 MB in the beginning and 390.1 MB in the end (delta: 134.2 MB). Free memory was 235.6 MB in the beginning and 350.6 MB in the end (delta: -115.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 33.56 ms. Allocated memory is still 390.1 MB. Free memory was 350.6 MB in the beginning and 347.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 24.51 ms. Allocated memory is still 390.1 MB. Free memory was 347.9 MB in the beginning and 345.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1375.25 ms. Allocated memory was 390.1 MB in the beginning and 486.5 MB in the end (delta: 96.5 MB). Free memory was 345.7 MB in the beginning and 450.3 MB in the end (delta: -104.6 MB). Peak memory consumption was 62.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 16737.73 ms. Allocated memory was 486.5 MB in the beginning and 585.1 MB in the end (delta: 98.6 MB). Free memory was 449.3 MB in the beginning and 336.3 MB in the end (delta: 113.0 MB). Peak memory consumption was 212.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6649.3ms, 102 PlacesBefore, 48 PlacesAfterwards, 94 TransitionsBefore, 39 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 5 FixpointIterations, 26 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 64 TotalNumberOfCompositions, 3065 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1546, positive: 1462, positive conditional: 1462, positive unconditional: 0, negative: 84, negative conditional: 84, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1157, positive: 1122, positive conditional: 0, positive unconditional: 1122, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1157, positive: 1122, positive conditional: 0, positive unconditional: 1122, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1157, positive: 1116, positive conditional: 0, positive unconditional: 1116, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 314, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 302, negative conditional: 0, negative unconditional: 302, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1546, positive: 340, positive conditional: 340, positive unconditional: 0, negative: 49, negative conditional: 49, negative unconditional: 0, unknown: 1157, unknown conditional: 1157, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 58, Positive conditional cache size: 58, 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: 2786.1ms, 45 PlacesBefore, 33 PlacesAfterwards, 32 TransitionsBefore, 24 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 3 FixpointIterations, 7 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 942 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 246, positive: 179, positive conditional: 179, positive unconditional: 0, negative: 67, negative conditional: 67, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, positive: 33, positive conditional: 2, positive unconditional: 31, negative: 11, negative conditional: 1, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 44, positive: 33, positive conditional: 2, positive unconditional: 31, negative: 11, negative conditional: 1, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 44, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 1, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 217, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 217, negative conditional: 18, negative unconditional: 199, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 246, positive: 146, positive conditional: 146, positive unconditional: 0, negative: 56, negative conditional: 56, negative unconditional: 0, unknown: 44, unknown conditional: 44, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 79, Positive conditional cache size: 79, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 966.3ms, 34 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 777 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 272, positive: 212, positive conditional: 212, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, positive: 23, positive conditional: 1, positive unconditional: 22, negative: 6, negative conditional: 2, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, positive: 23, positive conditional: 1, positive unconditional: 22, negative: 6, negative conditional: 2, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 2, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 55, negative conditional: 6, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 272, positive: 189, positive conditional: 189, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 29, unknown conditional: 29, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 102, Positive conditional cache size: 102, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 106.0ms, 32 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 235 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 57, positive: 40, positive conditional: 40, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 12, positive conditional: 4, positive unconditional: 8, 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: 16, positive: 12, positive conditional: 4, positive unconditional: 8, 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: 16, positive: 12, positive conditional: 0, positive unconditional: 12, 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: 99, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 99, negative conditional: 0, negative unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 114, Positive conditional cache size: 114, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.6ms, 36 PlacesBefore, 36 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 248 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 243 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 64, positive: 47, positive conditional: 47, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 18, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 18, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 0, positive unconditional: 20, 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: 64, positive: 27, positive conditional: 27, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 134, Positive conditional cache size: 134, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 67.1ms, 37 PlacesBefore, 37 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 124 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 30, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 8, negative conditional: 8, 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: 5, positive unconditional: 6, 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: 5, positive unconditional: 6, 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: 54, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 187, Positive cache size: 145, Positive conditional cache size: 145, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 52.0ms, 41 PlacesBefore, 41 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 133 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 53, positive: 45, positive conditional: 45, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, positive: 23, positive conditional: 13, positive unconditional: 10, 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: 26, positive: 23, positive conditional: 13, positive unconditional: 10, 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: 26, positive: 23, positive conditional: 0, positive unconditional: 23, 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: 30, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 53, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 213, Positive cache size: 168, Positive conditional cache size: 168, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.0ms, 48 PlacesBefore, 48 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 199 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 102, positive conditional: 102, positive unconditional: 0, negative: 9, negative conditional: 9, 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: 10, positive unconditional: 8, 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: 10, positive unconditional: 8, 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: 111, positive: 84, positive conditional: 84, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 231, Positive cache size: 186, Positive conditional cache size: 186, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 60.0ms, 54 PlacesBefore, 54 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 423 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 314, positive: 295, positive conditional: 295, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, positive: 35, positive conditional: 18, positive unconditional: 17, 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: 35, positive: 35, positive conditional: 18, positive unconditional: 17, 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: 35, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 314, positive: 260, positive conditional: 260, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 221, Positive conditional cache size: 221, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 55.5ms, 58 PlacesBefore, 58 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 302 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 239, positive: 226, positive conditional: 226, 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: 10, positive: 10, positive conditional: 8, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 8, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, 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: 239, positive: 216, positive conditional: 216, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 231, Positive conditional cache size: 231, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 44.2ms, 60 PlacesBefore, 60 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 279 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 209, positive: 195, positive conditional: 195, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, positive: 23, positive conditional: 14, positive unconditional: 9, 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: 23, positive: 23, positive conditional: 14, positive unconditional: 9, 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: 23, positive: 23, positive conditional: 0, positive unconditional: 23, 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: 209, positive: 172, positive conditional: 172, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 23, unknown conditional: 23, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 254, Positive conditional cache size: 254, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 51.0ms, 62 PlacesBefore, 62 PlacesAfterwards, 54 TransitionsBefore, 53 TransitionsAfterwards, 550 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 35 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 35, positive: 35, positive conditional: 35, 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: 35, positive: 35, positive conditional: 35, 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: 35, positive: 35, positive conditional: 35, 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: 35, positive: 35, positive conditional: 0, positive unconditional: 35, 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: 35, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 192, Positive conditional cache size: 192, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 41.8ms, 64 PlacesBefore, 64 PlacesAfterwards, 57 TransitionsBefore, 56 TransitionsAfterwards, 438 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 24 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24, positive: 24, positive conditional: 24, 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: 24, positive: 24, positive conditional: 24, 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: 24, positive: 24, positive conditional: 24, 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: 24, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 192, Positive conditional cache size: 192, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2992.3ms, 65 PlacesBefore, 61 PlacesAfterwards, 54 TransitionsBefore, 51 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 9 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, 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: 9, positive: 9, positive conditional: 9, 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: 9, positive: 9, positive conditional: 9, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 191, Positive cache size: 164, Positive conditional cache size: 164, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.5ms, 61 PlacesBefore, 61 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 191, Positive cache size: 164, Positive conditional cache size: 164, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, 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_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2031; [L819] FCALL, FORK 0 pthread_create(&t2031, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2032; [L821] FCALL, FORK 0 pthread_create(&t2032, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0: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=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L822] 0 pthread_t t2033; [L823] FCALL, FORK 0 pthread_create(&t2033, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 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) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] 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) [L796] 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) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 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 [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 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 [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L829] 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) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] 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) [L829] 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) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 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 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 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 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 16586.6ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1171.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6726.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 56 SDtfs, 18 SDslu, 14 SDs, 0 SdLazy, 331 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 328.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 362.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=522occurred in iteration=10, InterpolantAutomatonStates: 64, 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: 48.7ms SsaConstructionTime, 319.5ms SatisfiabilityAnalysisTime, 822.1ms InterpolantComputationTime, 223 NumberOfCodeBlocks, 223 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 1672 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...