/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix013_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 09:55:17,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 09:55:17,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 09:55:17,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 09:55:17,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 09:55:17,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 09:55:17,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 09:55:17,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 09:55:17,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 09:55:17,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 09:55:17,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 09:55:17,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 09:55:17,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 09:55:17,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 09:55:17,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 09:55:17,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 09:55:17,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 09:55:17,287 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 09:55:17,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 09:55:17,289 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 09:55:17,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 09:55:17,293 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 09:55:17,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 09:55:17,299 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 09:55:17,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 09:55:17,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 09:55:17,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 09:55:17,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 09:55:17,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 09:55:17,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 09:55:17,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 09:55:17,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 09:55:17,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 09:55:17,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 09:55:17,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 09:55:17,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 09:55:17,315 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 09:55:17,316 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 09:55:17,316 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 09:55:17,316 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 09:55:17,317 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 09:55:17,321 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 09:55:17,365 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 09:55:17,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 09:55:17,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 09:55:17,370 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 09:55:17,370 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 09:55:17,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 09:55:17,370 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 09:55:17,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 09:55:17,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 09:55:17,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 09:55:17,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 09:55:17,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 09:55:17,372 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 09:55:17,372 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 09:55:17,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 09:55:17,372 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 09:55:17,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 09:55:17,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 09:55:17,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 09:55:17,373 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 09:55:17,373 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 09:55:17,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 09:55:17,373 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 09:55:17,373 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 09:55:17,373 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 09:55:17,373 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 09:55:17,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 09:55:17,374 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 09:55:17,374 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 09:55:17,374 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 09:55:17,374 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 09:55:17,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 09:55:17,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 09:55:17,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 09:55:17,680 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 09:55:17,680 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 09:55:17,681 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix013_rmo.oepc.i [2021-03-26 09:55:17,729 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/500d31ac1/56a38dd6b72a46c7af12eef0493c2bf9/FLAGc4c3fdad9 [2021-03-26 09:55:18,343 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 09:55:18,343 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013_rmo.oepc.i [2021-03-26 09:55:18,354 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/500d31ac1/56a38dd6b72a46c7af12eef0493c2bf9/FLAGc4c3fdad9 [2021-03-26 09:55:18,728 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/500d31ac1/56a38dd6b72a46c7af12eef0493c2bf9 [2021-03-26 09:55:18,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 09:55:18,731 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 09:55:18,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 09:55:18,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 09:55:18,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 09:55:18,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 09:55:18" (1/1) ... [2021-03-26 09:55:18,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a7f37e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:18, skipping insertion in model container [2021-03-26 09:55:18,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 09:55:18" (1/1) ... [2021-03-26 09:55:18,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 09:55:18,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 09:55:18,918 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/mix013_rmo.oepc.i[949,962] [2021-03-26 09:55:19,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 09:55:19,073 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 09:55:19,082 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/mix013_rmo.oepc.i[949,962] [2021-03-26 09:55:19,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 09:55:19,226 INFO L208 MainTranslator]: Completed translation [2021-03-26 09:55:19,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:19 WrapperNode [2021-03-26 09:55:19,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 09:55:19,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 09:55:19,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 09:55:19,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 09:55:19,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:19" (1/1) ... [2021-03-26 09:55:19,270 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:19" (1/1) ... [2021-03-26 09:55:19,302 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 09:55:19,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 09:55:19,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 09:55:19,303 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 09:55:19,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:19" (1/1) ... [2021-03-26 09:55:19,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:19" (1/1) ... [2021-03-26 09:55:19,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:19" (1/1) ... [2021-03-26 09:55:19,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:19" (1/1) ... [2021-03-26 09:55:19,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:19" (1/1) ... [2021-03-26 09:55:19,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:19" (1/1) ... [2021-03-26 09:55:19,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:19" (1/1) ... [2021-03-26 09:55:19,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 09:55:19,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 09:55:19,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 09:55:19,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 09:55:19,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:19" (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 09:55:19,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 09:55:19,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 09:55:19,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 09:55:19,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 09:55:19,446 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 09:55:19,446 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 09:55:19,447 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 09:55:19,447 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 09:55:19,447 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 09:55:19,447 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 09:55:19,447 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 09:55:19,447 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 09:55:19,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 09:55:19,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 09:55:19,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 09:55:19,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 09:55:19,450 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 09:55:21,460 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 09:55:21,461 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 09:55:21,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 09:55:21 BoogieIcfgContainer [2021-03-26 09:55:21,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 09:55:21,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 09:55:21,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 09:55:21,467 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 09:55:21,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 09:55:18" (1/3) ... [2021-03-26 09:55:21,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10853db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 09:55:21, skipping insertion in model container [2021-03-26 09:55:21,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:55:19" (2/3) ... [2021-03-26 09:55:21,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10853db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 09:55:21, skipping insertion in model container [2021-03-26 09:55:21,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 09:55:21" (3/3) ... [2021-03-26 09:55:21,471 INFO L111 eAbstractionObserver]: Analyzing ICFG mix013_rmo.oepc.i [2021-03-26 09:55:21,477 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 09:55:21,481 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 09:55:21,481 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 09:55:21,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,525 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,525 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,526 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,526 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,526 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,526 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,526 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,527 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,531 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,531 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,532 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,532 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,535 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,535 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,535 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,536 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,539 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,539 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,540 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,540 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,540 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,540 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,540 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,540 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,540 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,541 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,542 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,545 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,546 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,546 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,546 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,558 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,558 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,558 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,558 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,558 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,558 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,568 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,569 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,569 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,569 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,569 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,569 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,569 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,570 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,570 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,570 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,570 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,570 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,570 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,570 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,571 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,571 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,571 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,571 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,573 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,574 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,577 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,577 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,577 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,577 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,586 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,586 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,591 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,591 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,591 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,595 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,595 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,597 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,598 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:55:21,600 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 09:55:21,615 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 09:55:21,642 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 09:55:21,642 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 09:55:21,642 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 09:55:21,643 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 09:55:21,643 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 09:55:21,643 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 09:55:21,643 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 09:55:21,643 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 09:55:21,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 121 transitions, 262 flow [2021-03-26 09:55:21,710 INFO L129 PetriNetUnfolder]: 2/117 cut-off events. [2021-03-26 09:55:21,710 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:55:21,719 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-26 09:55:21,720 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 121 transitions, 262 flow [2021-03-26 09:55:21,731 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 117 transitions, 246 flow [2021-03-26 09:55:21,732 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:21,746 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 117 transitions, 246 flow [2021-03-26 09:55:21,749 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 117 transitions, 246 flow [2021-03-26 09:55:21,752 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 246 flow [2021-03-26 09:55:21,786 INFO L129 PetriNetUnfolder]: 2/117 cut-off events. [2021-03-26 09:55:21,786 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:55:21,787 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-26 09:55:21,792 INFO L142 LiptonReduction]: Number of co-enabled transitions 2894 [2021-03-26 09:55:23,428 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 09:55:23,854 WARN L205 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 09:55:23,966 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 09:55:25,368 INFO L154 LiptonReduction]: Checked pairs total: 5923 [2021-03-26 09:55:25,368 INFO L156 LiptonReduction]: Total number of compositions: 77 [2021-03-26 09:55:25,370 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3639 [2021-03-26 09:55:25,378 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-26 09:55:25,378 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:55:25,379 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:25,379 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:25,379 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:25,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:25,383 INFO L82 PathProgramCache]: Analyzing trace with hash -554722087, now seen corresponding path program 1 times [2021-03-26 09:55:25,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:25,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815465477] [2021-03-26 09:55:25,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:25,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:25,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:55:25,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:25,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:25,614 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 09:55:25,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815465477] [2021-03-26 09:55:25,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:25,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 09:55:25,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648105027] [2021-03-26 09:55:25,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 09:55:25,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:25,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 09:55:25,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 09:55:25,637 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 198 [2021-03-26 09:55:25,641 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states 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 09:55:25,642 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:25,642 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 198 [2021-03-26 09:55:25,643 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:25,786 INFO L129 PetriNetUnfolder]: 133/372 cut-off events. [2021-03-26 09:55:25,786 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:55:25,789 INFO L84 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 372 events. 133/372 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2107 event pairs, 110 based on Foata normal form. 32/377 useless extension candidates. Maximal degree in co-relation 568. Up to 153 conditions per place. [2021-03-26 09:55:25,792 INFO L132 encePairwiseOnDemand]: 194/198 looper letters, 11 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2021-03-26 09:55:25,792 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 52 transitions, 142 flow [2021-03-26 09:55:25,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 09:55:25,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 09:55:25,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 544 transitions. [2021-03-26 09:55:25,811 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9158249158249159 [2021-03-26 09:55:25,811 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 544 transitions. [2021-03-26 09:55:25,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 544 transitions. [2021-03-26 09:55:25,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:25,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 544 transitions. [2021-03-26 09:55:25,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 0 states 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 09:55:25,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states 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 09:55:25,832 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states 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 09:55:25,834 INFO L185 Difference]: Start difference. First operand has 62 places, 50 transitions, 112 flow. Second operand 3 states and 544 transitions. [2021-03-26 09:55:25,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 52 transitions, 142 flow [2021-03-26 09:55:25,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 52 transitions, 138 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 09:55:25,841 INFO L241 Difference]: Finished difference. Result has 58 places, 47 transitions, 106 flow [2021-03-26 09:55:25,842 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2021-03-26 09:55:25,843 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2021-03-26 09:55:25,843 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:25,843 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 47 transitions, 106 flow [2021-03-26 09:55:25,844 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 47 transitions, 106 flow [2021-03-26 09:55:25,845 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 47 transitions, 106 flow [2021-03-26 09:55:25,850 INFO L129 PetriNetUnfolder]: 0/47 cut-off events. [2021-03-26 09:55:25,850 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:55:25,850 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 47 events. 0/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 09:55:25,852 INFO L142 LiptonReduction]: Number of co-enabled transitions 670 [2021-03-26 09:55:27,314 INFO L154 LiptonReduction]: Checked pairs total: 2974 [2021-03-26 09:55:27,314 INFO L156 LiptonReduction]: Total number of compositions: 14 [2021-03-26 09:55:27,315 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1472 [2021-03-26 09:55:27,316 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 78 flow [2021-03-26 09:55:27,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states 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 09:55:27,316 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:27,316 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:27,317 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 09:55:27,317 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:27,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:27,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1604568838, now seen corresponding path program 1 times [2021-03-26 09:55:27,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:27,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275309024] [2021-03-26 09:55:27,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:27,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:27,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:55:27,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:27,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:27,447 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 09:55:27,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 09:55:27,451 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 09:55:27,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275309024] [2021-03-26 09:55:27,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:27,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:55:27,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994851303] [2021-03-26 09:55:27,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:55:27,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:27,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:55:27,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:55:27,454 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 212 [2021-03-26 09:55:27,455 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:55:27,455 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:27,455 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 212 [2021-03-26 09:55:27,455 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:27,479 INFO L129 PetriNetUnfolder]: 1/35 cut-off events. [2021-03-26 09:55:27,480 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:55:27,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 35 events. 1/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 64 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 43. Up to 3 conditions per place. [2021-03-26 09:55:27,480 INFO L132 encePairwiseOnDemand]: 208/212 looper letters, 1 selfloop transitions, 2 changer transitions 4/35 dead transitions. [2021-03-26 09:55:27,480 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 35 transitions, 94 flow [2021-03-26 09:55:27,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 09:55:27,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 09:55:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 942 transitions. [2021-03-26 09:55:27,483 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8886792452830189 [2021-03-26 09:55:27,483 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 942 transitions. [2021-03-26 09:55:27,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 942 transitions. [2021-03-26 09:55:27,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:27,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 942 transitions. [2021-03-26 09:55:27,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 188.4) internal successors, (942), 5 states have internal predecessors, (942), 0 states have call successors, (0), 0 states 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 09:55:27,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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 09:55:27,489 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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 09:55:27,489 INFO L185 Difference]: Start difference. First operand has 44 places, 33 transitions, 78 flow. Second operand 5 states and 942 transitions. [2021-03-26 09:55:27,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 35 transitions, 94 flow [2021-03-26 09:55:27,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 35 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 09:55:27,490 INFO L241 Difference]: Finished difference. Result has 47 places, 31 transitions, 78 flow [2021-03-26 09:55:27,491 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2021-03-26 09:55:27,491 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -15 predicate places. [2021-03-26 09:55:27,491 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:27,491 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 31 transitions, 78 flow [2021-03-26 09:55:27,491 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 31 transitions, 78 flow [2021-03-26 09:55:27,492 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 31 transitions, 78 flow [2021-03-26 09:55:27,495 INFO L129 PetriNetUnfolder]: 0/31 cut-off events. [2021-03-26 09:55:27,495 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:55:27,538 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 09:55:27,539 INFO L142 LiptonReduction]: Number of co-enabled transitions 450 [2021-03-26 09:55:28,254 WARN L205 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-03-26 09:55:28,399 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-26 09:55:28,730 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-03-26 09:55:28,884 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-26 09:55:28,888 INFO L154 LiptonReduction]: Checked pairs total: 1622 [2021-03-26 09:55:28,889 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 09:55:28,889 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1398 [2021-03-26 09:55:28,890 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 72 flow [2021-03-26 09:55:28,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:55:28,890 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:28,891 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:28,891 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 09:55:28,891 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:28,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:28,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1487951492, now seen corresponding path program 1 times [2021-03-26 09:55:28,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:28,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332005304] [2021-03-26 09:55:28,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:28,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:28,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:28,982 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-26 09:55:28,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 09:55:28,997 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 09:55:28,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332005304] [2021-03-26 09:55:28,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:28,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 09:55:28,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974295120] [2021-03-26 09:55:28,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:55:28,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:28,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:55:28,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:55:29,000 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 215 [2021-03-26 09:55:29,001 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:55:29,001 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:29,001 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 215 [2021-03-26 09:55:29,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:29,050 INFO L129 PetriNetUnfolder]: 81/233 cut-off events. [2021-03-26 09:55:29,050 INFO L130 PetriNetUnfolder]: For 34/43 co-relation queries the response was YES. [2021-03-26 09:55:29,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 233 events. 81/233 cut-off events. For 34/43 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1203 event pairs, 51 based on Foata normal form. 8/234 useless extension candidates. Maximal degree in co-relation 409. Up to 113 conditions per place. [2021-03-26 09:55:29,052 INFO L132 encePairwiseOnDemand]: 212/215 looper letters, 10 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2021-03-26 09:55:29,052 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 32 transitions, 107 flow [2021-03-26 09:55:29,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 09:55:29,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 09:55:29,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2021-03-26 09:55:29,055 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8480620155038759 [2021-03-26 09:55:29,055 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 547 transitions. [2021-03-26 09:55:29,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 547 transitions. [2021-03-26 09:55:29,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:29,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 547 transitions. [2021-03-26 09:55:29,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states 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 09:55:29,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states 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 09:55:29,059 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states 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 09:55:29,059 INFO L185 Difference]: Start difference. First operand has 40 places, 28 transitions, 72 flow. Second operand 3 states and 547 transitions. [2021-03-26 09:55:29,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 32 transitions, 107 flow [2021-03-26 09:55:29,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 32 transitions, 101 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 09:55:29,060 INFO L241 Difference]: Finished difference. Result has 41 places, 28 transitions, 76 flow [2021-03-26 09:55:29,060 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2021-03-26 09:55:29,060 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -21 predicate places. [2021-03-26 09:55:29,060 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:29,061 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 28 transitions, 76 flow [2021-03-26 09:55:29,061 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 28 transitions, 76 flow [2021-03-26 09:55:29,061 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 28 transitions, 76 flow [2021-03-26 09:55:29,065 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-26 09:55:29,066 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 09:55:29,066 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 28 events. 0/28 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 09:55:29,066 INFO L142 LiptonReduction]: Number of co-enabled transitions 416 [2021-03-26 09:55:29,101 INFO L154 LiptonReduction]: Checked pairs total: 948 [2021-03-26 09:55:29,102 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 09:55:29,102 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 42 [2021-03-26 09:55:29,105 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 74 flow [2021-03-26 09:55:29,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:55:29,105 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:29,105 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:29,106 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 09:55:29,106 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:29,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:29,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1404283637, now seen corresponding path program 1 times [2021-03-26 09:55:29,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:29,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546709812] [2021-03-26 09:55:29,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:29,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:29,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:29,200 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 09:55:29,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 09:55:29,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:29,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:55:29,206 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 09:55:29,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546709812] [2021-03-26 09:55:29,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:29,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:55:29,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24820490] [2021-03-26 09:55:29,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:55:29,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:29,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:55:29,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:55:29,210 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 216 [2021-03-26 09:55:29,211 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:55:29,211 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:29,211 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 216 [2021-03-26 09:55:29,211 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:29,260 INFO L129 PetriNetUnfolder]: 90/186 cut-off events. [2021-03-26 09:55:29,260 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-03-26 09:55:29,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 186 events. 90/186 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 799 event pairs, 46 based on Foata normal form. 16/199 useless extension candidates. Maximal degree in co-relation 374. Up to 119 conditions per place. [2021-03-26 09:55:29,262 INFO L132 encePairwiseOnDemand]: 209/216 looper letters, 6 selfloop transitions, 5 changer transitions 9/40 dead transitions. [2021-03-26 09:55:29,262 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 40 transitions, 140 flow [2021-03-26 09:55:29,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 09:55:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 09:55:29,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 912 transitions. [2021-03-26 09:55:29,265 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2021-03-26 09:55:29,265 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 912 transitions. [2021-03-26 09:55:29,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 912 transitions. [2021-03-26 09:55:29,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:29,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 912 transitions. [2021-03-26 09:55:29,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 182.4) internal successors, (912), 5 states have internal predecessors, (912), 0 states have call successors, (0), 0 states 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 09:55:29,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states 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 09:55:29,270 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states 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 09:55:29,270 INFO L185 Difference]: Start difference. First operand has 40 places, 27 transitions, 74 flow. Second operand 5 states and 912 transitions. [2021-03-26 09:55:29,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 40 transitions, 140 flow [2021-03-26 09:55:29,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 40 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 09:55:29,273 INFO L241 Difference]: Finished difference. Result has 45 places, 31 transitions, 115 flow [2021-03-26 09:55:29,273 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2021-03-26 09:55:29,273 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -17 predicate places. [2021-03-26 09:55:29,273 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:29,274 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 31 transitions, 115 flow [2021-03-26 09:55:29,274 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 31 transitions, 115 flow [2021-03-26 09:55:29,274 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 31 transitions, 115 flow [2021-03-26 09:55:29,292 INFO L129 PetriNetUnfolder]: 73/150 cut-off events. [2021-03-26 09:55:29,292 INFO L130 PetriNetUnfolder]: For 91/91 co-relation queries the response was YES. [2021-03-26 09:55:29,292 INFO L84 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 150 events. 73/150 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 585 event pairs, 40 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 401. Up to 104 conditions per place. [2021-03-26 09:55:29,294 INFO L142 LiptonReduction]: Number of co-enabled transitions 444 [2021-03-26 09:55:29,299 INFO L154 LiptonReduction]: Checked pairs total: 402 [2021-03-26 09:55:29,299 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:55:29,299 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 26 [2021-03-26 09:55:29,303 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 115 flow [2021-03-26 09:55:29,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:55:29,304 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:29,304 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:29,304 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 09:55:29,304 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:29,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:29,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1557030784, now seen corresponding path program 1 times [2021-03-26 09:55:29,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:29,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152686816] [2021-03-26 09:55:29,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:29,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:29,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:29,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:29,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:29,385 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 09:55:29,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 09:55:29,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:29,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:55:29,391 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 09:55:29,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152686816] [2021-03-26 09:55:29,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:29,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 09:55:29,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334535847] [2021-03-26 09:55:29,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 09:55:29,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:29,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 09:55:29,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 09:55:29,393 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 216 [2021-03-26 09:55:29,394 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 0 states have call successors, (0), 0 states 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 09:55:29,394 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:29,394 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 216 [2021-03-26 09:55:29,394 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:29,464 INFO L129 PetriNetUnfolder]: 66/149 cut-off events. [2021-03-26 09:55:29,465 INFO L130 PetriNetUnfolder]: For 114/138 co-relation queries the response was YES. [2021-03-26 09:55:29,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 149 events. 66/149 cut-off events. For 114/138 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 551 event pairs, 14 based on Foata normal form. 22/167 useless extension candidates. Maximal degree in co-relation 516. Up to 108 conditions per place. [2021-03-26 09:55:29,466 INFO L132 encePairwiseOnDemand]: 209/216 looper letters, 6 selfloop transitions, 9 changer transitions 9/44 dead transitions. [2021-03-26 09:55:29,466 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 239 flow [2021-03-26 09:55:29,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 09:55:29,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 09:55:29,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1094 transitions. [2021-03-26 09:55:29,469 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8441358024691358 [2021-03-26 09:55:29,469 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1094 transitions. [2021-03-26 09:55:29,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1094 transitions. [2021-03-26 09:55:29,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:29,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1094 transitions. [2021-03-26 09:55:29,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 182.33333333333334) internal successors, (1094), 6 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states 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 09:55:29,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states 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 09:55:29,476 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states 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 09:55:29,476 INFO L185 Difference]: Start difference. First operand has 43 places, 31 transitions, 115 flow. Second operand 6 states and 1094 transitions. [2021-03-26 09:55:29,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 239 flow [2021-03-26 09:55:29,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 232 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 09:55:29,479 INFO L241 Difference]: Finished difference. Result has 49 places, 35 transitions, 180 flow [2021-03-26 09:55:29,479 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2021-03-26 09:55:29,479 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -13 predicate places. [2021-03-26 09:55:29,479 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:29,480 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 35 transitions, 180 flow [2021-03-26 09:55:29,480 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 35 transitions, 180 flow [2021-03-26 09:55:29,480 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 35 transitions, 180 flow [2021-03-26 09:55:29,493 INFO L129 PetriNetUnfolder]: 49/114 cut-off events. [2021-03-26 09:55:29,493 INFO L130 PetriNetUnfolder]: For 182/197 co-relation queries the response was YES. [2021-03-26 09:55:29,494 INFO L84 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 114 events. 49/114 cut-off events. For 182/197 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 386 event pairs, 13 based on Foata normal form. 4/115 useless extension candidates. Maximal degree in co-relation 439. Up to 76 conditions per place. [2021-03-26 09:55:29,495 INFO L142 LiptonReduction]: Number of co-enabled transitions 528 [2021-03-26 09:55:29,547 INFO L154 LiptonReduction]: Checked pairs total: 480 [2021-03-26 09:55:29,547 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:55:29,547 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 68 [2021-03-26 09:55:29,548 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 180 flow [2021-03-26 09:55:29,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 0 states have call successors, (0), 0 states 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 09:55:29,549 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:29,549 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 09:55:29,549 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 09:55:29,549 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:29,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:29,549 INFO L82 PathProgramCache]: Analyzing trace with hash 2112743192, now seen corresponding path program 1 times [2021-03-26 09:55:29,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:29,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416077773] [2021-03-26 09:55:29,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:29,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:29,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:29,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:29,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:29,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:29,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:29,676 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 09:55:29,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 09:55:29,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:29,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:55:29,685 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 09:55:29,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416077773] [2021-03-26 09:55:29,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:29,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 09:55:29,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139743627] [2021-03-26 09:55:29,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 09:55:29,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:29,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 09:55:29,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 09:55:29,687 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 216 [2021-03-26 09:55:29,687 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 178.83333333333334) internal successors, (1073), 6 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states 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 09:55:29,688 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:29,688 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 216 [2021-03-26 09:55:29,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:29,751 INFO L129 PetriNetUnfolder]: 36/97 cut-off events. [2021-03-26 09:55:29,751 INFO L130 PetriNetUnfolder]: For 204/248 co-relation queries the response was YES. [2021-03-26 09:55:29,752 INFO L84 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 97 events. 36/97 cut-off events. For 204/248 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 288 event pairs, 2 based on Foata normal form. 25/119 useless extension candidates. Maximal degree in co-relation 438. Up to 68 conditions per place. [2021-03-26 09:55:29,752 INFO L132 encePairwiseOnDemand]: 209/216 looper letters, 6 selfloop transitions, 13 changer transitions 9/48 dead transitions. [2021-03-26 09:55:29,753 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 48 transitions, 362 flow [2021-03-26 09:55:29,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 09:55:29,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 09:55:29,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1276 transitions. [2021-03-26 09:55:29,756 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.843915343915344 [2021-03-26 09:55:29,756 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1276 transitions. [2021-03-26 09:55:29,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1276 transitions. [2021-03-26 09:55:29,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:29,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1276 transitions. [2021-03-26 09:55:29,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 182.28571428571428) internal successors, (1276), 7 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states 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 09:55:29,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states 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 09:55:29,762 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states 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 09:55:29,762 INFO L185 Difference]: Start difference. First operand has 47 places, 35 transitions, 180 flow. Second operand 7 states and 1276 transitions. [2021-03-26 09:55:29,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 48 transitions, 362 flow [2021-03-26 09:55:29,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 48 transitions, 300 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 09:55:29,767 INFO L241 Difference]: Finished difference. Result has 52 places, 39 transitions, 230 flow [2021-03-26 09:55:29,767 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=230, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2021-03-26 09:55:29,767 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -10 predicate places. [2021-03-26 09:55:29,767 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:29,767 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 39 transitions, 230 flow [2021-03-26 09:55:29,768 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 39 transitions, 230 flow [2021-03-26 09:55:29,768 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 39 transitions, 230 flow [2021-03-26 09:55:29,776 INFO L129 PetriNetUnfolder]: 25/75 cut-off events. [2021-03-26 09:55:29,776 INFO L130 PetriNetUnfolder]: For 157/172 co-relation queries the response was YES. [2021-03-26 09:55:29,777 INFO L84 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 75 events. 25/75 cut-off events. For 157/172 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 193 event pairs, 2 based on Foata normal form. 4/76 useless extension candidates. Maximal degree in co-relation 277. Up to 42 conditions per place. [2021-03-26 09:55:29,777 INFO L142 LiptonReduction]: Number of co-enabled transitions 528 [2021-03-26 09:55:29,820 INFO L154 LiptonReduction]: Checked pairs total: 553 [2021-03-26 09:55:29,820 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:55:29,820 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 53 [2021-03-26 09:55:29,823 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 230 flow [2021-03-26 09:55:29,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 178.83333333333334) internal successors, (1073), 6 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states 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 09:55:29,824 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:29,824 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:29,824 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 09:55:29,824 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:29,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:29,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1217496035, now seen corresponding path program 1 times [2021-03-26 09:55:29,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:29,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542475147] [2021-03-26 09:55:29,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:29,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:29,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:55:29,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:29,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:29,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:29,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:29,909 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 09:55:29,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542475147] [2021-03-26 09:55:29,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:29,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:55:29,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694429611] [2021-03-26 09:55:29,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:55:29,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:29,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:55:29,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:55:29,910 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 216 [2021-03-26 09:55:29,911 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:55:29,911 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:29,911 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 216 [2021-03-26 09:55:29,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:29,936 INFO L129 PetriNetUnfolder]: 49/130 cut-off events. [2021-03-26 09:55:29,937 INFO L130 PetriNetUnfolder]: For 328/366 co-relation queries the response was YES. [2021-03-26 09:55:29,937 INFO L84 FinitePrefix]: Finished finitePrefix Result has 545 conditions, 130 events. 49/130 cut-off events. For 328/366 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 439 event pairs, 4 based on Foata normal form. 10/128 useless extension candidates. Maximal degree in co-relation 527. Up to 82 conditions per place. [2021-03-26 09:55:29,938 INFO L132 encePairwiseOnDemand]: 213/216 looper letters, 3 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2021-03-26 09:55:29,938 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 40 transitions, 242 flow [2021-03-26 09:55:29,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 09:55:29,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 09:55:29,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 742 transitions. [2021-03-26 09:55:29,940 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8587962962962963 [2021-03-26 09:55:29,940 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 742 transitions. [2021-03-26 09:55:29,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 742 transitions. [2021-03-26 09:55:29,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:29,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 742 transitions. [2021-03-26 09:55:29,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 185.5) internal successors, (742), 4 states have internal predecessors, (742), 0 states have call successors, (0), 0 states 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 09:55:29,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states 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 09:55:29,944 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states 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 09:55:29,944 INFO L185 Difference]: Start difference. First operand has 50 places, 39 transitions, 230 flow. Second operand 4 states and 742 transitions. [2021-03-26 09:55:29,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 40 transitions, 242 flow [2021-03-26 09:55:29,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 188 flow, removed 18 selfloop flow, removed 5 redundant places. [2021-03-26 09:55:29,948 INFO L241 Difference]: Finished difference. Result has 50 places, 40 transitions, 189 flow [2021-03-26 09:55:29,948 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2021-03-26 09:55:29,948 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -12 predicate places. [2021-03-26 09:55:29,948 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:29,948 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 40 transitions, 189 flow [2021-03-26 09:55:29,948 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 40 transitions, 189 flow [2021-03-26 09:55:29,949 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 189 flow [2021-03-26 09:55:29,983 INFO L129 PetriNetUnfolder]: 49/130 cut-off events. [2021-03-26 09:55:29,984 INFO L130 PetriNetUnfolder]: For 194/203 co-relation queries the response was YES. [2021-03-26 09:55:29,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 130 events. 49/130 cut-off events. For 194/203 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 471 event pairs, 4 based on Foata normal form. 4/122 useless extension candidates. Maximal degree in co-relation 382. Up to 60 conditions per place. [2021-03-26 09:55:29,985 INFO L142 LiptonReduction]: Number of co-enabled transitions 552 [2021-03-26 09:55:30,000 INFO L154 LiptonReduction]: Checked pairs total: 595 [2021-03-26 09:55:30,000 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:55:30,000 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 52 [2021-03-26 09:55:30,002 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 189 flow [2021-03-26 09:55:30,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:55:30,003 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:30,003 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:30,003 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 09:55:30,003 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:30,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:30,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1398769407, now seen corresponding path program 2 times [2021-03-26 09:55:30,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:30,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560747810] [2021-03-26 09:55:30,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:30,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:30,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:30,114 INFO L142 QuantifierPusher]: treesize reduction 2, result has 88.9 percent of original size [2021-03-26 09:55:30,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 09:55:30,125 INFO L142 QuantifierPusher]: treesize reduction 10, result has 60.0 percent of original size [2021-03-26 09:55:30,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 09:55:30,138 INFO L142 QuantifierPusher]: treesize reduction 17, result has 70.2 percent of original size [2021-03-26 09:55:30,139 INFO L147 QuantifierPusher]: treesize reduction 9, result has 77.5 percent of original size 31 [2021-03-26 09:55:30,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:30,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:30,166 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 09:55:30,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560747810] [2021-03-26 09:55:30,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:30,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 09:55:30,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631817984] [2021-03-26 09:55:30,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 09:55:30,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:30,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 09:55:30,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-26 09:55:30,169 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 216 [2021-03-26 09:55:30,170 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 189 flow. Second operand has 7 states, 7 states have (on average 167.14285714285714) internal successors, (1170), 7 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states 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 09:55:30,170 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:30,171 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 216 [2021-03-26 09:55:30,171 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:30,437 INFO L129 PetriNetUnfolder]: 430/943 cut-off events. [2021-03-26 09:55:30,437 INFO L130 PetriNetUnfolder]: For 1086/1296 co-relation queries the response was YES. [2021-03-26 09:55:30,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2619 conditions, 943 events. 430/943 cut-off events. For 1086/1296 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6173 event pairs, 53 based on Foata normal form. 75/956 useless extension candidates. Maximal degree in co-relation 2602. Up to 338 conditions per place. [2021-03-26 09:55:30,445 INFO L132 encePairwiseOnDemand]: 207/216 looper letters, 12 selfloop transitions, 15 changer transitions 2/60 dead transitions. [2021-03-26 09:55:30,445 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 60 transitions, 301 flow [2021-03-26 09:55:30,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 09:55:30,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 09:55:30,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1192 transitions. [2021-03-26 09:55:30,448 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7883597883597884 [2021-03-26 09:55:30,448 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1192 transitions. [2021-03-26 09:55:30,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1192 transitions. [2021-03-26 09:55:30,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:30,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1192 transitions. [2021-03-26 09:55:30,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 170.28571428571428) internal successors, (1192), 7 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states 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 09:55:30,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states 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 09:55:30,454 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states 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 09:55:30,454 INFO L185 Difference]: Start difference. First operand has 50 places, 40 transitions, 189 flow. Second operand 7 states and 1192 transitions. [2021-03-26 09:55:30,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 60 transitions, 301 flow [2021-03-26 09:55:30,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 60 transitions, 300 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 09:55:30,467 INFO L241 Difference]: Finished difference. Result has 59 places, 55 transitions, 291 flow [2021-03-26 09:55:30,468 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=291, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2021-03-26 09:55:30,468 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2021-03-26 09:55:30,468 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:30,468 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 55 transitions, 291 flow [2021-03-26 09:55:30,468 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 55 transitions, 291 flow [2021-03-26 09:55:30,469 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 55 transitions, 291 flow [2021-03-26 09:55:30,542 INFO L129 PetriNetUnfolder]: 389/845 cut-off events. [2021-03-26 09:55:30,543 INFO L130 PetriNetUnfolder]: For 1109/1298 co-relation queries the response was YES. [2021-03-26 09:55:30,546 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2535 conditions, 845 events. 389/845 cut-off events. For 1109/1298 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5521 event pairs, 28 based on Foata normal form. 67/849 useless extension candidates. Maximal degree in co-relation 2515. Up to 356 conditions per place. [2021-03-26 09:55:30,554 INFO L142 LiptonReduction]: Number of co-enabled transitions 876 [2021-03-26 09:55:30,592 INFO L154 LiptonReduction]: Checked pairs total: 233 [2021-03-26 09:55:30,593 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:55:30,593 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 125 [2021-03-26 09:55:30,593 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 291 flow [2021-03-26 09:55:30,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 167.14285714285714) internal successors, (1170), 7 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states 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 09:55:30,594 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:30,594 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:30,594 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 09:55:30,594 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:30,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:30,594 INFO L82 PathProgramCache]: Analyzing trace with hash -621865249, now seen corresponding path program 3 times [2021-03-26 09:55:30,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:30,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701926975] [2021-03-26 09:55:30,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:30,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:30,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:30,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:30,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:30,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:30,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:30,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:30,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:30,700 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 09:55:30,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 09:55:30,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:30,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:55:30,707 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 09:55:30,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701926975] [2021-03-26 09:55:30,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:30,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 09:55:30,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036622836] [2021-03-26 09:55:30,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 09:55:30,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:30,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 09:55:30,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 09:55:30,708 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 216 [2021-03-26 09:55:30,710 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 291 flow. Second operand has 7 states, 7 states have (on average 178.85714285714286) internal successors, (1252), 7 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states 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 09:55:30,710 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:30,710 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 216 [2021-03-26 09:55:30,710 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:30,846 INFO L129 PetriNetUnfolder]: 315/734 cut-off events. [2021-03-26 09:55:30,846 INFO L130 PetriNetUnfolder]: For 1615/2503 co-relation queries the response was YES. [2021-03-26 09:55:30,850 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2696 conditions, 734 events. 315/734 cut-off events. For 1615/2503 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4887 event pairs, 27 based on Foata normal form. 413/1092 useless extension candidates. Maximal degree in co-relation 2674. Up to 322 conditions per place. [2021-03-26 09:55:30,853 INFO L132 encePairwiseOnDemand]: 209/216 looper letters, 3 selfloop transitions, 18 changer transitions 4/59 dead transitions. [2021-03-26 09:55:30,853 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 59 transitions, 382 flow [2021-03-26 09:55:30,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 09:55:30,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 09:55:30,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1450 transitions. [2021-03-26 09:55:30,856 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8391203703703703 [2021-03-26 09:55:30,857 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1450 transitions. [2021-03-26 09:55:30,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1450 transitions. [2021-03-26 09:55:30,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:30,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1450 transitions. [2021-03-26 09:55:30,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 181.25) internal successors, (1450), 8 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states 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 09:55:30,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 216.0) internal successors, (1944), 9 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states 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 09:55:30,864 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 216.0) internal successors, (1944), 9 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states 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 09:55:30,864 INFO L185 Difference]: Start difference. First operand has 59 places, 55 transitions, 291 flow. Second operand 8 states and 1450 transitions. [2021-03-26 09:55:30,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 59 transitions, 382 flow [2021-03-26 09:55:30,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 59 transitions, 352 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-03-26 09:55:30,871 INFO L241 Difference]: Finished difference. Result has 65 places, 55 transitions, 326 flow [2021-03-26 09:55:30,872 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=326, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2021-03-26 09:55:30,872 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2021-03-26 09:55:30,872 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:30,872 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 55 transitions, 326 flow [2021-03-26 09:55:30,872 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 55 transitions, 326 flow [2021-03-26 09:55:30,873 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 55 transitions, 326 flow [2021-03-26 09:55:30,937 INFO L129 PetriNetUnfolder]: 322/740 cut-off events. [2021-03-26 09:55:30,937 INFO L130 PetriNetUnfolder]: For 1329/1468 co-relation queries the response was YES. [2021-03-26 09:55:30,941 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2695 conditions, 740 events. 322/740 cut-off events. For 1329/1468 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4936 event pairs, 16 based on Foata normal form. 1/682 useless extension candidates. Maximal degree in co-relation 2674. Up to 313 conditions per place. [2021-03-26 09:55:30,948 INFO L142 LiptonReduction]: Number of co-enabled transitions 822 [2021-03-26 09:55:31,076 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 09:55:31,273 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-03-26 09:55:31,397 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-03-26 09:55:31,630 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-03-26 09:55:31,742 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-03-26 09:55:31,757 INFO L154 LiptonReduction]: Checked pairs total: 542 [2021-03-26 09:55:31,757 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 09:55:31,757 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 885 [2021-03-26 09:55:31,757 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 326 flow [2021-03-26 09:55:31,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 178.85714285714286) internal successors, (1252), 7 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states 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 09:55:31,758 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:31,758 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:31,758 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 09:55:31,758 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:31,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:31,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1295289093, now seen corresponding path program 1 times [2021-03-26 09:55:31,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:31,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508365982] [2021-03-26 09:55:31,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:31,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:31,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:55:31,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:31,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:31,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:31,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:31,809 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 09:55:31,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508365982] [2021-03-26 09:55:31,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:31,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:55:31,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913021739] [2021-03-26 09:55:31,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:55:31,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:31,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:55:31,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:55:31,811 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 218 [2021-03-26 09:55:31,811 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 326 flow. Second operand has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states 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 09:55:31,811 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:31,811 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 218 [2021-03-26 09:55:31,811 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:31,948 INFO L129 PetriNetUnfolder]: 545/1260 cut-off events. [2021-03-26 09:55:31,948 INFO L130 PetriNetUnfolder]: For 2311/2587 co-relation queries the response was YES. [2021-03-26 09:55:31,955 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4597 conditions, 1260 events. 545/1260 cut-off events. For 2311/2587 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 9651 event pairs, 50 based on Foata normal form. 3/1131 useless extension candidates. Maximal degree in co-relation 4575. Up to 541 conditions per place. [2021-03-26 09:55:31,959 INFO L132 encePairwiseOnDemand]: 214/218 looper letters, 3 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2021-03-26 09:55:31,959 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 54 transitions, 325 flow [2021-03-26 09:55:31,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 09:55:31,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 09:55:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 751 transitions. [2021-03-26 09:55:31,962 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8612385321100917 [2021-03-26 09:55:31,962 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 751 transitions. [2021-03-26 09:55:31,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 751 transitions. [2021-03-26 09:55:31,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:31,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 751 transitions. [2021-03-26 09:55:31,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:55:31,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states 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 09:55:31,966 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states 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 09:55:31,966 INFO L185 Difference]: Start difference. First operand has 63 places, 54 transitions, 326 flow. Second operand 4 states and 751 transitions. [2021-03-26 09:55:31,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 54 transitions, 325 flow [2021-03-26 09:55:31,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 54 transitions, 265 flow, removed 17 selfloop flow, removed 6 redundant places. [2021-03-26 09:55:31,994 INFO L241 Difference]: Finished difference. Result has 62 places, 54 transitions, 266 flow [2021-03-26 09:55:31,994 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2021-03-26 09:55:31,995 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2021-03-26 09:55:31,995 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:31,995 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 54 transitions, 266 flow [2021-03-26 09:55:31,995 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 54 transitions, 266 flow [2021-03-26 09:55:31,995 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 54 transitions, 266 flow [2021-03-26 09:55:32,145 INFO L129 PetriNetUnfolder]: 595/1319 cut-off events. [2021-03-26 09:55:32,145 INFO L130 PetriNetUnfolder]: For 1103/1163 co-relation queries the response was YES. [2021-03-26 09:55:32,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3799 conditions, 1319 events. 595/1319 cut-off events. For 1103/1163 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 9962 event pairs, 31 based on Foata normal form. 1/1181 useless extension candidates. Maximal degree in co-relation 3779. Up to 434 conditions per place. [2021-03-26 09:55:32,162 INFO L142 LiptonReduction]: Number of co-enabled transitions 856 [2021-03-26 09:55:32,529 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-03-26 09:55:32,687 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-03-26 09:55:32,723 INFO L154 LiptonReduction]: Checked pairs total: 362 [2021-03-26 09:55:32,723 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 09:55:32,724 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 729 [2021-03-26 09:55:32,724 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 258 flow [2021-03-26 09:55:32,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states 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 09:55:32,725 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:32,725 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:32,725 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 09:55:32,725 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:32,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:32,725 INFO L82 PathProgramCache]: Analyzing trace with hash 548321998, now seen corresponding path program 1 times [2021-03-26 09:55:32,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:32,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623225352] [2021-03-26 09:55:32,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:32,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:32,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:55:32,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:32,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:32,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:32,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:32,782 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 09:55:32,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623225352] [2021-03-26 09:55:32,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:32,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:55:32,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484546986] [2021-03-26 09:55:32,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:55:32,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:32,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:55:32,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:55:32,784 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 219 [2021-03-26 09:55:32,785 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states 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 09:55:32,785 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:32,785 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 219 [2021-03-26 09:55:32,785 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:33,020 INFO L129 PetriNetUnfolder]: 1061/2250 cut-off events. [2021-03-26 09:55:33,020 INFO L130 PetriNetUnfolder]: For 4470/4876 co-relation queries the response was YES. [2021-03-26 09:55:33,033 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6413 conditions, 2250 events. 1061/2250 cut-off events. For 4470/4876 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 18930 event pairs, 95 based on Foata normal form. 85/2099 useless extension candidates. Maximal degree in co-relation 6391. Up to 766 conditions per place. [2021-03-26 09:55:33,037 INFO L132 encePairwiseOnDemand]: 216/219 looper letters, 3 selfloop transitions, 2 changer transitions 3/53 dead transitions. [2021-03-26 09:55:33,038 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 270 flow [2021-03-26 09:55:33,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 09:55:33,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 09:55:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 738 transitions. [2021-03-26 09:55:33,040 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8424657534246576 [2021-03-26 09:55:33,040 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 738 transitions. [2021-03-26 09:55:33,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 738 transitions. [2021-03-26 09:55:33,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:33,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 738 transitions. [2021-03-26 09:55:33,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 0 states have call successors, (0), 0 states 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 09:55:33,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states 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 09:55:33,044 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states 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 09:55:33,044 INFO L185 Difference]: Start difference. First operand has 60 places, 52 transitions, 258 flow. Second operand 4 states and 738 transitions. [2021-03-26 09:55:33,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 270 flow [2021-03-26 09:55:33,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 53 transitions, 267 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 09:55:33,122 INFO L241 Difference]: Finished difference. Result has 63 places, 50 transitions, 252 flow [2021-03-26 09:55:33,122 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2021-03-26 09:55:33,122 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2021-03-26 09:55:33,122 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:33,122 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 50 transitions, 252 flow [2021-03-26 09:55:33,122 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 50 transitions, 252 flow [2021-03-26 09:55:33,123 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 252 flow [2021-03-26 09:55:33,289 INFO L129 PetriNetUnfolder]: 575/1248 cut-off events. [2021-03-26 09:55:33,290 INFO L130 PetriNetUnfolder]: For 1625/1730 co-relation queries the response was YES. [2021-03-26 09:55:33,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3537 conditions, 1248 events. 575/1248 cut-off events. For 1625/1730 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 9344 event pairs, 41 based on Foata normal form. 37/1161 useless extension candidates. Maximal degree in co-relation 3516. Up to 434 conditions per place. [2021-03-26 09:55:33,310 INFO L142 LiptonReduction]: Number of co-enabled transitions 736 [2021-03-26 09:55:33,403 INFO L154 LiptonReduction]: Checked pairs total: 116 [2021-03-26 09:55:33,403 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 09:55:33,403 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 281 [2021-03-26 09:55:33,406 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 252 flow [2021-03-26 09:55:33,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states 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 09:55:33,406 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:33,406 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:33,407 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 09:55:33,407 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:33,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:33,407 INFO L82 PathProgramCache]: Analyzing trace with hash 250822877, now seen corresponding path program 1 times [2021-03-26 09:55:33,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:33,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728362258] [2021-03-26 09:55:33,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:55:33,539 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-03-26 09:55:33,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 09:55:33,552 INFO L142 QuantifierPusher]: treesize reduction 14, result has 83.3 percent of original size [2021-03-26 09:55:33,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2021-03-26 09:55:33,616 INFO L142 QuantifierPusher]: treesize reduction 21, result has 76.7 percent of original size [2021-03-26 09:55:33,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 69 [2021-03-26 09:55:33,674 INFO L142 QuantifierPusher]: treesize reduction 12, result has 82.6 percent of original size [2021-03-26 09:55:33,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-03-26 09:55:33,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:33,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 09:55:33,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:55:33,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:55:33,738 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 09:55:33,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728362258] [2021-03-26 09:55:33,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:55:33,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 09:55:33,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426785615] [2021-03-26 09:55:33,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 09:55:33,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:55:33,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 09:55:33,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-26 09:55:33,741 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 221 [2021-03-26 09:55:33,742 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 252 flow. Second operand has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states 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 09:55:33,742 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:55:33,742 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 221 [2021-03-26 09:55:33,742 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:55:34,196 INFO L129 PetriNetUnfolder]: 996/2102 cut-off events. [2021-03-26 09:55:34,196 INFO L130 PetriNetUnfolder]: For 3405/4193 co-relation queries the response was YES. [2021-03-26 09:55:34,205 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6509 conditions, 2102 events. 996/2102 cut-off events. For 3405/4193 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 17206 event pairs, 76 based on Foata normal form. 137/2020 useless extension candidates. Maximal degree in co-relation 6486. Up to 643 conditions per place. [2021-03-26 09:55:34,209 INFO L132 encePairwiseOnDemand]: 215/221 looper letters, 15 selfloop transitions, 9 changer transitions 10/63 dead transitions. [2021-03-26 09:55:34,209 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 394 flow [2021-03-26 09:55:34,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 09:55:34,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 09:55:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1151 transitions. [2021-03-26 09:55:34,212 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7440206851971558 [2021-03-26 09:55:34,212 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1151 transitions. [2021-03-26 09:55:34,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1151 transitions. [2021-03-26 09:55:34,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:55:34,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1151 transitions. [2021-03-26 09:55:34,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 164.42857142857142) internal successors, (1151), 7 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states 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 09:55:34,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states 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 09:55:34,218 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states 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 09:55:34,218 INFO L185 Difference]: Start difference. First operand has 61 places, 49 transitions, 252 flow. Second operand 7 states and 1151 transitions. [2021-03-26 09:55:34,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 394 flow [2021-03-26 09:55:34,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 389 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 09:55:34,280 INFO L241 Difference]: Finished difference. Result has 68 places, 46 transitions, 281 flow [2021-03-26 09:55:34,280 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=281, PETRI_PLACES=68, PETRI_TRANSITIONS=46} [2021-03-26 09:55:34,281 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2021-03-26 09:55:34,281 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:55:34,281 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 46 transitions, 281 flow [2021-03-26 09:55:34,281 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 46 transitions, 281 flow [2021-03-26 09:55:34,281 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 46 transitions, 281 flow [2021-03-26 09:55:34,348 INFO L129 PetriNetUnfolder]: 329/785 cut-off events. [2021-03-26 09:55:34,348 INFO L130 PetriNetUnfolder]: For 1870/1986 co-relation queries the response was YES. [2021-03-26 09:55:34,351 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2321 conditions, 785 events. 329/785 cut-off events. For 1870/1986 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5681 event pairs, 26 based on Foata normal form. 38/734 useless extension candidates. Maximal degree in co-relation 2297. Up to 259 conditions per place. [2021-03-26 09:55:34,357 INFO L142 LiptonReduction]: Number of co-enabled transitions 534 [2021-03-26 09:55:35,505 WARN L205 SmtUtils]: Spent 914.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 211 [2021-03-26 09:55:35,865 WARN L205 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 204 [2021-03-26 09:55:38,185 WARN L205 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 377 DAG size of output: 313 [2021-03-26 09:55:39,004 WARN L205 SmtUtils]: Spent 815.00 ms on a formula simplification that was a NOOP. DAG size: 305 [2021-03-26 09:55:39,020 INFO L154 LiptonReduction]: Checked pairs total: 61 [2021-03-26 09:55:39,020 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 09:55:39,020 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4739 [2021-03-26 09:55:39,021 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 281 flow [2021-03-26 09:55:39,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states 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 09:55:39,034 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:55:39,034 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:55:39,034 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 09:55:39,034 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:55:39,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:55:39,034 INFO L82 PathProgramCache]: Analyzing trace with hash 91302189, now seen corresponding path program 1 times [2021-03-26 09:55:39,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:55:39,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068696768] [2021-03-26 09:55:39,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:55:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 09:55:39,089 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 09:55:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 09:55:39,145 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 09:55:39,186 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 09:55:39,186 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 09:55:39,186 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 09:55:39,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 09:55:39 BasicIcfg [2021-03-26 09:55:39,290 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 09:55:39,290 INFO L168 Benchmark]: Toolchain (without parser) took 20559.31 ms. Allocated memory was 255.9 MB in the beginning and 673.2 MB in the end (delta: 417.3 MB). Free memory was 234.9 MB in the beginning and 280.6 MB in the end (delta: -45.6 MB). Peak memory consumption was 371.2 MB. Max. memory is 16.0 GB. [2021-03-26 09:55:39,291 INFO L168 Benchmark]: CDTParser took 0.15 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 09:55:39,291 INFO L168 Benchmark]: CACSL2BoogieTranslator took 500.04 ms. Allocated memory was 255.9 MB in the beginning and 360.7 MB in the end (delta: 104.9 MB). Free memory was 234.4 MB in the beginning and 318.5 MB in the end (delta: -84.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-26 09:55:39,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.20 ms. Allocated memory is still 360.7 MB. Free memory was 318.5 MB in the beginning and 316.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 09:55:39,291 INFO L168 Benchmark]: Boogie Preprocessor took 57.93 ms. Allocated memory is still 360.7 MB. Free memory was 316.4 MB in the beginning and 313.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 09:55:39,292 INFO L168 Benchmark]: RCFGBuilder took 2102.77 ms. Allocated memory is still 360.7 MB. Free memory was 313.6 MB in the beginning and 191.5 MB in the end (delta: 122.1 MB). Peak memory consumption was 126.6 MB. Max. memory is 16.0 GB. [2021-03-26 09:55:39,292 INFO L168 Benchmark]: TraceAbstraction took 17824.80 ms. Allocated memory was 360.7 MB in the beginning and 673.2 MB in the end (delta: 312.5 MB). Free memory was 190.5 MB in the beginning and 280.6 MB in the end (delta: -90.1 MB). Peak memory consumption was 223.4 MB. Max. memory is 16.0 GB. [2021-03-26 09:55:39,293 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.15 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 500.04 ms. Allocated memory was 255.9 MB in the beginning and 360.7 MB in the end (delta: 104.9 MB). Free memory was 234.4 MB in the beginning and 318.5 MB in the end (delta: -84.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 69.20 ms. Allocated memory is still 360.7 MB. Free memory was 318.5 MB in the beginning and 316.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 57.93 ms. Allocated memory is still 360.7 MB. Free memory was 316.4 MB in the beginning and 313.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2102.77 ms. Allocated memory is still 360.7 MB. Free memory was 313.6 MB in the beginning and 191.5 MB in the end (delta: 122.1 MB). Peak memory consumption was 126.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 17824.80 ms. Allocated memory was 360.7 MB in the beginning and 673.2 MB in the end (delta: 312.5 MB). Free memory was 190.5 MB in the beginning and 280.6 MB in the end (delta: -90.1 MB). Peak memory consumption was 223.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3619.9ms, 128 PlacesBefore, 62 PlacesAfterwards, 117 TransitionsBefore, 50 TransitionsAfterwards, 2894 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 5923 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2834, positive: 2708, positive conditional: 2708, positive unconditional: 0, negative: 126, negative conditional: 126, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2834, positive: 2708, positive conditional: 0, positive unconditional: 2708, negative: 126, negative conditional: 0, negative unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2834, positive: 2708, positive conditional: 0, positive unconditional: 2708, negative: 126, negative conditional: 0, negative unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1977, positive: 1927, positive conditional: 0, positive unconditional: 1927, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1977, positive: 1919, positive conditional: 0, positive unconditional: 1919, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 58, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 637, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 600, negative conditional: 0, negative unconditional: 600, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2834, positive: 781, positive conditional: 0, positive unconditional: 781, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 1977, unknown conditional: 0, unknown unconditional: 1977] , Statistics on independence cache: Total cache size (in pairs): 1977, Positive cache size: 1927, Positive conditional cache size: 0, Positive unconditional cache size: 1927, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1470.1ms, 58 PlacesBefore, 44 PlacesAfterwards, 47 TransitionsBefore, 33 TransitionsAfterwards, 670 CoEnabledTransitionPairs, 4 FixpointIterations, 10 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 2974 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 801, positive: 668, positive conditional: 668, positive unconditional: 0, negative: 133, negative conditional: 133, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 801, positive: 668, positive conditional: 38, positive unconditional: 630, negative: 133, negative conditional: 4, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 801, positive: 668, positive conditional: 38, positive unconditional: 630, negative: 133, negative conditional: 4, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 166, positive: 135, positive conditional: 7, positive unconditional: 128, negative: 31, negative conditional: 1, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 166, positive: 133, positive conditional: 0, positive unconditional: 133, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 31, negative conditional: 1, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 419, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 413, negative conditional: 21, negative unconditional: 392, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 801, positive: 533, positive conditional: 31, positive unconditional: 502, negative: 102, negative conditional: 3, negative unconditional: 99, unknown: 166, unknown conditional: 8, unknown unconditional: 158] , Statistics on independence cache: Total cache size (in pairs): 2143, Positive cache size: 2062, Positive conditional cache size: 7, Positive unconditional cache size: 2055, Negative cache size: 81, Negative conditional cache size: 1, Negative unconditional cache size: 80, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1397.1ms, 47 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1622 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 409, positive: 324, positive conditional: 324, positive unconditional: 0, negative: 85, negative conditional: 85, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 409, positive: 324, positive conditional: 0, positive unconditional: 324, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 409, positive: 324, positive conditional: 0, positive unconditional: 324, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 0, negative unconditional: 6, 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: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 409, positive: 311, positive conditional: 0, positive unconditional: 311, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 2162, Positive cache size: 2075, Positive conditional cache size: 7, Positive unconditional cache size: 2068, Negative cache size: 87, Negative conditional cache size: 1, Negative unconditional cache size: 86, Eliminated conditions: 33 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 40.4ms, 41 PlacesBefore, 40 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 948 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 201, positive: 150, positive conditional: 150, positive unconditional: 0, negative: 51, negative conditional: 51, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 201, positive: 150, positive conditional: 0, positive unconditional: 150, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 201, positive: 150, positive conditional: 0, positive unconditional: 150, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 201, positive: 143, positive conditional: 0, positive unconditional: 143, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 2171, Positive cache size: 2082, Positive conditional cache size: 7, Positive unconditional cache size: 2075, Negative cache size: 89, Negative conditional cache size: 1, Negative unconditional cache size: 88, Eliminated conditions: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.9ms, 45 PlacesBefore, 43 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 444 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 402 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, positive: 40, positive conditional: 40, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 59, positive: 40, positive conditional: 1, positive unconditional: 39, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 40, positive conditional: 1, positive unconditional: 39, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 59, positive: 33, positive conditional: 1, positive unconditional: 32, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 2178, Positive cache size: 2089, Positive conditional cache size: 7, Positive unconditional cache size: 2082, Negative cache size: 89, Negative conditional cache size: 1, Negative unconditional cache size: 88, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 67.2ms, 49 PlacesBefore, 47 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 528 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 480 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 98, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 98, positive: 78, positive conditional: 26, positive unconditional: 52, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 98, positive: 78, positive conditional: 26, positive unconditional: 52, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, positive: 18, positive conditional: 6, positive unconditional: 12, 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: 21, positive: 18, positive conditional: 0, positive unconditional: 18, 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: 48, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 98, positive: 60, positive conditional: 20, positive unconditional: 40, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 21, unknown conditional: 6, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 2199, Positive cache size: 2107, Positive conditional cache size: 13, Positive unconditional cache size: 2094, Negative cache size: 92, Negative conditional cache size: 1, Negative unconditional cache size: 91, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 52.4ms, 52 PlacesBefore, 50 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 528 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 553 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, positive: 103, positive conditional: 103, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 126, positive: 103, positive conditional: 45, positive unconditional: 58, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 126, positive: 103, positive conditional: 45, positive unconditional: 58, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 16, positive conditional: 12, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 126, positive: 87, positive conditional: 33, positive unconditional: 54, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 18, unknown conditional: 12, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 2217, Positive cache size: 2123, Positive conditional cache size: 25, Positive unconditional cache size: 2098, Negative cache size: 94, Negative conditional cache size: 1, Negative unconditional cache size: 93, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 51.7ms, 50 PlacesBefore, 50 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 552 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 595 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 147, positive: 123, positive conditional: 123, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 147, positive: 123, positive conditional: 60, positive unconditional: 63, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 147, positive: 123, positive conditional: 60, positive unconditional: 63, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 12, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 147, positive: 108, positive conditional: 48, positive unconditional: 60, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 17, unknown conditional: 12, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 2234, Positive cache size: 2138, Positive conditional cache size: 37, Positive unconditional cache size: 2101, Negative cache size: 96, Negative conditional cache size: 1, Negative unconditional cache size: 95, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 124.4ms, 59 PlacesBefore, 59 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 876 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 233 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, positive: 86, positive conditional: 86, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 93, positive: 86, positive conditional: 48, positive unconditional: 38, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 93, positive: 86, positive conditional: 48, positive unconditional: 38, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, positive: 25, positive conditional: 16, 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: 25, positive: 25, positive conditional: 0, positive unconditional: 25, 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: 93, positive: 61, positive conditional: 32, positive unconditional: 29, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 25, unknown conditional: 16, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 2259, Positive cache size: 2163, Positive conditional cache size: 53, Positive unconditional cache size: 2110, Negative cache size: 96, Negative conditional cache size: 1, Negative unconditional cache size: 95, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 884.6ms, 65 PlacesBefore, 63 PlacesAfterwards, 55 TransitionsBefore, 54 TransitionsAfterwards, 822 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 542 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 252, positive: 234, positive conditional: 234, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 252, positive: 234, positive conditional: 150, positive unconditional: 84, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 252, positive: 234, positive conditional: 150, positive unconditional: 84, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 252, positive: 231, positive conditional: 147, positive unconditional: 84, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2262, Positive cache size: 2166, Positive conditional cache size: 56, Positive unconditional cache size: 2110, Negative cache size: 96, Negative conditional cache size: 1, Negative unconditional cache size: 95, Eliminated conditions: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 728.5ms, 62 PlacesBefore, 60 PlacesAfterwards, 54 TransitionsBefore, 52 TransitionsAfterwards, 856 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 362 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 264, positive: 252, positive conditional: 252, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 264, positive: 252, positive conditional: 181, positive unconditional: 71, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 264, positive: 252, positive conditional: 181, positive unconditional: 71, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 10, 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: 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: 264, positive: 242, positive conditional: 171, positive unconditional: 71, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2272, Positive cache size: 2176, Positive conditional cache size: 66, Positive unconditional cache size: 2110, Negative cache size: 96, Negative conditional cache size: 1, Negative unconditional cache size: 95, Eliminated conditions: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 280.5ms, 63 PlacesBefore, 61 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 736 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 116 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, positive: 80, positive conditional: 80, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, positive: 80, positive conditional: 44, positive unconditional: 36, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 82, positive: 80, positive conditional: 44, positive unconditional: 36, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, positive: 20, positive conditional: 10, positive unconditional: 10, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 82, positive: 60, positive conditional: 34, positive unconditional: 26, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 21, unknown conditional: 10, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 2293, Positive cache size: 2196, Positive conditional cache size: 76, Positive unconditional cache size: 2120, Negative cache size: 97, Negative conditional cache size: 1, Negative unconditional cache size: 96, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4739.1ms, 68 PlacesBefore, 64 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 534 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 61 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, positive: 61, positive conditional: 36, positive unconditional: 25, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, positive: 61, positive conditional: 36, positive unconditional: 25, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 4, positive unconditional: 4, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 176, positive: 144, positive conditional: 144, positive unconditional: 0, negative: 31, negative conditional: 31, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, positive: 53, positive conditional: 32, positive unconditional: 21, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 9, unknown conditional: 5, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 2302, Positive cache size: 2204, Positive conditional cache size: 80, Positive unconditional cache size: 2124, Negative cache size: 98, Negative conditional cache size: 2, Negative unconditional cache size: 96, Eliminated conditions: 18 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool a$flush_delayed; [L726] 0 int a$mem_tmp; [L727] 0 _Bool a$r_buff0_thd0; [L728] 0 _Bool a$r_buff0_thd1; [L729] 0 _Bool a$r_buff0_thd2; [L730] 0 _Bool a$r_buff0_thd3; [L731] 0 _Bool a$r_buff0_thd4; [L732] 0 _Bool a$r_buff1_thd0; [L733] 0 _Bool a$r_buff1_thd1; [L734] 0 _Bool a$r_buff1_thd2; [L735] 0 _Bool a$r_buff1_thd3; [L736] 0 _Bool a$r_buff1_thd4; [L737] 0 _Bool a$read_delayed; [L738] 0 int *a$read_delayed_var; [L739] 0 int a$w_buff0; [L740] 0 _Bool a$w_buff0_used; [L741] 0 int a$w_buff1; [L742] 0 _Bool a$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t337; [L874] FCALL, FORK 0 pthread_create(&t337, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t338; [L876] FCALL, FORK 0 pthread_create(&t338, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 a$w_buff1 = a$w_buff0 [L757] 1 a$w_buff0 = 1 [L758] 1 a$w_buff1_used = a$w_buff0_used [L759] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L761] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L762] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L763] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L764] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L765] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L766] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 [L789] 2 __unbuffered_p1_EAX = x [L792] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L877] 0 pthread_t t339; [L878] FCALL, FORK 0 pthread_create(&t339, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L809] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=1, y=1, z=0] [L812] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=1, y=1, z=0] [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L817] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L817] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L818] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L818] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L819] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L819] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L795] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L795] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L796] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L796] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L797] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L797] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L798] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L798] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L799] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L799] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L879] 0 pthread_t t340; [L880] FCALL, FORK 0 pthread_create(&t340, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, 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=1, y=1, z=0] [L829] 4 z = 1 [L832] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, 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=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 a$flush_delayed = weak$$choice2 [L838] 4 a$mem_tmp = a [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L839] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L840] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L840] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L840] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L840] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L841] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L841] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L841] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L841] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L842] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L842] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L842] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L842] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L843] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L844] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L844] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L844] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L845] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L845] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L845] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = a [L847] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L847] 4 a = a$flush_delayed ? a$mem_tmp : a [L848] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L851] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L851] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L852] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L852] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L853] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L853] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L854] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L854] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L855] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L855] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L886] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L886] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L887] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L887] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L888] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L888] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L889] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L889] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L890] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L890] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 120 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 17549.7ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2114.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3732.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 55 SDtfs, 39 SDslu, 34 SDs, 0 SdLazy, 401 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 412.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 442.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=326occurred in iteration=9, InterpolantAutomatonStates: 63, 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.8ms SsaConstructionTime, 516.5ms SatisfiabilityAnalysisTime, 936.8ms InterpolantComputationTime, 274 NumberOfCodeBlocks, 274 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 1344 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...